English
Related papers

Related papers: Compressed sensing with corrupted observations

200 papers

This paper describes performance bounds for compressed sensing in the presence of Poisson noise when the underlying signal, a vector of Poisson intensities, is sparse or compressible (admits a sparse approximation). The signal-independent…

Information Theory · Computer Science 2009-04-30 Rebecca M. Willett , Maxim Raginsky

Consider the problem of reconstructing a multidimensional signal from an underdetermined set of measurements, as in the setting of compressed sensing. Without any additional assumptions, this problem is ill-posed. However, for signals such…

Numerical Analysis · Mathematics 2015-06-11 Deanna Needell , Rachel Ward

We investigate conditions for the unique recoverability of sparse integer-valued signals from a small number of linear measurements. Both the objective of minimizing the number of nonzero components, the so-called $\ell_0$-norm, as well as…

Information Theory · Computer Science 2019-09-18 Jan-Hendrik Lange , Marc E. Pfetsch , Bianca M. Seib , Andreas M. Tillmann

In this paper, we study the problem of compressed sensing using binary measurement matrices and $\ell_1$-norm minimization (basis pursuit) as the recovery algorithm. We derive new upper and lower bounds on the number of measurements to…

Machine Learning · Statistics 2020-04-28 Mahsa Lotfi , Mathukumalli Vidyasagar

We propose a new algorithm for recovery of sparse signals from their compressively sensed samples. The proposed algorithm benefits from the strategy of gradual movement to estimate the positions of non-zero samples of sparse signal. We…

Information Theory · Computer Science 2012-04-04 Seyed Hossein Hosseini , Mahrokh G. Shayesteh

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

We consider the problem of recovering sparse vectors from underdetermined linear measurements via $\ell_p$-constrained basis pursuit. Previous analyses of this problem based on generalized restricted isometry properties have suggested that…

Information Theory · Computer Science 2015-04-21 Sjoerd Dirksen , Guillaume Lecué , Holger Rauhut

Sign information is the key to overcoming the inevitable saturation error in compressive sensing systems, which causes information loss and results in bias. For sparse signal recovery from saturation, we propose to use a linear loss to…

Information Theory · Computer Science 2021-02-02 Fan He , Xiaolin Huang , Yipeng Liu , Ming Yan

Compressed sensing is a signal processing scheme that reconstructs high-dimensional sparse signals from a limited number of observations. In recent years, various problems involving signals with a finite number of discrete values have been…

Statistical Mechanics · Physics 2024-08-20 Mikiya Doi , Masayuki Ohzeki

Sparse linear regression with ill-conditioned Gaussian random designs is widely believed to exhibit a statistical/computational gap, but there is surprisingly little formal evidence for this belief, even in the form of examples that are…

Data Structures and Algorithms · Computer Science 2022-03-08 Jonathan A. Kelner , Frederic Koehler , Raghu Meka , Dhruv Rohatgi

It is well known that $\ell_1$ minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio between the system dimensions,…

Information Theory · Computer Science 2011-11-08 M. Amin Khajehnejad , Weiyu Xu , A. Salman Avestimehr , Babak Hassibi

In this paper, we introduce a sparse approximation property of order $s$ for a measurement matrix ${\bf A}$: $$\|{\bf x}_s\|_2\le D \|{\bf A}{\bf x}\|_2+ \beta \frac{\sigma_s({\bf x})}{\sqrt{s}} \quad {\rm for\ all} \ {\bf x},$$ where ${\bf…

Information Theory · Computer Science 2015-05-28 Qiyu Sun

This paper studies the problem of recovering a signal from one-bit compressed sensing measurements under a manifold model; that is, assuming that the signal lies on or near a manifold of low intrinsic dimension. We provide a convex recovery…

Information Theory · Computer Science 2020-07-24 Mark A. Iwen , Felix Krahmer , Sara Krause-Solberg , Johannes Maly

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

Recovering low-rank and sparse matrices from incomplete or corrupted observations is an important problem in machine learning, statistics, bioinformatics, computer vision, as well as signal and image processing. In theory, this problem can…

Machine Learning · Computer Science 2014-09-04 Fanhua Shang , Yuanyuan Liu , Hanghang Tong , James Cheng , Hong Cheng

We study the compressed sensing (CS) signal estimation problem where an input signal is measured via a linear matrix multiplication under additive noise. While this setup usually assumes sparsity or compressibility in the input signal…

Information Theory · Computer Science 2014-12-23 Junan Zhu , Dror Baron , Marco F. Duarte

Sparse recovery can recover sparse signals from a set of underdetermined linear measurements. Motivated by the need to monitor large-scale networks from a limited number of measurements, this paper addresses the problem of recovering sparse…

Information Theory · Computer Science 2015-03-20 Meng Wang , Weiyu Xu , Enrique Mallada , Ao Tang

We present a novel approach for recovering a sparse signal from cross-correlated data. Cross-correlations naturally arise in many fields of imaging, such as optics, holography and seismic interferometry. Compared to the sparse signal…

Signal Processing · Electrical Eng. & Systems 2021-04-28 Miguel Moscoso , Alexei Novikov , George Papanicolaou , Chrysoula Tsogka

Numerical experiments in literature on compressed sensing have indicated that the reweighted $l_1$ minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for…

Information Theory · Computer Science 2014-06-17 Shenglong Zhou , Naihua Xiu , Yingnan Wang , Lingchen Kong

Compressed sensing allows for the recovery of sparse signals from few measurements, whose number is proportional to the sparsity of the unknown signal, up to logarithmic factors. The classical theory typically considers either random linear…

Functional Analysis · Mathematics 2025-04-02 Giovanni S. Alberti , Alessandro Felisi , Matteo Santacesaria , S. Ivan Trapasso