|
90
|
Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions
– Emmanuel J. Candès, Justin Romberg
- 2004
|
|
|
Compressive sensing: a paradigm shift in signal processing
– Olga V. Holtz
- 812
|
|
95
|
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
– Alfred M. Bruckstein, David L. Donoho, Michael Elad
- 2007
|
|
|
An Efficient Algorithm for . . . Pixel Camera and Compressive Sensing
– Chengbo Li
- 2009
|
|
25
|
Theoretical results on sparse representations of multiple-measurement vectors
– Jie Chen, Xiaoming Huo
- 2006
|
|
185
|
Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise
– Joel A. Tropp
- 2006
|
|
5
|
Compressed mapping of communication signal strength
– Yasamin Mostofi, Pradeep Sen
- 2008
|
|
71
|
Just relax: Convex programming methods for subset selection and sparse approximation
– Joel A. Tropp
- 2004
|
|
1
|
Blind Source Separation: the Sparsity Revolution
– J. Bobin , J.-L. Starck , Y. Moudden , M. J. Fadili
- 2008
|
|
3
|
Morphological Diversity and Sparsity for Multichannel Data Restoration
– J. Bobin, Y. Moudden, J. Fadili, J.-L. Starck
- 2008
|
|
61
|
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
– Mark Rudelson
- 2006
|
|
1
|
Theoretical Results and Applications Related to Dimension Reduction
– Jie Chen
- 2007
|
|
4
|
Compressive Sensing
– Massimo Fornasier, Holger Rauhut
- 2010
|
|
917
|
Compressed sensing
– David L. Donoho
|
|
4
|
Theoretical results about finding the sparsest representations of multiple measurement vectors (MMV) in an overcomplete dictionary using ℓ1 minimization and greedy algorithms
– Jie Chen, Xiaoming Huo
- 2004
|
|
63
|
Geometric approach to error correcting codes and reconstruction of signals
– Mark Rudelson, Roman Vershynin
- 2005
|
|
7
|
When do stepwise algorithms meet subset selection criteria
– Xiaoming Huo, Xuelei (sherry Ni
- 2005
|
|
51
|
On sparse reconstruction from Fourier and Gaussian measurements
– Mark Rudelson, Roman Vershynin
- 2006
|
|
7
|
Sparse Representations are Most Likely to be the Sparsest Possible
– Michael Elad
- 2004
|
