Most cited papers in Sparse and Compressive Sensing Techniques
What are the most cited papers in Sparse and Compressive Sensing Techniques?
The most cited paper in Sparse and Compressive Sensing Techniques is "Compressed sensing" (David L. Donoho, 2006), with 23,533 citations. Next come "Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images" (18,093) and "Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information" (15,931).
Showing 50 of 99 papers. Every paper with more than 1,567 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Compressed sensing David L. Donoho · IEEE Transactions on Information Theory | Apr 2006 | 23,533 |
| 2 | Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images Stuart Geman, Donald Geman · IEEE Transactions on Pattern Analysis and Machine Intelligence | Nov 1984 | 18,093 |
| 3 | Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information Emmanuel J. Candès, Justin K. Romberg, Terence Tao · IEEE Transactions on Information Theory | 25 Jan 2006 | 15,931 |
| 4 | Regularization Paths for Generalized Linear Models via Coordinate Descent. Jerome H. Friedman, Trevor Hastie, Rob Tibshirani · PubMed | 2010 | 14,024 |
| 5 | A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems Amir Beck, Marc Teboulle · SIAM Journal on Imaging Sciences | 2009 | 12,347 |
| 6 | An Introduction To Compressive Sampling Emmanuel J. Candès, Michael B. Wakin · IEEE Signal Processing Magazine | Mar 2008 | 10,167 |
| 7 | Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit Joel A. Tropp, Anna C. Gilbert · IEEE Transactions on Information Theory | Dec 2007 | 9,832 |
| 8 | De-noising by soft-thresholding David L. Donoho · IEEE Transactions on Information Theory | May 1995 | 9,709 |
| 9 | $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation Michal Aharon, Michael Elad, Alfred Marcel Bruckstein · IEEE Transactions on Signal Processing | 18 Oct 2006 | 9,612 |
| 10 | Robust Face Recognition via Sparse Representation John N. Wright, A. Yang, Arvind Ganesh et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence | 14 Jan 2009 | 9,546 |
| 11 | Adaptive Subgradient Methods for Online Learning and Stochastic Optimization John C. Duchi, Elad Hazan, Yoram Singer | 2010 | 8,604 |
| 12 | Ideal spatial adaptation by wavelet shrinkage David L. Donoho, Iain M. Johnstone · Biometrika | Sep 1994 | 7,913 |
| 13 | Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions Jeffrey C. Lagarias, James A. Reeds, Margaret H. Wright et al. · SIAM Journal on Optimization | 1998 | 7,523 |
| 14 | Decoding by Linear Programming Emmanuel J. Candès, Terence Tao · IEEE Transactions on Information Theory | 22 Nov 2005 | 7,371 |
| 15 | Stable signal recovery from incomplete and inaccurate measurements Emmanuel J. Candès, Justin Romberg, Terence Tao · Communications on Pure and Applied Mathematics | Mar 2006 | 7,249 |
| 16 | Stochastic gradient boosting Jerome H. Friedman · Computational Statistics & Data Analysis | Feb 2002 | 7,206 |
| 17 | Sparse MRI: The application of compressed sensing for rapid MR imaging Michael S. Lustig, David L. Donoho, John M. Pauly · Magnetic Resonance in Medicine | 29 Oct 2007 | 7,086 |
| 18 | Atomic Decomposition by Basis Pursuit Scott Shaobing Chen, David L. Donoho, Michael A. Saunders · SIAM Journal on Scientific Computing | 1998 | 7,009 |
| 19 | Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? Emmanuel J. Candès, Terence Tao · IEEE Transactions on Information Theory | Dec 2006 | 6,984 |
| 20 | Robust principal component analysis? Emmanuel J. Candès, Xiaodong Li, Yi Ma et al. · Journal of the ACM | May 2011 | 6,962 |
| 21 | N4ITK: Improved N3 Bias Correction Nicholas J. Tustison, Brian Avants, Philip A. Cook et al. · IEEE Transactions on Medical Imaging | 9 Apr 2010 | 6,579 |
| 22 | Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries Michael Elad, Michal Aharon · IEEE Transactions on Image Processing | 15 Nov 2006 | 5,442 |
| 23 | Image Super-Resolution Via Sparse Representation Jianchao Yang, John N. Wright, Thomas S. Huang et al. · IEEE Transactions on Image Processing | 26 May 2010 | 5,333 |
| 24 | Optimal approximations by piecewise smooth functions and associated variational problems David B. Mumford, Jayant M. Shah · Communications on Pure and Applied Mathematics | Jul 1989 | 5,245 |
| 25 | Exact Matrix Completion via Convex Optimization Emmanuel J. Candès, Benjamin Recht · Foundations of Computational Mathematics | 2 Apr 2009 | 5,176 |
| 26 | An iterative thresholding algorithm for linear inverse problems with a sparsity constraint Ingrid Daubechies, Michel Defrise, Christine De Mol · Communications on Pure and Applied Mathematics | 26 Aug 2004 | 5,044 |
| 27 | Enhancing Sparsity by Reweighted ℓ 1 Minimization Emmanuel J. Candès, Michael B. Wakin, Stephen Boyd · Journal of Fourier Analysis and Applications | 14 Oct 2008 | 5,007 |
| 28 | CoSaMP: Iterative signal recovery from incomplete and inaccurate samples Deanna Needell, Joel A. Tropp · Applied and Computational Harmonic Analysis | 23 Jul 2008 | 4,457 |
| 29 | A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging Antonin Chambolle, Thomas Pock · Journal of Mathematical Imaging and Vision | 20 Dec 2010 | 4,454 |
| 30 | Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition Yagyensh C. Pati, R. Rezaiifar, Perinkulam S. Krishnaprasad | 30 Dec 2002 | 4,414 |
| 31 | Compressive Sensing [Lecture Notes] Richard G. Baraniuk · IEEE Signal Processing Magazine | Jul 2007 | 4,190 |
| 32 | Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions Nathan Halko, Per‐Gunnar Martinsson, Joel A. Tropp · SIAM Review | 2011 | 4,178 |
| 33 | Locality Preserving Projections Xiaofei He, Partha Niyogi | 9 Dec 2003 | 3,953 |
| 34 | The restricted isometry property and its implications for compressed sensing Emmanuel J. Candès · Comptes Rendus Mathématique | 11 Apr 2008 | 3,808 |
| 35 | Distributed Subgradient Methods for Multi-Agent Optimization Angelia Nedić, Asuman Ozdaglar · IEEE Transactions on Automatic Control | 2009 | 3,800 |
| 36 | Semidefinite Relaxation of Quadratic Optimization Problems Zhi-Quan Tom Luo, Wing‐Kin Ma, Anthony Man–Cho So et al. · IEEE Signal Processing Magazine | 23 Apr 2010 | 3,769 |
| 37 | Greed is Good: Algorithmic Results for Sparse Approximation Joel A. Tropp · IEEE Transactions on Information Theory | 28 Sep 2004 | 3,747 |
| 38 | Robust Recovery of Subspace Structures by Low-Rank Representation Guangcan Liu, Zhouchen Lin, Shuicheng Yan et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence | 10 Apr 2012 | 3,718 |
| 39 | Single-pixel imaging via compressive sampling Marco F. Duarte, Mark A. Davenport, Dharmpal Takhar et al. · IEEE Signal Processing Magazine | Mar 2008 | 3,637 |
| 40 | Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems Mário A. T. Figueiredo, Robert D. Nowak, Stephen J. Wright · IEEE Journal of Selected Topics in Signal Processing | Dec 2007 | 3,573 |
| 41 | On Single Image Scale-Up Using Sparse-Representations Roman Zeyde, Michael Elad, Matan Protter · Lecture notes in computer science | 2012 | 3,439 |
| 42 | Sparse Subspace Clustering: Algorithm, Theory, and Applications Ehsan Elhamifar, René Vidal · IEEE Transactions on Pattern Analysis and Machine Intelligence | 17 Sep 2013 | 3,201 |
| 43 | Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization David L. Donoho, Michael Elad · Proceedings of the National Academy of Sciences | 21 Feb 2003 | 2,975 |
| 44 | Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials Philipp Krähenbühl, Vladlen Koltun · arXiv (Cornell University) | 20 Oct 2012 | 2,972 |
| 45 | On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators Jonathan Eckstein, Dimitri P. Bertsekas · Mathematical Programming | Apr 1992 | 2,923 |
| 46 | The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations C. G. Broyden · IMA Journal of Applied Mathematics | 1970 | 2,913 |
| 47 | A unified statistical approach for determining significant signals in images of cerebral activation Keith J. Worsley, Sean Marrett, Peter Neelin et al. · Human Brain Mapping | 1996 | 2,908 |
| 48 | New Support Vector Algorithms Bernhard Schölkopf, Alex J. Smola, Robert C. Williamson et al. · Neural Computation | May 2000 | 2,831 |
| 49 | Signal Recovery by Proximal Forward-Backward Splitting Patrick L. Combettes, Valérie R. Wajs · Multiscale Modeling and Simulation | 2005 | 2,708 |
| 50 | Distance Metric Learning with Application to Clustering with Side-Information Eric P. Xing, Michael I. Jordan, Stuart Russell et al. | 2002 | 2,702 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.