The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
A Probabilistic and RIPless Theory of Compressed Sensing
Abstract
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a probability distributionF; it includes all standard models-e.g., Gaussian, frequency measurements-discussed in the literature, but also provides a framework for new measurement strategies as well. We prove that if the probability distributionFobeys a simple incoherence property and an isotropy property, one can faithfully recover approximately sparse signals from a minimal number of noisy measurements. The novelty is that our recovery results do not require the restricted isometry property (RIP) to hold near the sparsity level in question, nor a random model for the signal. As an example, the paper shows that a signal withsnonzero entries can be faithfully recovered from aboutslognFourier coefficients that are contaminated with noise.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Self-citationDecoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Self-citationStable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Self-citationJohnson, A. P. (2024) · Being and Becoming Teachers of Writing · doi:10.4324/9781003334798-34 · Cited by 4,502
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
Single-pixel imaging via compressive sampling
Duarte, M. F., Davenport, M. A., Takhar, D., Laska, J. N., Sun, T., Kelly, K. F., & Baraniuk, R. G. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914730 · Cited by 3,575
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
A Simple Proof of the Restricted Isometry Property for Random Matrices
Baraniuk, R., Davenport, M., DeVore, R., & Wakin, M. (2008) · Constructive Approximation · doi:10.1007/s00365-007-9003-x · Cited by 2,372
Convergence of Stochastic Processes.
Robinson, P. M., & Pollard, D. (1985) · Economica · doi:10.2307/2553898 · Cited by 2,184
Sparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
The Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
Self-citationLedoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Compressed sensing and best 𝑘-term approximation
Cohen, A., Dahmen, W., & DeVore, R. (2008) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-08-00610-3 · Cited by 1,002
On sparse reconstruction from Fourier and Gaussian measurements
Rudelson, M., & Vershynin, R. (2008) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20227 · Cited by 847
Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q⩽1
Foucart, S., & Lai, M.-J. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.09.001 · Cited by 715
On the conditions used to prove oracle results for the Lasso
van de Geer, S. A., & Bühlmann, P. (2009) · Electronic Journal of Statistics · doi:10.1214/09-ejs506 · Cited by 684
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20131 · Cited by 634
Recovering low-rank matrices from few coefficients in any basisPreprint
Gross, D. (2010) · Cited by 576
Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions
Candes, E. J., & Romberg, J. (2006) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0162-x · Cited by 504
Self-citationNear-ideal model selection by ℓ1 minimization
Candès, E. J., & Plan, Y. (2008) · Cited by 469
Self-citationCompressive Sensing by Random Convolution
Romberg, J. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/08072975x · Cited by 458
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Haupt, J., Bajwa, W. U., Raz, G., & Nowak, R. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2070191 · Cited by 424
Strong converse for identification via quantum channels
Ahlswede, R., & Winter, A. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.985947 · Cited by 423
Random Vectors in the Isotropic Position
Rudelson, M. (1999) · Journal of Functional Analysis · doi:10.1006/jfan.1998.3384 · Cited by 371
The Noise-Sensitivity Phase Transition in Compressed Sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165823 · Cited by 339
Probabilistic Methods for Algorithmic Discrete Mathematics
Habib, M., McDiarmid, C., Alfonsín, J. L. R., & Reed, B. A. (1998) · Algorithms and combinatorics · doi:10.1007/978-3-662-12788-9 · Cited by 338
Compressive Sensing with structured random matrices
Rauhut, H. (2010) · Cited by 322
Near-ideal model selection by ℓ1 minimization
Candès, E. J., & Plan, Y. (2009) · The Annals of Statistics · doi:10.1214/08-aos653 · Cited by 302
Self-citationThe LASSO Risk for Gaussian Matrices
Bayati, M., & Montanari, A. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2174612 · Cited by 277
Some sharp performance bounds for least squares regression with L1 regularizationPreprint
Zhang, T. (2009) · Cited by 208
Some sharp performance bounds for least squares regression with L1 regularization
Zhang, T. (2009) · The Annals of Statistics · doi:10.1214/08-aos659 · Cited by 200
Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
Jafarpour, S., Xu, W., Hassibi, B., & Calderbank, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2025528 · Cited by 174
Circulant and Toeplitz matrices in compressed sensingPreprint
Rauhut, H. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0902.4394 · Cited by 133
Subspaces of Small Codimension of Finite-Dimensional Banach Spaces
Pajor, A., & Nicole Tomczak-jaegermann, B. (1986) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1986-0845980-8 · Cited by 122
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
Bah, B., & Tanner, J. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100788884 · Cited by 78
Cited by
Review of snapshot spectral imaging technologies
Hagen, N., & Kudenov, M. W. (2013) · Optical Engineering · doi:10.1117/1.oe.52.9.090901 · Cited by 739
Compressive fluorescence microscopy for biological and hyperspectral imaging
Studer, V., Bobin, J., Chahid, M., Mousavi, H. S., Candes, E., & Dahan, M. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1119511109 · Cited by 411
Self-citationSpatial Compressive Sensing for MIMO Radar
Rossi, M., Haimovich, A. M., & Eldar, Y. C. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2289875 · Cited by 269
Ganguli, S., & Sompolinsky, H. (2012) · Annual Review of Neuroscience · doi:10.1146/annurev-neuro-062111-150410 · Cited by 256
BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
ADCOCK, B., HANSEN, A. C., POON, C., & ROMAN, B. (2017) · Forum of Mathematics, Sigma · doi:10.1017/fms.2016.32 · Cited by 256
Metadata
- Authors
- Candes, E. J., & Plan, Y.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-11
- Volume
- 57
- Issue
- 11
- Pages
- 7235-7254
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2137198385
- Cited by
- 598
- References
- 38
- FWCI
- 50.97
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.