From sparse solutions of systems of equations to sparse modeling of signals and images

SIAM Review

Volumn 51, Issue 1, 2009, Pages 34-81

  Bruckstein, Alfred M ^a   Donoho, David L ^b   Elad, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Basis pursuit; Compression; Denoising; Dictionary learning; Inverse problems; Linear system of equations; Matching pursuit; Mutual coherence; Overcomplete; Redundant; Sparse coding; Sparse representation; Sparse land; Underdetermined

Indexed keywords

BASIS PURSUIT; COMPRESSION; DENOISING; DICTIONARY LEARNING; LINEAR SYSTEM OF EQUATIONS; MATCHING PURSUIT; MUTUAL COHERENCE; OVERCOMPLETE; REDUNDANT; SPARSE CODING; SPARSE REPRESENTATION; SPARSE-LAND; UNDERDETERMINED;

APPLICATIONS; COHERENT LIGHT; DIFFERENTIAL EQUATIONS; DIGITAL IMAGE STORAGE; FOURIER SERIES; HARMONIC ANALYSIS; IMAGE PROCESSING; IMAGING SYSTEMS; INDEPENDENT COMPONENT ANALYSIS; INDUSTRIAL RESEARCH; LINEAR SYSTEMS; SIGNAL PROCESSING;

INVERSE PROBLEMS;

EID: 59749104367     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/060657704     Document Type: Review

References (164)

