Sparsest solutions of underdetermined linear systems via -minimization for
Top Cited Papers
- 1 May 2009
- journal article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 26 (3) , 395-407
- https://doi.org/10.1016/j.acha.2008.09.001
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Exact Reconstruction of Sparse Signals via Nonconvex MinimizationIEEE Signal Processing Letters, 2007
- Highly sparse representations from dictionaries are unique and independent of the sparseness measureApplied and Computational Harmonic Analysis, 2007
- Fast implementation of orthogonal greedy algorithm for tight wavelet framesSignal Processing, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Stable recovery of sparse overcomplete representations in the presence of noiseIEEE Transactions on Information Theory, 2005
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimizationProceedings of the National Academy of Sciences, 2003
- Nonlinear Methods of ApproximationFoundations of Computational Mathematics, 2003
- Sparse Approximate Solutions to Linear SystemsSIAM Journal on Computing, 1995