On the strong uniqueness of highly sparse representations from redundant dictionaries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3195, Issue , 2004, Pages 201-208

  Gribonval, Rémi ^a   Nielsen, Morten ^b  

^a CAMPUS DE BEAULIEU   (France)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BLIND SOURCE SEPARATION; INDEPENDENT COMPONENT ANALYSIS;

LINEAR PROGRAMMING PROBLEM; NON-ZERO COEFFICIENTS; REDUNDANT DICTIONARIES; SEPARATION METHODS; SPARSE DECOMPOSITION; SPARSE PRIOR; SPARSE REPRESENTATION; SPARSITY MEASURES;

LINEAR PROGRAMMING;

EID: 34247262476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30110-3_26     Document Type: Article

References (18)

1. L. Benaroya, R. Gribonval, and F. Bimbot. Représentations parcimonieuses pour la séparation de sources avec un seul capteur. In GRETSI 2001, Toulouse, France, 2001. Article # 434.
2. D. Bertsekas. Non-Linear Programming. Athena Scientific, Belmont, MA, 2nd edition, 1995.
3. 1 minimization. Proc. Nat. Aca. Sci., 100(5):2197-2202, Mar. 2003.
4. D. Donoho, M. Elad, and V. Temlyakov. Stable recovery of sparse overcomplete representations in the presence of noise. Working draft, Feb. 2004.
5. D. Donoho and X. Huo. Uncertainty principles and ideal atomic decompositions. IEEE Trans. Inform. Theory, 47(7):2845-2862, Nov. 2001.
6. M. Elad and A. Bruckstein. A generalized uncertainty principle and sparse representations in pairs of bases. IEEE Trans. Inform. Theory, 48(9):2558-2567, Sept. 2002.
7. A. Feuer and A. Nemirovsky. On sparse representations in pairs of bases. IEEE Trans. Inform. Theory, 49(6):1579-1581, June 2003.
8. J.-J. Fuchs. On sparse representations in arbitrary redundant bases. Technical report, IRISA, Dec. 2003. to appear in IEEE Trans. Inform. Theory.
9. A. Gilbert, S. Muthukrishnan, and M. Strauss. Approximation of functions over redundant dictionaries using coherence. In The 14th ACM-SIAM Symposium on Discrete Algorithms (SODA'03), Jan. 2003.
10. A. Gilbert, S. Muthukrishnan, M. Strauss, and J. Tropp. Improved sparse approximation over quasi-incoherent dictionaries. In Int. Conf. on Image Proc. (ICIP'03), Barcelona, Spain, Sept. 2003.
11. R. Gribonval and M. Nielsen. Approximation with highly redundant dictionaries. In M. Unser, A. Aldroubi, and A. F. Laine, editors, Proc. SPIE '03, volume 5207 Wavelets: Applications in Signal and Image Processing X, pages pp. 216-227, San Diego, CA, Aug. 2003.
12. R. Gribonval and M. Nielsen. Highly sparse representations from dictionaries are unique and independent of the sparseness measure. Technical Report R-2003-16, Dept of Math. Sciences, Aalborg University, Oct. 2003.
13. R. Gribonval and M. Nielsen. Sparse decompositions in unions of bases. IEEE Trans. Inform. Theory, 49(12):3320-3325, Dec. 2003.
14. R. Gribonval and P. Vandergheynst. Exponential convergence of Matching Pursuit in quasi-incoherent dictionaries. Technical report 1619, IRISA, 2004.
15. A. Shrijver. Theory of Linear and Integer Programming. John Wiley, 1998.
16. J. Tropp. Greed is good : Algorithmic results for sparse approximation. Technical report, Texas Institute for Computational Engineering and Sciences, 2003.
17. J. Tropp. Just relax: Convex programming methods for subset selection and sparse approximation. Technical Report ICES Report 04-04, UT-Austin, Feb. 2004.
18. M. Zibulevsky and B. Pearlmutter. Blind source separation by sparse decomposition in a signal dictionary. Neural Computations, 13(4):863-882, 2001.