The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Stable recovery of sparse overcomplete representations in the presence of noise
Abstract
Overcomplete representations are attracting interest in signal processing theory, particularly due to their potential to generate sparse representations of signals. However, in general, the problem of finding sparse representations must be unstable in the presence of noise. This paper establishes the possibility of stable recovery under a combination of sufficient sparsity and favorable structure of the overcomplete system. Considering an ideal underlying signal that has a sufficiently sparse representation, it is assumed that only a noisy version of it can be observed. Assuming further that the overcomplete system is incoherent, it is shown that the optimally sparse approximation to the noisy data differs from the optimally sparse decomposition of the ideal noiseless signal by at most a constant multiple of the noise level. As this optimal-sparsity method requires heavy (combinatorial) computational effort, approximation algorithms are considered. It is shown that similar stability is also available using the basis and the matching pursuit algorithms. Furthermore, it is shown that these methods result in sparse approximation of the noisy data that contains only terms also appearing in the unique sparsest representation of the ideal noiseless sparse signal.
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
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
Self-citationPati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (2002) · Proceedings of 27th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.1993.342465 · Cited by 4,323
Sparse coding with an overcomplete basis set: A strategy employed by V1?
Olshausen, B. A., & Field, D. J. (1997) · Vision Research · doi:10.1016/s0042-6989(97)00169-7 · Cited by 3,642
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
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Self-citationThe curvelet transform for image denoising
Starck, J.-L., Candes, E. J., & Donoho, D. L. (2002) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.1014998 · Cited by 2,253
Self-citationUncertainty principles and ideal atomic decomposition
Donoho, D. L., & Huo, X. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959265 · Cited by 1,949
Self-citationSparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
Gorodnitsky, I. F., & Rao, B. D. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558475 · Cited by 1,834
Kruskal, J. B. (1977) · Linear Algebra and its Applications · doi:10.1016/0024-3795(77)90069-6 · Cited by 1,619
New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
Candès, E. J., & Donoho, D. L. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.10116 · Cited by 1,545
Self-citationAdapted wavelet analysis from theory to software
Wickerhauser, M. V. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,204
Sparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
Grassmannian frames with applications to coding and communication
Strohmer, T., & Heath, R. W. (2003) · Applied and Computational Harmonic Analysis · doi:10.1016/s1063-5203(03)00023-x · Cited by 955
A generalized uncertainty principle and sparse representation in pairs of bases
Elad, M., & Bruckstein, A. M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.801410 · Cited by 673
Self-citationSparse channel estimation via matching pursuit with application to equalization
Cotter, S. F., & Rao, B. D. (2002) · IEEE Transactions on Communications · doi:10.1109/26.990897 · Cited by 671
Some remarks on greedy algorithms
DeVore, R., & Temlyakov, V. N. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02124742 · Cited by 573
Self-citationOn Sparse Representations in Arbitrary Redundant Bases
Fuchs, J.-J. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828141 · Cited by 563
Chen, S., & Donoho, D. L. (1994) · Cited by 467
Self-citationOrthogonal Tensor Decompositions
Kolda, T. G. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479800368354 · Cited by 376
Recovery of Exact Sparse Representations in the Presence of Bounded Noise
Fuchs, J. J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855614 · Cited by 314
Superresolution via Sparsity Constraints
Donoho, D. L. (1992) · SIAM Journal on Mathematical Analysis · doi:10.1137/0523074 · Cited by 298
Self-citationNonlinear Methods of Approximation
Temlyakov, V. N. (2003) · Foundations of Computational Mathematics · doi:10.1007/s102080010029 · Cited by 290
Self-citationSignal representation using adaptive normalized Gaussian functions
Qian, S., & Chen, D. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90174-0 · Cited by 248
Fitting Equations to Data: Computer Analysis of Multifactor Data
Lucas, J. M., Daniel, C., & Wood, F. S. (1981) · Technometrics · doi:10.2307/1268046 · Cited by 225
Cramer-Rao lower bounds for low-rank decomposition of multidimensional arrays
Liu, X., & Sidiropoulos, N. D. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.942635 · Cited by 206
Approximation of functions over redundant dictionaries using coherence
Gilbert, A. C., Muthukrishnan, S., & Strauss, M. J. (2003) · doi:10.5555/644108.644149 · Cited by 183
Just relax: Convex programming methods for subset selection and sparse approximation
Tropp, J. A. (2004) · Cited by 113
Compactly supported tight affine spline frames in 𝐿₂(ℝ^{𝕕})
Ron, A., & Shen, Z. (1998) · Mathematics of Computation · doi:10.1090/s0025-5718-98-00898-9 · Cited by 94
Greedy Algorithms andM-Term Approximation with Regard to Redundant Dictionaries
Temlyakov, V. N. (1999) · Journal of Approximation Theory · doi:10.1006/jath.1998.3265 · Cited by 86
Self-citationImproved sparse approximation over quasiincoherent dictionaries
Tropp, J. A., Gilbert, A. C., Muthukrishnan, S., & Strauss, M. (2004) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2003.1246892 · Cited by 73
Cited by
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Self-citation$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
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
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
Self-citationImage Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
Self-citation
Metadata
- Authors
- Donoho, D. L., Elad, M., & Temlyakov, V. N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-01
- Volume
- 52
- Issue
- 1
- Pages
- 6-18
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2097323375
- Cited by
- 2,183
- References
- 35
- FWCI
- 80.06
- 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.