A simple test to check the optimality of a sparse signal approximation

Signal Processing

Volumn 86, Issue 3, 2006, Pages 496-510

  Gribonval, R ^a   Figueras I Ventura, R M ^b   Vandergheynst, P ^b  

^a CAMPUS DE BEAULIEU   (France)

^b EPFL   (Switzerland)

Author keywords

Approximation; Basis pursuit; Bayesian estimation; Convex programming; FOCUSS; Greedy algorithm; Identifiability; Inverse problem; Matching pursuit; Overcomplete dictionary; Sparse prior; Sparse representation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INVERSE PROBLEMS; PROBLEM SOLVING;

BAYESIAN ESTIMATION; GREEDY ALGORITHM; IDENTIFIABILITY; SPARSE PRIOR;

SIGNAL PROCESSING;

EID: 30844450612     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2005.05.026     Document Type: Article

References (14)

1. E. Le Pennec, and S. Mallat Sparse geometrical image approximation with bandelets IEEE Trans. Image Process. 14 4 2005 423 438
2. M. Zibulevsky, and B.A. Pearlmutter Blind source separation by sparse decomposition in a signal dictionary Neural Computations 13 4 2001 863 882
3. J.-L. Starck, E.J. Candès, and D.L. Donoho The curvelet transform for image denoising IEEE Trans. Image Process. 2 6 2002 670 684
4. S. Mallat, and Z. Zhang Matching pursuit with time-frequency dictionaries IEEE Trans. Signal Process. 41 12 December 1993 3397 3415
5. Y.C. Pati, R. Rezaiifar, P.S. Krishnaprasad, Orthonormal matching pursuit: recursive function approximation with applications to wavelet decomposition, in: Proceedings of the 27th Annual Asilomar Conference on Signals, Systems and Computers, November 1993.
6. S.S. Chen, D.L. Donoho, and M.A. Saunders Atomic decomposition by basis pursuit SIAM J. Sci. Comput. 20 1 1998 30 61
7. I.F. Gorodnitsky, and B.D. Rao Sparse signal reconstruction from limited data using FOCUSS: a reweighted norm minimization algorithm IEEE Trans. Signal Process. 45 3 March 1997 600 616
8. D. Donoho, M. Elad, V. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Trans. Inform. Theory, to appear.
9. J.A. Tropp, Just relax: Convex programming methods for subset selection and sparse approximation, Technical Report 04-04, Institute for Computational Engineering and Sciences (ICES), The University of Texas at Austin, February 2004.
10. J.-J. Fuchs, Recovery of exact sparse representations in the presence of bounded noise, Technical Report 1618, IRISA, Rennes, France, April 2004, submitted for publication.
11. J.A. Tropp Greed is good: algorithmic results for sparse approximation IEEE Trans. Inform. Theory 50 10 October 2004 2231 2242
12. R. Gribonval, P. Vandergheynst, On the exponential convergence of Matching Pursuit in quasi-incoherent dictionaries, Technical Report 1619, IRISA, Rennes, France, April 2004.
13. B. Wohlberg Noise sensitivity of sparse signal representations: reconstruction error bounds for the inverse problem IEEE Trans. Signal Process. 51 12 December 2003 3053 3060
14. R. Gribonval, M. Nielsen, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Technical Report R-2003-16, Department of Math Sciences, Aalborg University, October 2003.