Support recovery in compressed sensing: An estimation theoretic approach

Amin Karbasi, Ali Hormati, Soheil Mohajer, Martin Vetterli

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

Compressed sensing (CS) deals with the reconstruction of sparse signals from a small number of linear measurements. One of the main challenges in CS is to find the support of a sparse signal from a set of noisy observations. In the CS literature, several information-theoretic bounds on the scaling law of the required number of measurements for exact support recovery have been derived, where the focus is mainly on random measurement matrices. In this paper, we investigate the support recovery problem from an estimation theory point of view, where no specific assumption is made on the underlying measurement matrix. By using the Hammersley-Chapman-Robbins (HCR) bound, we derive a fundamental lower bound on the performance of any unbiased estimator which provides necessary conditions for reliable ℓ2-norm support recovery. We then analyze the optimal decoder to provide conditions under which the HCR bound is achievable. This leads to a set of sufficient conditions for reliable ℓ2-norm support recovery.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages679-683
Number of pages5
DOIs
StatePublished - 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/TerritoryKorea, Republic of
CitySeoul
Period6/28/097/3/09

Fingerprint

Dive into the research topics of 'Support recovery in compressed sensing: An estimation theoretic approach'. Together they form a unique fingerprint.

Cite this