The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing
From MaRDI portal
Abstract: Recovery of the sparsity pattern (or support) of an unknown sparse vector from a limited number of noisy linear measurements is an important problem in compressed sensing. In the high-dimensional setting, it is known that recovery with a vanishing fraction of errors is impossible if the measurement rate and the per-sample signal-to-noise ratio (SNR) are finite constants, independent of the vector length. In this paper, it is shown that recovery with an arbitrarily small but constant fraction of errors is, however, possible, and that in some cases computationally simple estimators are near-optimal. Bounds on the measurement rate needed to attain a desired fraction of errors are given in terms of the SNR and various key parameters of the unknown vector for several different recovery algorithms. The tightness of the bounds, in a scaling sense, as a function of the SNR and the fraction of errors, is established by comparison with existing information-theoretic necessary bounds. Near optimality is shown for a wide variety of practically motivated signal models.
Cited in
(6)- The all-or-nothing phenomenon in sparse linear regression
- Sparse high-dimensional linear regression. Estimating squared error and a phase transition
- Compressive classification: where wireless communications meets machine learning
- A Measurement Rate-MSE Tradeoff for Compressive Sensing Through Partial Support Recovery
- A Rate-Distortion Optimal Alternative to Matching Pursuit
- On the Trade-Off Between Bit Depth and Number of Samples for a Basic Approach to Structured Signal Recovery From <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Bit Quantized Linear Measurements
This page was built for publication: The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271970)