The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Dense Error Correction Via $\ell^1$-Minimization
Abstract
This paper studies the problem of recovering a sparse signal x ∈ ℝnfrom highly corrupted linear measurements y = Ax + e ∈ ℝm, where e is an unknown error vector whose nonzero entries may be unbounded. Motivated by an observation from face recognition in computer vision, this paper proves that for highly correlated (and possibly overcomplete) dictionaries A, any sufficiently sparse signal x can be recovered by solving an ℓ1-minimization problem min ||x||1 + ||e||1 subject to y = Ax + e. More precisely, if the fraction of the support of the error e is bounded away from one and the support of a: is a very small fraction of the dimension m, then as m becomes large the above ℓ1-minimization succeeds for all signals x and almost all sign-and-support patterns of e. This result suggests that accurate recovery of sparse signals is possible and computationally feasible even with nearly 100% of the observations corrupted. The proof relies on a careful characterization of the faces of a convex polytope spanned together by the standard crosspolytope and a set of independent identically distributed (i.i.d.) Gaussian vectors with nonzero mean and small variance, dubbed the "cross-and-bouquet" (CAB) model. Simulations and experiments corroborate the findings, and suggest extensions to the result.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
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
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
Self-citationCorless, R. M., Gonnet, G. H., Hare, D. E. G., Jeffrey, D. J., & Knuth, D. E. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02124750 · Cited by 6,150
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
Acquiring linear subspaces for face recognition under variable lighting
Lee, K.-C., Ho, J., & Kriegman, D. J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.92 · Cited by 2,391
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
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
The Concentration of Measure Phenomenon
Ledoux, M. (2005) · Mathematical Surveys and Monographs · doi:10.1090/surv/089 · Cited by 1,700
Image super-resolution as sparse representation of raw image patches
Yang, J., Wright, J., Huang, T., & Ma, Y. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587647 · Cited by 1,475
Self-citationAsymptotics for lasso-type estimators
Fu, W., & Knight, K. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957397 · Cited by 1,276
Robust Recovery of Signals From a Structured Union of Subspaces
Eldar, Y. C., & Mishali, M. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030471 · Cited by 1,044
Sipser, M., & Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556667 · Cited by 931
Needell, D., & Vershynin, R. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042412 · Cited by 850
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
Concentration of measure and isoperimetric inequalities in product spaces
Talagrand, M. (1995) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02699376 · Cited by 829
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2006) · Cited by 744
Discriminative learned dictionaries for local image analysis
Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587652 · Cited by 726
11-magic : Recovery of sparse signals via convex programming
Candès, E. J. (2005) · Medical Entomology and Zoology · Cited by 725
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20131 · Cited by 634
On Sparse Representations in Arbitrary Redundant Bases
Fuchs, J.-J. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828141 · Cited by 563
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2009) · The Annals of Statistics · doi:10.1214/07-aos582 · Cited by 489
Local Operator Theory, Random Matrices and Banach Spaces
(2001) · Handbook of the Geometry of Banach Spaces · doi:10.1016/s1874-5849(01)80010-3 · Cited by 432
The dimension of almost spherical sections of convex bodies
Figiel, T., Lindenstrauss, J., & Milman, V. D. (1977) · Acta Mathematica · doi:10.1007/bf02392234 · Cited by 401
Randomness conductors and constant-degree lossless expanders
Capalbo, M., Reingold, O., Vadhan, S., & Wigderson, A. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.510003 · Cited by 219
Face recognition with contiguous occlusion using markov random fields
Zhou, Z., Wagner, A., Mobahi, H., Wright, J., & Ma, Y. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459383 · Cited by 193
Self-citationLP Decoding Corrects a Constant Fraction of Errors
Feldman, J., Malkin, T., Servedio, R. A., Stein, C., & Wainwright, M. J. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.887523 · Cited by 107
Dense error correction for low-rank matrices via Principal Component Pursuit
Ganesh, A., Wright, J. N., Li, X., Candès, E. J., & Ma, Y. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513538 · Cited by 87
Self-citationA Decomposition Theory for Binary Linear Codes
Kashyap, N. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924700 · Cited by 57
Almost Euclidean subspaces of ℓ 1 N VIA expander codes
Guruswami, V., Lee, J. R., & Razborov, A. A. (2010) · COMBINATORICA · doi:10.1007/s00493-010-2463-9 · Cited by 49
Cited by
Robust Recovery of Subspace Structures by Low-Rank Representation
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.88 · Cited by 3,594
Self-citationSparse Representation for Computer Vision and Pattern Recognition
Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T. S., & Yan, S. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044470 · Cited by 1,847
Self-citationOff-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference
Yang, Z., Xie, L., & Zhang, C. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222378 · Cited by 968
Maximum Correntropy Criterion for Robust Face Recognition
He, R., Zheng, W.-S., & Hu, B.-G. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.220 · Cited by 670
Wagner, A., Wright, J., Ganesh, A., Zhou, Z., Mobahi, H., & Ma, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.112 · Cited by 629
Self-citation
Metadata
- Authors
- Wright, J., & Ma, Y.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2010-07
- Volume
- 56
- Issue
- 7
- Pages
- 3540-3560
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2096586829
- Cited by
- 305
- References
- 34
- FWCI
- 28.74
- 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.