Highly sparse representations from dictionaries are unique and independent of the sparseness measure

Applied and Computational Harmonic Analysis

Volumn 22, Issue 3, 2007, Pages 335-355

  Gribonval, R ^a   Nielsen, M ^b  

^a CAMPUS DE BEAULIEU   (France)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

Incoherent dictionary; Linear programming; Localized frame; Nonconvex optimization; Redundant dictionary; Sparse representation; Sparseness measure

Indexed keywords

LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SIGNAL ANALYSIS;

INCOHERENT DICTIONARY; LOCALIZED FRAME; NONCONVEX OPTIMIZATION; REDUNDANT DICTIONARY; SPARSE REPRESENTATION; SPARSENESS MEASURE;

GLOSSARIES;

EID: 34047182148     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2006.09.003     Document Type: Article

References (46)

1. Bennett C., and Sharpley R. Interpolation of Operators (1988), Academic Press, Boston, MA
2. Bergh J., and Löfström J. Interpolation Spaces, an Introduction. Comprehensive Studies in Mathematics vol. 223 (1976), Springer-Verlag, Berlin
3. Bertsekas D. Non-Linear Programming. second ed. (1995), Athena Scientific, Belmont, MA
4. 4-Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets. Proc. London Math. Soc. (3) 75 2 (1997) 436-480
5. Chui C.K., He W., and Stöckler J. Compactly supported tight and sibling frames with maximum vanishing moments. Appl. Comput. Harmon. Anal. 13 3 (2002) 224-262
6. Daubechies I. Ten Lectures on Wavelets (1992), SIAM, Philadelphia, PA
7. Daubechies I., Han B., Ron A., and Shen Z. Framelets: MRA-based constructions of wavelet frames. Appl. Comput. Harmon. Anal. 14 1 (2003) 1-46
8. L. Daudet, Représentations structurelles de signaux audiophoniques : Méthodes hybrides pour des applications à la compression, Ph.D. thesis, Université de Provence, Aix-Marseille I, 2000
9. Daudet L., and Torrésani B. Hybrid representations for audiophonic signal encoding. Signal Process. (Special Issue on Image and Video Coding Beyond Standards) 82 11 (2002) 1595-1617
10. DeVore R.A., Jawerth B., and Popov V. Compression of wavelet decompositions. Amer. J. Math. 114 4 (1992) 737-785
11. DeVore R.A., and Lorentz G.G. Constructive Approximation (1993), Springer-Verlag, Berlin
12. D. Donoho, E.J. Candès, Curvelets: A surprisingly effective nonadaptive representation of objects with edges, Technical report, Stanford University, 1999
13. 1 minimization. Proc. Natl. Acad. Sci. 100 5 (2003) 2197-2202
14. Donoho D., and Huo X. Uncertainty principles and ideal atomic decompositions. IEEE Trans. Inform. Theory 47 7 (2001) 2845-2862
15. Elad M., and Bruckstein A. A generalized uncertainty principle and sparse representations in pairs of bases. IEEE Trans. Inform. Theory 48 9 (2002) 2558-2567
16. Feichtinger H., and Zimmermann G. An exotic minimal Banach space of functions. Math. Nachr. 239-240 (2002) 42-61
17. Feuer A., and Nemirovsky A. On sparse representations in pairs of bases. IEEE Trans. Inform. Theory 49 6 (2003) 1579-1581
18. Field D., and Olshausen B. Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature 381 (1996) 607-609
19. Fuchs J.-J. Une approche à l'estimation et l'identification simultanées. Actes du seizième colloque GRETSI vol. 2 (1997), Association GRETSI, Grenoble 1273-1276
20. J.-J. Fuchs, Detection and estimation of superimposed signals, in: Proc. Int. Conf. Acoust. Speech Signal Process. (ICASSP'98), vol. III, Seattle, 1998, pp. 1649-1652
21. Fuchs J.-J. On sparse representations in arbitrary redundant bases. IEEE Trans. Inform. Theory 50 6 (2004) 1341-1344
22. A. Gilbert, S. Muthukrishnan, M. Strauss, Approximation of functions over redundant dictionaries using coherence, in: 14th ACM-SIAM Symposium on Discrete Algorithms (SODA'03), Baltimore, MD, 2003, pp. 243-252
23. A. Gilbert, S. Muthukrishnan, M. Strauss, J. Tropp, Improved sparse approximation over quasi-incoherent dictionaries, in: Int. Conf. on Image Proc. (ICIP'03), Barcelona, Catalonia, 2003, pp. 37-40
24. R. Gribonval, Sparse decomposition of stereo signals with matching pursuit and application to blind separation of more than two sources from a stereo mixture, in: Proc. Int. Conf. Acoust. Speech Signal Process. (ICASSP'02), Orlando, FL, 2002
25. Gribonval R., Figueras i Ventura R.M., and Vandergheynst P. A simple test to check the optimality of sparse signal approximations. EURASIP Signal Process. (Special Issue on Sparse Approximations in Signal and Image Processing) 86 3 (2006) 496-510
26. R. Gribonval, M. Nielsen, Approximation with highly redundant dictionaries, in: M. Unser, A. Aldroubi, A.F. Laine (Eds.), Wavelets: Applications in Signal and Image Processing X, Proc. SPIE'03, vol. 5207, SPIE, San Diego, CA, 2003, pp. 216-227
27. Gribonval R., and Nielsen M. Sparse decompositions in unions of bases. IEEE Trans. Inform. Theory 49 12 (2003) 3320-3325
28. Gribonval R., and Nielsen M. Nonlinear approximation with dictionaries. I. Direct estimates. J. Fourier Anal. Appl. 10 1 (2004) 51-71
29. Gribonval R., and Vandergheynst P. On the exponential convergence of Matching Pursuits in quasi-incoherent dictionaries. IEEE Trans. Inform. Theory 52 1 (2006) 255-261
30. Gröchenig K. Foundations of Time-Frequency Analysis. Appl. Numer. Harmon. Anal. (2001), Birkhäuser, Boston, MA
31. Gröchenig K. Localized frames are finite unions of Riesz sequences. Adv. Comput. Math. 18 2-4 (2003) 149-157
32. K. Gröchenig, Localization of frames, Banach frames, and the invertibility of the frame operator, J. Fourier Anal. Appl. 10 (2) (2004), in press
33. Gröchenig K., and Samarah S. Nonlinear approximation with local Fourier bases. Constr. Approx. 16 3 (2000) 317-332
34. Kreutz-Delgado K., Rao B., Engan K., Lee T.-W., and Sejnowski T. Convex/schur-convex (CSC) log-priors and sparse coding. 6th Joint Symposium on Neural Computation (1999), Institute for Neural Computation 65-71
35. Mallat S. A Wavelet Tour of Signal Processing (1998), Academic Press, San Diego, CA
36. Mallat S., and Zhang Z. Matching pursuit with time-frequency dictionaries. IEEE Trans. Signal Process. 41 12 (1993) 3397-3415
37. Okoudjou K.A. Embeddings of some classical Banach spaces into modulation spaces. Proc. Amer. Math. Soc. 132 6 (2004) 1639-1647
38. B.D. Rao, Signal processing with the sparseness constraint, in: Int. Conf. Acoust. Speech Signal Process. (ICASSP'98), Seattle, 1998, pp. 1861-1864
39. d). II. Dual systems. J. Fourier Anal. Appl. 3 5 (1997) 617-637 dedicated to the memory of Richard J. Duffin
40. d): The analysis of the analysis operator. J. Funct. Anal. 148 2 (1997) 408-447
41. Schrijver A. Theory of Linear and Integer Programming (1998), Wiley, Chichester
42. J.-L. Starck, M. Elad, D. Donoho, Image decomposition: Separation of textures from piecewise smooth content, in: M. Unser, A. Aldroubi, A. Laine (Eds.), Wavelet: Applications in Signal and Image Processing X, Proc. SPIE'03, vol. 5207, SPIE, San Diego, CA, 2003
43. Strohmer T., and Heath R. Grassmannian frames with applications to coding and communications. Appl. Comput. Harmon. Anal. 14 3 (2003) 257-275
44. Triebel H. Theory of Function Spaces. Monogr. Math. vol. 78 (1983), Birkhäuser, Basel
45. Tropp J. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50 10 (2004) 2231-2242
46. Zibulevsky M., and Pearlmutter B. Blind source separation by sparse decomposition in a signal dictionary. Neural Comput. 13 4 (2001) 863-882