Approximation with highly redundant dictionaries

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5207, Issue 1, 2003, Pages 216-227

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

^a CAMPUS DE BEAULIEU   (France)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

Basis Pursuit; Coherence; Dictionary; Linear programming; Matching Pursuit; Nonlinear approximation; Quadratic programming; Spark; Sparse decomposition; Spread

Indexed keywords

APPROXIMATION THEORY; DECOMPOSITION; LINEAR PROGRAMMING; QUADRATIC PROGRAMMING; VECTORS;

MATCHING PURSUIT; NONLINEAR APPROXIMATION; SPARK; SPARSE DECOMPOSITION; SPREAD;

SIGNAL PROCESSING;

EID: 1242308394     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.504776     Document Type: Conference Paper

References (41)

1. B.D. Rao, "Signal processing with the sparseness constraint," in International Conference on Acoustics, Speech, and Signal Processing (ICASSP'98), pp. 1861-1864, (Seattle), may 1998.
2. S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionaries," IEEE Trans. Signal Process. 41, pp. 3397-3415, Dec. 1993.
3. S. B. Stechkin, "On absolute convergence of orthogonal series, " Dok. Akad. Nauk SSSR 102, pp. 37-40, 1955.
4. R. A. DeVore and V. N. Temlyakov, "Some remarks on greedy algorithms," Adv. Comput. Math. 5(2-3), pp. 173-187, 1996.
5. R. Gribonval and M. Nielsen, "Nonlinear approximation with dictionaries. I. Direct estimates.," J. Fourier Anal. and Appl., 2003. to appear.
6. K. Kreutz-Delgado, B. Rao, K. Engan, T.-W. Lee, and T. Sejnowski, "Convex/schur-convex (esc) log-priors and sparse coding," in 6th Joint Symposium on Neural Computation, pp. 65-71, (Institute for Neural Computation), May 1999.
7. 1 minimization," Proc. Nat. Aca. Sci. 100, pp. 2197-2202, Mar. 2003.
8. R. Gribonval and M. Nielsen, "Sparse decompositions in unions of bases," Tech. Rep. 1499, IRISA, Nov. 2002. submitted to IEEE Trans. Inf. Th.
9. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations," Constr. Approx. 13(1), pp. 57-98, 1997.
10. S. Chen, D. Donoho, and M. Saunders, "Atomic decomposition by basis pursuit," SIAM Journal on Scientific Computing 20, pp. 33-61, Jan. 1999.
11. th Annual Asilomar Conf. on Signals, Systems and Computers, Nov. 1993.
12. D. Donoho and X. Huo, "Uncertainty principles and ideal atomic decompositions," IEEE Trans. Inform. Theory 47, pp. 2845-2862, Nov. 2001.
13. M. Elad and A. Bruckstein, "A generalized uncertainty principle and sparse representations in pairs of bases," IEEE Trans. Inform. Theory 48, pp. 2558-2567, Sept. 2002.
14. A. Feuer and A. Nemirovsky, "On sparse representations in pairs of bases," IEEE Trans. Inform. Theory, Nov. 2002. accepted.
15. J.-J. Fuchs, "On sparse representations in arbitrary redundant bases," tech. rep., IRISA, Dec. 2002. submitted to IEEE Trans. Inf. Th.
16. 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.
17. J. Tropp, "Greed is good: Algorithmic results for sparse approximation," tech. rep., Texas Institute for Computational Engineering and Sciences, 2003. In preparation.
18. R. Gribonval and P. Vandergheynst, "Exponential convergence of Matching Pursuit in quasi-incoherent dictionaries," tech. rep., IRISA, 2003. in preparation.
19. 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), sep 2003.
20. R. Gribonval and M. Nielsen, "Some remarks on nonlinear approximation with Schauder bases," East J. Approx. 7(3), pp. 267-285, 2001.
21. S. Konyagin and V. Temlyakov, "A remark on greedy approximation in Banach spaces," East J. Approx. 5(3), pp. 365-379, 1999.
22. R. A. DeVore, "Nonlinear approximation," in Acta numerica, 1998, pp. 51-150, Cambridge Univ. Press, Cambridge, 1998.
23. R. Gribonval and M. Nielsen, "On approximation with spline generated framelets," Constr. Approx., 2003. to appear.
24. R. Gribonval and M. Nielsen, "On the quasi-greedy property and uniformly bounded orthonormal systems," Tech. Rep. R-2003-09, Aalborg Univ., Dept of Math., Department of Mathematical Sciences, Aalborg University, Fredrik Bajers Vej 7G, 9220 Aalborg East, Denmark, 2003. submitted to J. Approx. Th.
25. Z. S. Wang, J. Y. Cheung, Y. S. Xia, and J. D. Z. Chen, "Minimum fuel neural networks and their application to overcomplete signal representations," IEEE Trans. Circuits and Systems-I: Fundamental Theory and Applications 47, pp. 1146-1159, aug 2000.
26. S. Sardy, A. Bruce, and P. Tseng, "Block coordinate relaxation methods for nonparametric wavelet denoising," Journal of Computational and Graphical Statistics 9(2), 2000.
27. J. Friedman and W. Stuetzle, "Projection pursuit regression," J. Amer. Stat. Assoc. 76, pp. 817-823, 1981.
28. P. Huber, "Projection pursuit," The Annals of Statistics 13(2), pp. 435-475, 1985.
29. V. Temlyakov, "Weak greedy algorithms," Advances in Computational Mathematics 12(2,3), pp. 213-227, 2000.
30. L. Jones, "On a conjecture of Huber concerning the convergence of PP-regression," The Annals of Statistics 15, pp. 880-882, 1987.
31. E. Livschitz and V. Temlyakov, "Two lower estimates in greedy approximation," Constr. Approx. 19, 2003.
32. L. Villemoes, "Nonlinear approximation with walsh atoms," in Proceedings of "Surface Fitting and Multiresolution Methods", Chamonix 1996, A. Le M'ehaut'e, C. Rabut, and L. Schumaker, eds., pp. 329-336, Vanderbilt University Press, 1997.
33. R. Gribonval and M. Nielsen, "Nonlinear approximation with dictionaries. II. Inverse estimates," Tech. Rep. R-02-2019, Aalborg Univ., Dept of Math., Department of Mathematical Sciences, Aalborg University, Fredrik Bajers Vej 7G, 9220 Aalborg East, Denmark, Nov. 2002. submitted to Constructive Apprimation.
34. B. Golubov, A. Efimov, and V. Skvortsov, Walsh series and transforms, Theory and applications, Translated from the 1987 Russian original by W. R. Wade, Kluwer Academic Publishers Group, Dordrecht, 1991.
35. 4-Kerdockcodes, orthogonal spreads, and extremal Euclidean line-sets," Proc. London Math. Soc. (3) 75(2), pp. 436-480, 1997.
36. T. Strohmer and R. Heath, "Grassmannian frames with applications to coding and communications," tech. rep., 2002. Preprint, submitted to Appl.Comp.Harm.Anal.
37. D. Field and B. Olshausen, "Emergence of simple-cell receptive field properties by learning a sparse code for natural images," Nature 381, pp. 607-609, 1996.
38. A. Bell and T. Sejnowski, "The 'independent components' of natural scenes are edge filters," Vision Research 37(23), pp. 3327-3338, 1997.
39. A. Bell and T. Sejnowski, "Learning the higher-order structure of a natural sound," Network 7(2), 1996.
40. M. Lewicki, "Efficient coding of natural sounds," Nature Neuosci. 5(4), pp. 356-363, 2002.
41. S. Abdallah and M. Plumbley, "If edges are the independent components of natural images, what are the independent components of natural sounds?," in Proc. of the Int. Conf. on Indep. Component Anal. and Blind Signal Separation (ICA2001), pp. 534-539, (San Diego, California), Dec. 2001.