Skip to main content

Sampling bounds for sparse support recovery in the presence of noise

Publication ,  Journal Article
Reeves, G; Gastpar, M
Published in: IEEE International Symposium on Information Theory - Proceedings
September 29, 2008

It is well known that the support of a sparse signal can be recovered from a small number of random projections. However, in the presence of noise all known sufficient conditions require that the per-sample signal-to-noise ratio (SNR) grows without bound with the dimension of the signal. If the noise is due to quantization of the samples, this means that an unbounded rate per sample is needed. In this paper, it is shown that an unbounded SNR is also a necessary condition for perfect recovery, but any fraction (less than one) of the support can be recovered with bounded SNR. This means that a finite rate per sample is sufficient for partial support recovery. Necessary and sufficient conditions are given for both stochastic and non-stochastic signal models. This problem arises in settings such as compressive sensing, model selection, and signal denoising. © 2008 IEEE.

Duke Scholars

Published In

IEEE International Symposium on Information Theory - Proceedings

DOI

Publication Date

September 29, 2008

Start / End Page

2187 / 2191
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Reeves, G., & Gastpar, M. (2008). Sampling bounds for sparse support recovery in the presence of noise. IEEE International Symposium on Information Theory - Proceedings, 2187–2191. https://doi.org/10.1109/ISIT.2008.4595378
Reeves, G., and M. Gastpar. “Sampling bounds for sparse support recovery in the presence of noise.” IEEE International Symposium on Information Theory - Proceedings, September 29, 2008, 2187–91. https://doi.org/10.1109/ISIT.2008.4595378.
Reeves G, Gastpar M. Sampling bounds for sparse support recovery in the presence of noise. IEEE International Symposium on Information Theory - Proceedings. 2008 Sep 29;2187–91.
Reeves, G., and M. Gastpar. “Sampling bounds for sparse support recovery in the presence of noise.” IEEE International Symposium on Information Theory - Proceedings, Sept. 2008, pp. 2187–91. Scopus, doi:10.1109/ISIT.2008.4595378.
Reeves G, Gastpar M. Sampling bounds for sparse support recovery in the presence of noise. IEEE International Symposium on Information Theory - Proceedings. 2008 Sep 29;2187–2191.

Published In

IEEE International Symposium on Information Theory - Proceedings

DOI

Publication Date

September 29, 2008

Start / End Page

2187 / 2191