Shannon-Theoretic Limits on Noisy Compressive Sampling
From MaRDI portal
Abstract: In this paper, we study the number of measurements required to recover a sparse signal in with non-zero coefficients from compressed samples in the presence of noise. For a number of different recovery criteria, we prove that (an asymptotically linear multiple of ) measurements are necessary and sufficient if grows linearly as a function of . This improves on the existing literature that is mostly focused on variants of a specific recovery algorithm based on convex programming, for which measurements are required. We also show that measurements are required in the sublinear regime ().
Cited in
(8)- An evolutionary strategy based on partial imitation for solving optimization problems
- The all-or-nothing phenomenon in sparse linear regression
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- Compressed Sensing Performance Bounds Under Poisson Noise
- Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling
- Optimum Compression of a Noisy Measurement for Transmission Over a Noisy Channel
- Performance Limits of Segmented Compressive Sampling: Correlated Measurements Versus Bits
- High-dimensional variable selection with heterogeneous signals: a precise asymptotic perspective
This page was built for publication: Shannon-Theoretic Limits on Noisy Compressive Sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976066)