Skip to main content

"Compressed" compressed sensing

Journal articles
Reeves, G; Gastpar, M
Published in: IEEE International Symposium on Information Theory Proceedings
January 1, 2010

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an even smaller number of samples is sufficient when there exists prior knowledge about the distribution of the unknown vector, or when only partial recovery is needed. An information-theoretic lower bound with connections to free probability theory and an upper bound corresponding to a computationally simple thresholding estimator are derived. It is shown that in certain cases (e.g. discrete valued vectors or large distortions) the number of samples can be decreased. Interestingly though, it is also shown that in many cases no reduction is possible. © 2010 IEEE.

Duke Scholars

Altmetric Attention Stats
Dimensions Citation Stats

Published In

IEEE International Symposium on Information Theory Proceedings

DOI

EISSN

2157-8117

ISSN

2157-8095

Publication Date

January 1, 2010

Start / End Page

1548 / 1552
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Reeves, G., & Gastpar, M. (2010). "Compressed" compressed sensing. IEEE International Symposium on Information Theory Proceedings, 1548–1552. https://doi.org/10.1109/ISIT.2010.5513517
Reeves, G., and M. Gastpar. “"Compressed" compressed sensing.” IEEE International Symposium on Information Theory Proceedings, January 1, 2010, 1548–52. https://doi.org/10.1109/ISIT.2010.5513517.
Reeves G, Gastpar M. "Compressed" compressed sensing. IEEE International Symposium on Information Theory Proceedings. 2010 Jan 1;1548–52.
Reeves, G., and M. Gastpar. “"Compressed" compressed sensing.” IEEE International Symposium on Information Theory Proceedings, Jan. 2010, pp. 1548–52. Scopus, doi:10.1109/ISIT.2010.5513517.
Reeves G, Gastpar M. "Compressed" compressed sensing. IEEE International Symposium on Information Theory Proceedings. 2010 Jan 1;1548–1552.

Published In

IEEE International Symposium on Information Theory Proceedings

DOI

EISSN

2157-8117

ISSN

2157-8095

Publication Date

January 1, 2010

Start / End Page

1548 / 1552