English
Related papers

Related papers: Compressed Counting Meets Compressed Sensing

200 papers

Significance: Compressed sensing (CS) uses special measurement designs combined with powerful mathematical algorithms to reduce the amount of data to be collected while maintaining image quality. This is relevant to almost any imaging…

Computer Vision and Pattern Recognition · Computer Science 2024-02-27 Markus Haltmeier , Matthias Ye , Karoline Felbermayer , Florian Hinterleitner , Peter Burgholzer

The problem of multiple sensors simultaneously acquiring measurements of a single object can be found in many applications. In this paper, we present the optimal recovery guarantees for the recovery of compressible signals from multi-sensor…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Chen Li , Ben Adcock

The goal of compressed sensing is to reconstruct a sparse signal under a few linear measurements far less than the dimension of the ambient space of the signal. However, many real-life applications in physics and biomedical sciences carry…

Optimization and Control · Mathematics 2017-08-29 Angang Cui , Jigen Peng , Haiyang Li

Compressive sensing is considered a huge breakthrough in signal acquisition. It allows recording an image consisting of $N^2$ pixels using much fewer than $N^2$ measurements if it can be transformed to a basis where most pixels take on…

Optics · Physics 2013-04-02 Marc Aßmann , Manfred Bayer

The problem of recovering a structured signal from its linear measurements in the presence of speckle noise is studied. This problem appears in many imaging systems such as synthetic aperture radar and optical coherence tomography. The…

Information Theory · Computer Science 2021-08-03 Wenda Zhou , Shirin Jalali , Arian Maleki

This paper presents a novel power spectral density estimation technique for band-limited, wide-sense stationary signals from sub-Nyquist sampled data. The technique employs multi-coset sampling and incorporates the advantages of compressed…

Information Theory · Computer Science 2012-05-18 Michael A. Lexa , Mike E. Davies , John S. Thompson

In this paper, we investigate a Bayesian sparse reconstruction algorithm called compressive sensing via Bayesian support detection (CS-BSD). This algorithm is quite robust against measurement noise and achieves the performance of a minimum…

Information Theory · Computer Science 2012-05-15 Jaewook Kang , Heung-No Lee , Kiseon Kim

In compressed sensing, one wishes to acquire an approximately sparse high-dimensional signal $x\in\mathbb{R}^n$ via $m\ll n$ noisy linear measurements, then later approximately recover $x$ given only those measurement outcomes. Various…

Information Theory · Computer Science 2016-06-07 Tom Morgan , Jelani Nelson

Compressed sensing (CS) exploits the sparsity of a signal in order to integrate acquisition and compression. CS theory enables exact reconstruction of a sparse signal from relatively few linear measurements via a suitable nonlinear…

Information Theory · Computer Science 2014-09-04 Shmuel Friedland , Qun Li , Dan Schonfeld , Edgar A. Bernal

Natural signals and images are well-known to be approximately sparse in transform domains such as Wavelets and DCT. This property has been heavily exploited in various applications in image processing and medical imaging. Compressed sensing…

Machine Learning · Computer Science 2015-10-26 Saiprasad Ravishankar , Yoram Bresler

Compressive sensing achieves effective dimensionality reduction of signals, under a sparsity constraint, by means of a small number of random measurements acquired through a sensing matrix. In a signal processing system, the problem arises…

Information Theory · Computer Science 2014-03-13 Diego Valsesia , Enrico Magli

Blind Compressed Sensing (BCS) is an extension of Compressed Sensing (CS) where the optimal sparsifying dictionary is assumed to be unknown and subject to estimation (in addition to the CS sparse coefficients). Since the emergence of BCS,…

Information Theory · Computer Science 2015-08-11 Mohammad Aghagolzadeh , Hayder Radha

This paper proposes two novel schemes of wideband compressive spectrum sensing (CSS) via block orthogonal matching pursuit (BOMP) algorithm, for achieving high sensing accuracy in real time. These schemes aim to reliably recover the…

Signal Processing · Electrical Eng. & Systems 2023-04-14 Liyang Lu , Wenbo Xu , Yue Wang , Zhi Tian

We proposed a weighted l1 minimization to recover a sparse signal vector and the corrupted noise vector from a linear measurement when the sensing matrix A is an m by n row i.i.d subgaussian matrix. We obtain both uniform and nonuniform…

Information Theory · Computer Science 2016-01-25 Dongcai Su

Xampling generalizes compressed sensing (CS) to reduced-rate sampling of analog signals. A unified framework is introduced for low rate sampling and processing of signals lying in a union of subspaces. Xampling consists of two main blocks:…

Information Theory · Computer Science 2015-03-19 Moshe Mishali , Yonina C. Eldar

One-bit compressed sensing (1bCS) is an extreme-quantized signal acquisition method that has been intermittently studied in the past decade. In 1bCS, linear samples of a high dimensional signal are quantized to only one bit per sample (sign…

Information Theory · Computer Science 2021-09-15 Arya Mazumdar , Soumyabrata Pal

We propose a robust and efficient approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on…

Information Theory · Computer Science 2015-10-28 Sohail Bahmani , Justin Romberg

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

Methodology · Statistics 2007-11-13 Emmanuel J. Candes , Michael B. Wakin , Stephen P. Boyd

Compressed sensing is a promising technique that attempts to faithfully recover sparse signal with as few linear and nonadaptive measurements as possible. Its performance is largely determined by the characteristic of sensing matrix.…

Information Theory · Computer Science 2013-10-03 Weizhi Lu , Weiyu Li , Kidiyo Kpalma , Joseph Ronsin

Monte Carlo simulations of neutronic systems are computationally intensive and demand significant memory resources for high-fidelity modeling. Compressed sensing enables accurate reconstruction of signals from significantly fewer samples…

Computational Physics · Physics 2026-02-10 Ethan Lame , Camille Palmer , Todd Palmer , Ilham Variansyah
‹ Prev 1 8 9 10 Next ›