The DOI matches its Crossref record; 81 of the 81 references it cites were found in a registry or an index.
Computational Methods for Sparse Solution of Linear Inverse Problems
Abstract
The goal of the sparse approximation problem is to approximate a target signal using a linear combination of a few elementary signals drawn from a fixed collection. This paper surveys the major practical algorithms for sparse approximation. Specific attention is paid to computational issues, to the circumstances in which individual methods tend to perform well, and to the theoretical guarantees available. Many fundamental questions in electrical engineering, statistics, and applied mathematics can be posed as sparse approximation problems, making these algorithms versatile and relevant to a plethora of applications.
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
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
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Self-citationEfron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
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
Stable 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
Cited by
Message-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Sparse representation or collaborative representation: Which helps face recognition?
Zhang, L., Yang, M., & Feng, X. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126277 · Cited by 1,952
Sparse 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
Nonlocally Centralized Sparse Representation for Image Restoration
Dong, W., Zhang, L., Shi, G., & Li, X. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2235847 · Cited by 1,505
Hyperspectral Image Classification Using Dictionary-Based Sparse Representation
Chen, Y., Nasrabadi, N. M., & Tran, T. D. (2011) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2011.2129595 · Cited by 1,155
Structured Compressed Sensing: From Theory to Applications
Duarte, M. F., & Eldar, Y. C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161982 · Cited by 1,128
Dong, W., Zhang, L., Shi, G., & Wu, X. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2108306 · Cited by 1,124
Federated Learning via Over-the-Air Computation
Yang, K., Jiang, T., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2961673 · Cited by 1,084
“Sparse optimization and low-rank optimization have attracted much attention in machine learning, signal processing, high-dimensional statistics, as well as wireless communication [30], [31], [32], [33], [34].”
Fisher Discrimination Dictionary Learning for sparse representation
Yang, M., Zhang, L., Feng, X., & Zhang, D. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126286 · Cited by 934
Tosic, I., & Frossard, P. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939537 · Cited by 897
Compressive Coded Aperture Spectral Imaging: An Introduction
Arce, G. R., Brady, D. J., Carin, L., Arguello, H., & Kittle, D. S. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2278763 · Cited by 661
Deep Learning Techniques for Inverse Problems in Imaging
Ongie, G., Jalal, A., Metzler, C. A., Baraniuk, R. G., Dimakis, A. G., & Willett, R. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.2991563 · Cited by 577
Sparse Representation Based Fisher Discrimination Dictionary Learning for Image Classification
Yang, M., Zhang, L., Feng, X., & Zhang, D. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-014-0722-8 · Cited by 489
A non-adapted sparse approximation of PDEs with stochastic inputs
Doostan, A., & Owhadi, H. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.01.002 · Cited by 436
Duarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
Sparse Representation for Target Detection in Hyperspectral Imagery
Chen, Y., Nasrabadi, N. M., & Tran, T. D. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2113170 · Cited by 428
Sparse Representation Based Image Interpolation With Nonlocal Autoregressive Modeling
Dong, W., Zhang, L., Lukac, R., & Shi, G. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2231086 · Cited by 362
Compressive Sensing in Electromagnetics - A Review
Massa, A., Rocca, P., & Oliveri, G. (2015) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.2015.2397092 · Cited by 360
Fast $\ell_{1}$-Minimization Algorithms for Robust Face Recognition
Yang, A. Y., Zhou, Z., Balasubramanian, A. G., Sastry, S. S., & Ma, Y. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2262292 · Cited by 341
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
Beck, A., & Eldar, Y. C. (2013) · SIAM Journal on Optimization · doi:10.1137/120869778 · Cited by 331
AMP-Net: Denoising-Based Deep Unfolding for Compressive Image Sensing
Zhang, Z., Liu, Y., Liu, J., Wen, F., & Zhu, C. (2021) · IEEE Transactions on Image Processing · doi:10.1109/tip.2020.3044472 · Cited by 311
Zhao, B., Haldar, J. P., Christodoulou, A. G., & Liang, Z.-P. (2012) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2012.2203921 · Cited by 295
Compressed sensing electron tomography
Leary, R., Saghi, Z., Midgley, P. A., & Holland, D. J. (2013) · Ultramicroscopy · doi:10.1016/j.ultramic.2013.03.019 · Cited by 281
Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)
Maleki, A., Anitori, L., Yang, Z., & Baraniuk, R. G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2252232 · Cited by 264
Newtonized Orthogonal Matching Pursuit: Frequency Estimation Over the Continuum
Mamandipoor, B., Ramasamy, D., & Madhow, U. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2580523 · Cited by 262
A note on the complexity of L p minimization
Ge, D., Jiang, X., & Ye, Y. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0470-2 · Cited by 254
Decomposition Methods for Machine Learning with Small, Incomplete or Noisy Datasets
Caiafa, C. F., Solé-Casals, J., Marti-Puig, P., Zhe, S., & Tanaka, T. (2020) · Applied Sciences · doi:10.3390/app10238481 · Cited by 33
İLERİ-GERİ TAKİP ALGORİTMASI TABANLI SEYREK AŞIRI ÖĞRENME MAKİNESİ
ALÇİN, Ö. F., ŞENGÜR, A., & İNCE, M. C. (2015) · Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi · doi:10.17341/gummfd.91022 · Cited by 2
Metadata
- Authors
- Tropp, J. A., & Wright, S. J.
- Venue
- Proceedings of the IEEE
- Published
- 2010-06
- Volume
- 98
- Issue
- 6
- Pages
- 948-958
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2118297240
- Cited by
- 1,046
- References
- 81
- FWCI
- 90.32
- 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.