Greed is good: Algorithmic results for sparse approximation (2004)

by Joel A. Tropp
Venue:IEEE Trans. Inform. Theory
Citations:576 - 6 self

Documents Related by Co-Citation

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
1799 ATOMIC DECOMPOSITION BY BASIS PURSUIT – Scott Shaobing Chen , David L. Donoho , Michael A. Saunders - 1995
1416 Robust Uncertainty Principles: Exact Signal Reconstruction From Highly Incomplete Frequency Information – Emmanuel J. Candès, Justin Romberg, Terence Tao - 2006
225 Sparse representations in unions of bases – R Gribonval, M Nielsen - 2003
891 Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? – Emmanuel J. Candès , Terence Tao - 2004
365 For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1-norm Solution is also the Sparsest Solution – David L. Donoho - 2004
183 A generalized uncertainty principle and sparse representation in pairs of bases – Michael Elad, Alfred M. Bruckstein - 2002
382 Uncertainty principles and ideal atomic decomposition – David L. Donoho, Xiaoming Huo - 2001
171 On sparse representations in arbitrary redundant bases – Jean-jacques Fuchs - 2004