Sparse representations are most likely to be the sparsest possible

Eurasip Journal on Applied Signal Processing

Volumn 2006, Issue , 2006, Pages

  Elad, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBABILISTIC LOGICS; SET THEORY;

MATRIX; SPARK (D); SPARSE REPRESENTATIONS;

SIGNAL PROCESSING;

EID: 33645744108     PISSN: 11108657     EISSN: None     Source Type: Journal    
DOI: 10.1155/ASP/2006/96247     Document Type: Article

References (30)

1. S. S. Chen D. L. Donoho M. A. Saunders Atomic decomposition by basis pursuit. SIAM Review 43 2001 1 129 159
2. B. K. Natarajan Sparse approximate solutions to linear systems. SIAM Journal on Computing 24 1995 2 227 234
3. G. Davis S. G. Mallat M. Avellaneda Adaptive greedy approximations. Constructive Approximations 13 1997 1 57 98
4. S. G. Mallat Z. Zhang Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing 41 1993 12 3397 3415
5. Y. C. Pati R. Rezaiifar P. S. Krishnaprasad Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. Proceedings of 27th Asilomar Conference on Signals, Systems and Computers 1 Pacific Grove, Calif, USA 1993 40 44
6. C. Couvreur Y. Bresler On the optimality of the backward greedy algorithm for the subset selection problem. SIAM Journal on Matrix Analysis and Applications 21 2000 3 797 808
7. A. C. Gilbert S. Muthukrishnan M. J. Strauss Approximation of functions over redundant dictionaries using coherence. Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '03) Baltimore, Md, USA 2003 243 252
8. J. A. Tropp A. C. Gilbert S. Muthukrishnan M. J. Strauss Improved sparse approximation over quasi-incoherent dictionaries. Proceedings of IEEE International Conference on Image Processing (ICIP '03) 1 Barcelona, Spain 2003 37 40
9. J. A. Tropp Greed is good: algorithmic results for sparse approximation. IEEE Transactions on Information Theory 50 2004 10 2231 2242
10. D. L. Donoho M. Elad V. N. Temlyakov Stable recovery of sparse overcomplete representations in the presence of noise. to appear in IEEE Transactions on Information Theory, February 2004
11. J. A. Tropp Just relax: Convex programming methods for subset selection and sparse approximation. ICES Report University of Texas at Austin Austin, Tex, USA 04-04 February 2004
12. V. N. Temlyakov Greedy algorithms and m-term approximation with regard to redundant dictionaries. Journal of Approximation Theory 98 1999 1 117 145
13. V. N. Temlyakov Weak greedy algorithms. Advances in Computational Mathematics 12 2000 2-3 213 227
14. I. F. Gorodnitsky B. D. Rao Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm. IEEE Transactions on Signal Processing 45 1997 3 600 616
15. D. L. Donoho X. Huo Uncertainty principles and ideal atomic decomposition. IEEE Transactions on Information Theory 47 2001 7 2845 2862
16. X. Huo Sparse image representation via combined transforms. Stanford University Stanford, Calif, USA 1999
17. M. Elad A. M. Bruckstein A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Transactions on Information Theory 48 2002 9 2558 2567
18. D. L. Donoho M. Elad Optimally sparse representation in general (non-orthogonal) dictionaries via ℓ1 minimization. Proceedings of the National Academy of Sciences of the United States of America 100 2003 5 2197 2202
19. R. Gribonval M. Nielsen Sparse representations in unions of bases. IEEE Transactions on Information Theory 49 2003 12 3320 3325
20. J.-J. Fuchs On sparse representations in arbitrary redundant bases. IEEE Transactions on Information Theory 50 2004 6 1341 1344
21. E. J. Candès J. Romberg Quantitative robust uncertainty principles and optimally sparse decompositions. to appear in Foundations of Computational Mathematics, 2004
22. D. L. Donoho For most large underdetermined systems of linear equations the minimal ℓ1-norm solution is also the sparsest solution. Department of Statistics, Stanford University Stanford, Calif, USA 2004-10 September 2004
23. A. Edelman Eigenvalues and condition numbers of random matrices. SIAM Journal on Matrix Analysis and Applications 9 1988 4 543 560
24. J. Shen On the singular values of Gaussian random matrices. Linear Algebra and its Applications 326 2001 1-3 1 14
25. T. Strohmer R. W. Heath Jr. Grassmannian frames with applications to coding and communication. Applied and Computational Harmonic Analysis 14 2003 3 257 275
26. J. A. Tropp I. S. Dhillon R. W. Heath Jr. T. Strohmer Designing structured tight frames via an alternating projection method. IEEE Transactions on Information Theory 51 2005 1 188 209
27. E. J. Candès D. L. Donoho New tight frames of curvelets and the problem of approximating piecewise C2 images with piecewise C2 edges. 2002 to appear in Communications on Pure and Applied Mathematics
28. J.-L. Starck E. J. Candès D. L. Donoho The curvelet transform for image denoising. IEEE Transactions on Image Processing 11 2002 6 670 684
29. A. Björner Some matroid inequalities. Discrete Mathematics 31 1980 1 101 103
30. F. Goldberg Overcomplete Bases, Spark, and Matroids. 2004 personal communication