preprint · arXiv (Cornell University) · 2010
"Compressed" Compressed Sensing
Cited by 0Open access
Abstract
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.
Cite this paper
Reeves, G., & Gastpar, M. (2010). "Compressed" Compressed Sensing. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1001.4295
Reeves, Galen, and Michael Gastpar. “"Compressed" Compressed Sensing.” arXiv (Cornell University), 2010, https://doi.org/10.48550/arxiv.1001.4295.
Reeves, Galen, and Michael Gastpar. 2010. “"Compressed" Compressed Sensing.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1001.4295.
Reeves, G. and Gastpar, M. (2010) ‘"Compressed" Compressed Sensing’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.1001.4295.
@misc{reeves2010compressed,
title = {{"Compressed" Compressed Sensing}},
author = {Reeves, Galen and Gastpar, Michael},
journal = {arXiv (Cornell University)},
year = {2010},
doi = {10.48550/arxiv.1001.4295}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
“Compressed” compressed sensing
Galen Reeves, Michael Gastpar · IEEE International Symposium on Information Theory (ISIT) · 2010
Cited by 34Open access
Compressed sensing under weak moment assumptions
Guillaume Lecué, Shahar Mendelson · 2014
Cited by 4
Oligoquantization in low-rate lossy source coding
Claudio Weidmann · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2002
Cited by 10Open access
Exact Support Recovery Under Dependence
Zheng Gao, Stilian Stoev · SpringerBriefs in probability and mathematical statistics · 2021
Cited by 0
Detection limits and fluctuation results in some spiked random matrix models and pooling of discrete data
A. El Alaoui · 2018
Cited by 0
High-dimensional estimation with geometric constraints
Yaniv Plan, Roman Vershynin, Elena Yudovina · arXiv (Cornell University) · 2014
Cited by 72Open access
Testing Mixtures of Discrete Distributions
Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld · arXiv (Cornell University) · 2019
Cited by 0Open access