1. M. AHARON, M. ELAD, AND A.M. BRUCKSTEIN, K-SVD and its non-negative variant for dictionary design, in Wavelet Applications in Signal and Image Processing XI, Proc. SPIE Conf. 5914, SPIE, Bellingham, WA, 2005, pp. 11.1-11.13.
2. M. AHARON, M. ELAD, AND A.M. BRUCHSTEIN, On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them, J. Linear Algebra Appl., 416 (2006), pp. 48-67.
3. M. AHARON, M. ELAD, AND A.M. BRUCKSTEIN, K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation, IEEE Trans. Signal Process., 54 (2006), pp. 4311-4322.
4. A. BARRON, A. COHEN, W. DAHMEN, AND R.A. DEVORE, Approximation and learning by greedy algorithms, Ann. Statist., 36 (2008), pp. 64-94.
5. J. BIOUCAS-DIAS, Bayesian wavelet-based image deconvolution: A GEM algorithm exploiting a class of heavy-tailed priors, IEEE Trans. Image Process., 15 (2006), pp. 937-951.
6. A. BJÖRNER, M. LAS VERGNAS, B. STURMFELS, N. WHITE, AND G. M. ZIEGLER, Oriented Matroids, Encyclopedia Math. Appl. 46, Cambridge University Press, Cambridge, UK, 1993.
7. J. BOBIN, Y. MOUDDEN, J.-L. STARCH, AND M. ELAD, Morphological diversity and source separation, IEEE Signal Process. Lett., 13 (2006), pp. 409-412.
8. J. BOBIN, J.-L. STARCK, M.J. FADILI, AND Y. MOUDDEN, SZ and CMB reconstruction using generalized morphological component analysis, Statist. Method., to appear.
9. O. BRYT AND M. ELAD, Compression of facial images using the K-SVD algorithm, J.Vrs. Commun. Image Rep., 19 (2008), pp. 270-283.
10. R.W. BUCCIGROSSI AND E.P. SIMONCELLI, Image compression via joint statistical characterization in the wavelet domain, IEEE Trans. Image Process., 8 (1999), pp. 1688-1701.
11. A.R. CALDERBANK AND P.W. SHOR, Good quantum error-correcting codes exist, Phys. Rev. A, 54 (1996), pp. 1098-1105.
12. E.J. CANDES AND D.L. DONOHO, Recovering edges in ill-posed inverse problems: Optimality of curvelet frames, Ann. Statist., 30 (2000), pp. 784-842.
13. 2 singularities, Comm. Pure Appl. Math., 57 (2002), pp. 219-266.
14. E.J. CANDÈS AND J. ROMBERG, Stable signal recovery from incomplete observations, in Wavelet Applications in Signal and Image Processing XI, Proc. SPIE Conf. 5914, SPIE, Bellingham, WA, 2005.
15. E.J. CANDES, J. ROMBERG, AND T. TAO, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509.
16. E. CANDES, J. ROMBERG, AND T. TAO, Quantitative robust uncertainty principles and optimally sparse decompositions, Found. Comput. Math., 6 (2006), pp. 227-254.
17. E. CANDES, J. ROMBERG, AND T. TAO, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math., 59 (2006), pp. 1207-1223.
18. E.J. CANDES AND T. TAO, Decoding by linear programming, IEEE Trans. Inform. Theory, 51 (2005), pp. 4203-4215.
19. S.G. CHANG, B. YU, AND M. VETTERLI, Adaptive wavelet thresholding for image denoising and compression, IEEE Trans. Image Process., 9 (2000), pp. 1532-1546.
20. S.G. CHANG, B. YU, AND M. VETTERLI, Wavelet thresholding for multiple noisy image copies, IEEE Trans. Image Process., 9 (2000), pp. 1631-1635.
21. S.G. CHANG, B. YU, AND M. VETTERLI, Spatially adaptive wavelet thresholding with context modeling for image denoising, IEEE Trans. Image Process., 9 (2000), pp. 1522-1530.
22. V. CHANDRASEKARAN, M. WAKIN, D. BARON, AND R. BARANIUK, Surflets: A sparse representation for multidimensional functions containing smooth discontinuities, in Proceedings of the IEEE Symposium on Information Theory, Chicago, IL, 2004, p. 563.
23. S. CHEN, S.A. BILLINGS, AND W. LUO, Orthogonal least squares methods and their application to non-linear system identification, Internat. J. Control, 50 (1989), pp. 1873-1896.
24. S.S. CHEN, D.L. DONOHO, AND M.A. SAUNDERS, Atomic decomposition by basis pursuit, SIAM J. Sci. Comput., 20 (1998), pp. 33-61.
25. S.S. CHEN, D.L. DONOHO, AND M.A. SAUNDERS, Atomic decomposition by basis pursuit, SIAM Rev., 43 (2001), pp. 129-159.
26. 2) , Amer. J. Math., 121 (1999), pp. 587-628.
27. R. COIFMAN AND D.L. DONOHO, Translation-invariant denoising, in Wavelets and Statistics, Lecture Notes in Statist. 103, Springer-Verlag, New York, 1995, pp. 120-150.
28. R.R. COIFMAN, Y. MEYER, S. QUAKE, AND M.V. WICKERHAUSER, Signal processing and compression with wavelet packets, in Progress in Wavelet Analysis and Applications (Toulouse, 1992), Frontières, 1993, pp. 77-93.
29. R.R. COIFMAN AND M.V. WICKERHAUSER, Adapted waveform analysis as a tool for modeling, feature extraction, and denoising, Optical Engrg., 33 (1994), pp. 2170-2174.
30. C. COUVREUR AND Y. BRESLER, On the optimality of the backward greedy algorithm for the subset selection problem, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 797-808.
31. C. DANIEL AND F.S. WOOD, Fitting Equations to Data: Computer Analysis of Multifactor Data, 2nd ed., John Wiley and Sons, New York, 1980.
32. I. DAUBECHIES, M. DEFRISE, AND C DE-M OL, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Commun. Pure Appl. Math., 57 (2004), pp. 1413-1457.
33. G. DAVIS, S. MALLAT, AND M. AVELLANEDA, Adaptive greedy approximations, J. Constructive Approx., 13 (1997), pp. 57-98.
34. G. DAVIS, S. MALLAT, AND Z. ZHANG, Adaptive time-frequency decompositions, Optical En-grg., 33 (1994), pp. 2183-2191.
35. R.A. DEVORE, B. JAWERTH, AND B.J. LUCIER, Image compression through wavelet transform coding, IEEE Trans. Inform. Theory, 38 (1992), pp. 719-746.
36. R.A. DEVORE AND V. TEMLYAKOV, Some remarks on greedy algorithms, Adv. Comput. Math., 5 (1996), pp. 173-187.
37. M.N. DO AND M. VETTERLI, Rotation invariant texture characterization and retrieval using steerable wavelet-domain hidden Markov models, IEEE Trans. Multimedia, 4 (2002), pp. 517-527.
38. M.N. DO AND M. VETTERLI, The finite ridgelet transform for image representation, IEEE Trans. Image Process., 12 (2003), pp. 16-28.
39. M.N. DO AND M. VETTERLI, Framing pyramids, IEEE Trans. Signal Process., 51 (2003), pp. 2329-2342.
40. M.N. DO AND M. VETTERLI, The contourlet transform: An efficient directional multiresolution image representation, IEEE Trans. Image Process., 14 (2005), pp. 2091-2106.
41. D.C. DOBSON AND F. SANTOSA, Recovery of bloèky images from noisy and blurred data, SIAM J. Appl. Math., 56 (1996), pp. 1181-1198.
42. D.L. DONOHO, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
43. D.L. DONOHO, De-noising by soft thresholding, IEEE Trans. Inform. Theory, 41 (1995), pp. 613-627.
44. 1-norm solution is also the sparsest solution, Commun. Pure Appl. Math., 59 (2006), pp. 797-829.
45. 1-norm near-solution approximates the sparsest near-solution, Commun. Pure Appl. Math., 59 (2006), pp. 907-934.
46. D.L. DONOHO AND M. ELAD, Optimally sparse representation in general (non-orthogonal) dictionaries via L1 minimization, Proc. Natl. Acad. Sci., 100 (2003), pp. 2197-2202.
47. D.L. DONOHO AND M. ELAD, On the stability of the basis pursuit in the presence of noise, Signal Process., 86 (2006), pp. 511-532.
48. D.L. DONOHO, M. ELAD, AND V. TEMLYAKOV, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Trans. Inform. Theory, 52 (2006), pp. 6-18.
49. D.L. DONOHO AND X. HUO, Uncertainty principles and ideal atomic decomposition, IEEE Trans. Inform. Theory, 47 (1999), pp. 2845-2862.
50. D.L. DONOHO AND I.M. JOHNSTONE, Ideal denoising in an orthonormal basis chosen from a library of bases, C. R. Acad. Sci. Paris Sér. I Math., 319 (1994), pp. 1317-1322.
51. D.L. DONOHO AND I.M. JOHNSTONE, Ideal spatial adaptation by wavelet shrinkage, Biometrika, 81 (1994), pp. 425-455.
52. D.L. DONOHO AND I.M. JOHNSTONE, Minimax estimation via wavelet shrinkage, Ann. Statist., 26 (1998), pp. 879-921.
53. D.L. DONOHO, I.M. JOHNSTONE, G. KERKYACHARIAN, AND D. PICARD, Wavelet shrinkage - asymptopia, J. Roy. Statist. Soc. Ser. B, 57 (1995), pp. 301-337.
54. D.L. DONOHO AND P.B. STARCK, Uncertainty principles and signal recovery, SIAM J. Appl. Math., 49 (1989), pp. 906-931.
55. D.L. DONOHO AND V. STODDEN, When does non-negative matrix factorization give a correct decomposition into parts?, in Proceedings of NIPS 2003, Adv. Neural Inform. Process. 16, MIT Press, Cambridge, MA, 2004.
56. D.L. DONOHO AND J. TANNER, Sparse nonnegative solutions of underdetermined linear equations by linear programming, Proc. Natl. Acad. Sci., 102 (2005), pp. 9446-9451.
57. D.L. DONOHO AND J. TANNER, Neighborliness of randomly-projected simplices in high dimensions, Proc. Natl. Acad. Sci., 102 (2005), pp. 9452-9457.
58. D.L. DONOHO AND Y. TSAIG, Extensions of compressed sensing, Signal Process., 86 (2006), pp. 549-571.
59. D.L. DONOHO, Y. TSAIG, I. DRORI, AND J.-L. STARCK, Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit, IEEE Trans. Inform. Theory, submitted.
60. B. EFRON, T. HASTIE, I.M. JOHNSTONE, AND R. TIBSHIRANI, Least angle regression, Ann. Statist., 32 (2004), pp. 407-499.
61. M. ELAD, Sparse representations are most likely to be the sparsest possible, EURASIP J. Appl. Signal Process., 1 (2006), article 96247.
62. M. ELAD, Why simple shrinkage is still relevant for redundant representations?, IEEE Trans. Inform. Theory, 52 (2006), pp. 5559-5569.
63. M. ELAD AND M. AHARON, Image denoising via learned dictionaries and sparse representation, in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, New York, 2006, pp. 895-900.
64. M. ELAD AND M. AHARON, Image denoising via sparse and redundant representations over learned dictionaries, IEEE Trans. Image Process., 15 (2006), pp. 3736-3745.
65. M. ELAD AND A.M. BRUCKSTEIN, A generalized uncertainty principle and sparse representation in pairs of bases, IEEE Trans. Inform. Theory, 48 (2002), pp. 2558-2567.
66. M. ELAD, B. MATALON, AND M. ZIBULEVSKY, Image denoising with shrinkage and redundant representations, in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, New York, 2006, pp. 1924-1931.
67. M. ELAD, B. MATALON, AND M. ZIBULEVSKY, Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization, Appl. Comput. Harmon. Anal., 23 (2007), pp. 346-367.
68. M. ELAD, J.-L. STARCK, P. QUERRE, AND D.L. DONOHO, Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA), Appl. Comput. Harmon. Anal., 19 (2005), pp. 340-358.
69. K. ENCAN, S.O. AASE, AND J.H. HUSOY, Multi-frame compression: Theory and design, Signal Process., 80 (2000), pp. 2121-2140.
70. R. ESLAMI AND H. RADHA, The contourlet transform for image de-noising using cycle spinning, in Proceedings of Asilomar Conference on Signals, Systems, and Computers, 2003, pp. 1982-1986.
71. R. ESLAMI AND H. RADHA, Translation-invariant contourlet transform and its application to image denoising, IEEE Trans. Image Process., 15 (2006), pp. 3362-3374.
72. M.J. FADILI AND J.-L. STARCK, Sparse representation-based image deconvolution by iterative thresholding, Astronomical Data Analysis ADA'06, Marseilles, France, 2006.
73. A. FEUER AND A. NEMIROVSKY, On sparse representation in pairs of bases, IEEE Trans. Inform. Theory, 49 (2002), pp. 1579-1581.
74. M.A. FIGUEIREDO, J.M. BIOUCAS-DIAS, AND R.D. NOWAK, Majorization-minimization algorithms for wavelet-based image restoration, IEEE Trans. Image Process., 16 (2007), pp. 2980-2991.
75. M.A. FIGUEIREDO AND R.D. NOWAK, A bound optimization approach to wavelet-based image deconvolution, in Proceedings of the IEEE International Conference on Image Processing (ICIP 2005), Genoa, Italy, 2005, pp. 782-785.
76. M.A. FIGUEIREDO AND R.D. NOWAK, An EM algorithm for wavelet-based image restoration, IEEE Trans. Image Process., 12 (2003), pp. 906-916.
77. A.K. FLETCHER, S. RANGAN, V.K. GOYAL, AND K. RAMCHANDRAN, Analysis of denoising by sparse approximation with random frame asymptotics, in Proceedings of the IEEE International Symposium on Information Theory, 2005, pp. 1706-1710.
78. A.K. FLETCHER, S. RANGAN, V.K. GOYAL, AND K. RAMCHANDRAN, Denoising by sparse approximation: Error bounds based on rate-distortion theory, EURASIP J. Appl. Signal Process., 1 (2006), article 26318.
79. J.J. FUCHS, On sparse representations in arbitrary redundant bases, IEEE Trans. Inform. Theory, 50 (2004), pp. 1341-1344.
80. J.J. FUCHS, Recovery of exact sparse representations in the presence of bounded noise, IEEE Trans. Inform. Theory, 51 (2005), pp. 3601-3608.
81. A. GERSHO AND R.M. GRAY, Vector Quantization and Signal Compression, Kluwer Academic, Dordrecht, The Netherlands, 1992.
82. A.C. GILBERT, S. MUTHUKRISHNAN, AND M.J. STRAUSS, Approximation of functions over redundant dictionaries using coherence, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2003, pp. 243-252.
83. G.H. GOLUB AND C.F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
84. I.F. GORODNITSKY AND B.D. RAO, Sparse signal reconstruction from limited data using FOCUSS: A re-weighted norm minimization algorithm, IEEE Trans. Signal Process., 45 (1997), pp. 600-616.
85. R. GRIBONVAL, R. FIGUERAS, AND P. V ANDERGHEYNST, A simple test to check the optimality of a sparse signal approximation, Signal Process., 86 (2006), pp. 496-510.
86. R. GRIBONVAL AND M. NIELSEN, Sparse decompositions in unions of bases, IEEE Trans. Inform. Theory, 49 (2003), pp. 3320-3325.
87. R. GRIBONVAL AND P. VANDERGHEYNST, On the exponential convergence of matching pursuits in quasi-incoherent dictionaries, IEEE Trans. Inform. Theory, 52 (2006), pp. 255-261.
88. O. G. GULERYUZ, Nonlinear approximation based image recovery using adaptive sparse reconstructions and iterated denoising-Part I: Theory, IEEE Trans. Image Process., 15 (2006), pp. 539-554.
89. O. G. GULERYUZ, Nonlinear approximation based image recovery using adaptive sparse reconstructions and iterated denoising-Part II: Adaptive algorithms, IEEE Trans. Image Process., 15 (2006), pp. 555-571.
90. T. HASTIE, R. TIBSHIRANI, AND J.H. FRIEDMAN, Elements of Statistical Learning, Springer-Verlag, New York, 2001.
91. R.A. HORN AND C.R. JOHNSON, Matrix Analysis, Cambridge University Press, New York, 1985.
92. P.O. HOYER, Non-negative matrix factorization with sparseness constraints, J. Machine Learning Res., 5 (2004), pp. 1457-1469.
93. X. HUO, Sparse Image representation via Combined Transforms, Ph.D. thesis, Stanford, 1999.
94. A. HYVÄRINEN, J. KARHUNEN, AND E. OJA, Independent Component Analysis, Wiley Interscience, New York, 2001.
95. A.K. JAIN, Fundamentals of Digital Image Processing, Prentice-Hall, Englewood Cliffs, NJ, 1989.
96. M. JANSEN, Noise Reduction by Wavelet Thresholding, Springer-Verlag, New York, 2001.
97. ∞, norms, J. Approx. Theory, 3 (1970), pp. 123-127.
98. B. KASHIN, The widths of certain finite-dimensional sets and classes of smooth functions, Izv. Akad. Nauk SSSR Ser. Mat., 41 (1977), pp. 334-351.
99. E. KIDRON, Y.Y. SCHECHNER, AND M. ELAD, Cross-modality localization via sparsity, IEEE Trans. Signal Process., 55 (2007), pp. 1390-1404.
100. S.-J. KIM, K. KOH, M. LUSTIG, S. BOYD, AND D. GORINEVSKY, A method for large-scale tl-regularized least squares problems with applications in signal processing and statistics, IEEE J. Sel. Topics Signal Proc., 1 (2007), pp. 606-617.
101. K. KREUTZ-DELGADO, J.F. MURRAY, B.D. RAO, K. ENGAN, T.-W., LEE, AND T.J. SEJNOWSKI, Dictionary learning algorithms for sparse representation, Neural Comput., 15 (2003), pp. 349-396.
102. J.B. KRUSKAL, Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics, Linear Algebra Appl., 18 (1977), pp. 95-138.
103. M. LANG, H. GUO, AND J.E. ODEGARD, Noise reduction using undecimated discrete wavelet transform, IEEE Signal Process. Lett., 3 (1996), pp. 10-12.
104. D. LEE AND H. SEUNG, Learning the parts of objects by non-negative matrix factorization, Nature, 401 (1999), pp. 788-791.
105. E. LE PENNEC AND S. MALLAT, Sparse geometric image representation with bandelets, IEEE Trans. Image Process., 14 (2005), pp. 423-438.
106. S. LESAGE, R. GRIBONVAL, F. BIMBOT, AND L. BENAROYA, Learning unions of orthonormal bases with thresholded singular value decomposition, in Proceedings of the IEEE Confer-ence on Acoustics, Speech and Signal Processing (ICASSP 2005), 2005, pp. 293-296.
107. M.S. LEWICKI AND B.A. OLSHAUSEN, A probabilistic framework for the adaptation and comparison of image codes, J. Opt. Soc. Amer. A, 16 (1999), pp. 1587-1601.
108. M.S. LEWICKI AND T.J. SEJNOWSKI, Learning overcomplete representations, Neural Comput., 12 (2000), pp. 337-365.
109. Y. LI, A. CICHOCKI, AND S.-I. AMARI, Analysis of sparse representation and blind source separation, Neural Comput., 16 (2004), pp. 1193-1234.
110. X. LIU AND N.D. SIDIROPOULOS, Cramer-Rao lower bounds for low-rank decomposition of multidimensional arrays, IEEE Trans. Signal Process., 49 (2001), pp. 2074-2086.
111. M. LUSTIG, D.L. DONOHO, AND J.M. PAULY, Sparse MRI: The application of compressed sensing for rapid MR imaging, Magnetic Resonance in Medicine, 58 (2007), pp. 1182-1195.
112. M. LUSTIG, J.M. SANTOS, D.L. DONOHO, AND J.M. PAULY, k-t SPARSE: High frame rate dynamic MRI exploiting spatio-temporal sparsity, in Proceedings of the 13th Annual Meeting of ISMRM, Seattle, 2006.
113. J. MAIRAL, M. ELAD, AND G. SAPIRO, Sparse representation for color image restoration, IEEE Trans. Image Process., 17 (2008), pp. 53-69.
114. D.M. MALIOUTOV, M. CETIN, AND A.S. WILLSKY, Optimal sparse representations in general overcomplete bases, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Montreal, Canada, 2004, pp. 793-796.
115. D.M. MALIOUTOV, M. CETIN, AND A.S. WILLSKY, Sparse signal reconstruction perspective for source localization with sensor arrays, IEEE Trans. Signal Process., 53 (2005), pp. 3010-3022.
116. S. MALLAT, A Wavelet Tour of Signal Processing, Academic Press, San Diego, CA, 1998.
117. S. MALLAT AND E. LE PENNEC, Bandelet image approximation and compression, Multiscale Model. Simul., 4 (2005), pp. 992-1039.
118. S. MALLAT AND Z. ZHANG, Matching pursuits with time-frequency dictionaries, IEEE Trans. Signal Process., 41 (1993), pp. 3397-3415.
119. S. MENDELSON, A. PAJOR, AND N. TOMCZAK- JAEGERMANN, Reconstruction and sub Gaussian processes, C. R. Math. Acad. Sci. Paris, 340 (2005), pp. 885-888.
120. S. MENDELSON, A. PAJOR, AND N. TOMCZAK- JAEGERMANN, Uniform uncertainty principle for Bernoulli and sub Gaussian ensembles, Constructive Approx., to appear.
121. F.G. MEYER, A. AVERBUCH, AND J.O. STROMBER.G, Fast adaptive wavelet packet image compression, IEEE Trans. Image Process., 9 (2000), pp. 792-800.
122. F.G. MEYER, A.Z. AVERBUCH, AND R.R. COIFMAN, Multilayered image representation: Application to image compression, IEEE Trans. Image Process., 11 (2002), pp. 1072-1080.
123. F. G. MEYER AND R.R. COIFMAN, Brushlets: A tool for directional image analysis and image compression, Appl. Comput. Harmon. Anal., 4 (1997), pp. 147-187.
124. P. MOULIN AND J. LIU, Analysis of multiresolution image denoising schemes using generalized Gaussian and complexity priors, IEEE Trans. Inform. Theory, 45 (1999), pp. 909-919.
125. B.K. NATARAJAN, Sparse approximate solutions to linear systems, SIAM J. Comput., 24 (1995), pp. 227-234.
126. B.A. OLSHAUSEN AND B.J. FIELD, Emergence of simple-cell receptive field properties by learning a sparse code for natural images, Nature, 381 (1997), pp. 607-609.
127. B.A. OLSHAUSEN AND B.J. FIELD, Sparse coding with an overcomplete basis set: A strategy employed by V1?, Vision Res., 37 (1997), pp. 3311-3325.
128. B.A. OLSHAUSEN AND D.J. FIELD, Natural image statistics and efficient coding, Network - Computation in Neural Systems, 7 (1996), pp. 333-339.
129. M.R. OSBORNE, B. PRESNELL, AND B.A. TURLACH, A new approach to variable selection in least squares problems, IMA J. Numer. Anal., 20 (2000), pp. 389-403.
130. Y.C. PATI, R. REZAIIFAR, AND P.S. K RISHNAPRASAD, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, in Proceedings of the 27th Asilomar Conference on Signals, Systems and Computers, Vol. 1, 1993, pp. 40-44.
131. W.W. PETERSON AND E.J. WELDON, JR., Error-Correcting Codes, 2nd ed., MIT Press, Cambridge, MA, 1972.
132. G. PISIER, The Volume of Convex Bodies and Banach Space Geometry, Cambridge University Press, Cambridge, UK, 1989.
133. M.D. PLUMBLEY, Geometry and homotopy for L1 sparse representations, in Proceedings of the Workshop on Signal Processing with Adaptive Sparse Structured Representations (SPARS'05), Rennes, France, 2005.
134. M.D. PLUMBLEY, Polar Polytopes and Recovery of Sparse Representations, preprint, 2005; available online from http://arxiv.org/abs/ cs/0510032v1.
135. M.D. PLUMBLEY, Recovery of sparse representations by polytope faces pursuit, in Proceedings of the 6th International Conference on Independent Component Analysis and Blind Source Separation (ICA 2006), Charleston, SC, Lecture Notes in Comput. Sci. 3889, Springer-Verlag, Berlin, 2006, pp. 206-213.
136. J. PORTILLA, V. STRELA, M.J. WAINWRIGHT, AND E.P. SIMONCELLI, Image denoising using scale mixtures of Gaussians in the wavelet domain, IEEE Trans. Image Process., 12 (2003), pp. 1338-1351.
137. M. PROTTER AND M. ELAD, Image sequence denoising via sparse and redundant representations, IEEE Trans. Image Process., to appear.
138. B.D. RAO, K. ENGAN, S.F. COTTER, J. PALMER, AND K. KREUTZ-DELGADO, Subset selection in noise based on diversity measure minimization, IEEE Trans. Signal Process., 51 (2003), pp. 760-770.
139. B.D. RAO AND K. KREUTZ-DELGADO, An affine scaling methodology for best basis selection, IEEE Trans. Signal Process., 47 (1999), pp. 187-200.
140. M. RUDELSON AND R. VERSHYNIN, Geometric Approach to Error-Correcting Codes and Reconstruction of Signals, Technical Report, Department of Mathematics, University of California, Davis, CA, 2005.
141. L. RUDIN, S. OSHER., AND E. FATEMI, Nonlinear total variation based noise removal algorithms, Phys. D, 60 (1992), pp. 259-268.
142. F. SANTOSA AND W.W. SYMES, Linear inversion of band-limited reflection seismograms, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 1307-1330.
143. S. SARDY, A.G. BRUCE, AND P. TSENG, Block coordinate relaxation methods for nonparametric signal denoising with wavelet dictionaries, J. Comput. Graphical Statist., 9 (2000), pp. 361-379.
144. E.P. SIMONCELLI AND E.H. ADELSON, Noise removal via Bayesian wavelet coring, in Proceedings of the International Conference on Image Processing, Lausanne, Switzerland, 1996, pp. 379-382.
145. E.P. SIMONCELLI, W.T. FREEMAN, E.H. ADELSON, AND D.J. HEEGER, Shiftable multi-scale transforms, IEEE Trans. Inform. Theory, 38 (1992), pp. 587-607.
146. J.-L. STARCK, E.J. CANDES, AND D.L. DONOHO, The curvelet transform for image denoising, IEEE Trans. Image Process., 11 (2002), pp. 670-684.
147. J.-L. STARCK, M. ELAD, AND D.L. DONOHO, Image decomposition via the combination of sparse representations and a variational approach, IEEE Trans. Image Process., 14 (2005), pp. 1570-1582.
148. J.-L. STARCK, M. ELAD, AND D.L. DONOHO, Redundant multiscale transforms and their application for morphological component separation, Adv. Imaging Electron Phys., 132 (2004), pp. 287-348.
149. J.-L. STARCK, M.J. FADILI, AND F. MURTAGH, The undecimated wavelet decomposition and its reconstruction, IEEE Trans. Image Process., 16 (2007), pp. 297-309.
150. T. STROHMER AND R. W. HEATH, Grassmannian frames with applications to coding and communication, Appl. Comput. Harmon. Anal., 14 (2004), pp. 257-275.
151. S. SZAREK, Condition number of random matrices, J. Complexity, 7 (1991), pp. 131-149.
152. ∞ and random matrices, Amer. J. Math., 112 (1990), pp. 899-942.
153. D.S. TAUBMAN AND M.W. MARCELLIN, JPEG 2000: Image Compression Fundamentals, Standards and Practice, Kluwer Academic, Norwell, MA, 2001.
154. V.N. TEMLYAKOV, Greedy algorithms and m-term approximation, J. Approx. Theory, 98 (1999), pp. 117-145.
155. V.N. TEMLYAKOV, Weak greedy algorithms, Adv. Comput. Math., 5 (2000), pp. 173-187.
156. J.A. TROPP, Greed is good: Algorithmic results for sparse approximation, IEEE Trans. Inform. Theory, 50 (2004), pp. 2231-2242.
157. J.A. TROPP, Just relax: Convex programming methods for subset selection and sparse approximation, IEEE Trans. Inform. Theory, 52 (2006), pp. 1030-1051.
158. J.A. TROPP AND A.A. GILBERT, Signal recovery from random measurements via orthogonal matching pursuit, IEEE Trans. Inform. Theory. 53 (2007), pp. 4655-4666.
159. J. A. TROPP, A.C. GILBERT, S. MUTHUKRISHNAN, AND M.J. STRAUSS, Improved sparse ap-proximation over quasi-incoherent dictionaries, in Proceedings of the IEEE International Conference on Image Processing, Barcelona, 2003, pp. 37-40.
160. Y. TSAIG, Sparse Solution of Underdetermined Linear Systems: Algorithms and Applications, Ph.D. thesis, Stanford, CA, 2007.
161. 1-norm solution and the sparsest solution, Signal Process., 86 (2006), pp. 533-548.
162. H. WINTNEY, On the abstract properties of linear dependence, Amer. J. Math., 57 (1935), pp. 509-533.
163. B. WOHLBERG, Noise sensitivity of sparse signal representations: Reconstruction error bounds for the inverse problem, IEEE Trans. Signal Process., 51 (2003), pp. 3053-3060.
164. M. ZIBULEVSKY AND B.A. PEARLMUTTER, Blind source separation by sparse decomposition in a signal dictionary, Neural Comput., 13 (2001), pp. 863-882.