The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing

• Published in: IEEE Transactions on Information Theory (ISSN: 0018-9448), vol. 58, num. 5, p. 3065-3092
• Institute of Electrical and Electronics Engineers, 2012

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.

Keywords: Compressed sensing, message passing algorithms, model selection, random matrix theory, sparsity, support recovery

Reference

• EPFL-ARTICLE-176935
• doi:10.1109/TIT.2012.2184848
• View record in Web of Science
• URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6142088&contentType=Journals+%26+Magazines&sortType%3Dasc_p_Sequence%26filter%3DAND%28p_IS_Number%3A6185725%29%26pageNumber%3D2

Record created on 2012-05-09, modified on 2017-05-12