S. Chen, D. L. Donoho, and M. A. Saunders, Atomic Decomposition by Basis Pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1999.
DOI : 10.1137/S1064827596304010

O. Christensen, An Introduction to Frames and Riesz Bases, 2003.

G. Davis, S. Mallat, and M. Avellaneda, Adaptive greedy approximations, Constructive Approximation, vol.21, issue.1, pp.57-98, 1997.
DOI : 10.1007/BF02678430

R. A. Devore and V. N. Temlyakov, Some remarks on greedy algorithms, Advances in Computational Mathematics, vol.102, issue.1, pp.3-173, 1996.
DOI : 10.1007/BF02124742

D. Donoho, M. Elad, and V. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Transactions on Information Theory, vol.52, issue.1, p.6, 2004.
DOI : 10.1109/TIT.2005.860430

D. L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via ??1 minimization, Proc. Nat. Acad
DOI : 10.1073/pnas.0437847100

D. L. Donoho and X. Huo, Uncertainty principles and ideal atomic decomposition, IEEE Transactions on Information Theory, vol.47, issue.7, pp.2845-2862, 2001.
DOI : 10.1109/18.959265

M. Elad and A. M. Bruckstein, A generalized uncertainty principle and sparse representation in pairs of bases, IEEE Transactions on Information Theory, vol.48, issue.9, pp.2558-2567, 2002.
DOI : 10.1109/TIT.2002.801410

A. Feuer and A. Nemirovsky, On sparse representation in pairs of bases, IEEE Transactions on Information Theory, vol.49, issue.6, pp.1579-1581, 2003.
DOI : 10.1109/TIT.2003.811926

J. H. Friedman and W. Stuetzle, Projection Pursuit Regression, Journal of the American Statistical Association, vol.4, issue.376, pp.817-823, 1981.
DOI : 10.1080/01621459.1981.10477729

J. Fuchs, Recovery of exact sparse representations in the presence of noise, Proc. 2004 IEEE Int. Conf. Acoustics, Speech, and Signal Processing, pp.533-536, 2005.

A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss, Approximation of functions over redundant dictionaries using coherence, Proc. 14th ACM-SIAM Symp. Discrete Algorithms (SODA'03), pp.243-252, 2003.

A. C. Gilbert, S. Muthukrishnan, M. J. Strauss, and J. Tropp, Improved sparse approximation over quasi-incoherent dictionaries, Proc. Int. Conf. Image Processing (ICIP'03), pp.37-40, 2003.

R. Gribonval and E. Bacry, Harmonic decomposition of audio signals with matching pursuit, IEEE Transactions on Signal Processing, vol.51, issue.1, pp.101-111, 2003.
DOI : 10.1109/TSP.2002.806592
URL : https://hal.archives-ouvertes.fr/inria-00576203

R. Gribonval, E. Bacry, S. Mallat, P. Depalle, and X. Rodet, Analysis of sound signals with high resolution matching pursuit, Proceedings of Third International Symposium on Time-Frequency and Time-Scale Analysis (TFTS-96), pp.125-128, 1996.
DOI : 10.1109/TFSA.1996.546702
URL : https://hal.archives-ouvertes.fr/inria-00576196

R. Gribonval, R. M. Figueras, P. Ventura, and . Vandergheynst, A Simple Test to Check the Optimality of Sparse Signal Approximations, IRISA, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00564503

R. Gribonval and M. Nielsen, Beyond sparsity: Recovering structured representations by l1-minimization and greedy algorithms.-application to the analysis of sparse underdetermined ICA Highly Sparse Representations from Dictionaries Are Unique and Independent of the Sparseness Measure, Sparse decompositions in unions of bases, pp.3320-3325, 2003.

R. A. Horn and C. R. Johnson, Matrix Analysis, 1985.

P. J. Huber, Projection Pursuit, The Annals of Statistics, vol.13, issue.2, pp.435-475, 1985.
DOI : 10.1214/aos/1176349519

S. Jaggi, W. C. Carl, S. Mallat, and A. S. Willsky, High Resolution Pursuit for Feature Extraction, Applied and Computational Harmonic Analysis, vol.5, issue.4, pp.428-449, 1998.
DOI : 10.1006/acha.1997.0239

L. K. Jones, On a Conjecture of Huber Concerning the Convergence of Projection Pursuit Regression, The Annals of Statistics, vol.15, issue.2, pp.880-882, 1987.
DOI : 10.1214/aos/1176350382

S. Mallat and Z. Zhang, Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-3415, 1993.
DOI : 10.1109/78.258082

V. N. Temlyakov, Greedy algorithms and m-term approximation with regard to redundant dictionaries Weak greedy algorithms, J. Approx. Theory Adv. Comput. Math, vol.9827, issue.12 2 3, pp.117-145, 1999.

J. Tropp, Greed is Good: Algorithmic Results for Sparse Approximation, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2231-2242, 2004.
DOI : 10.1109/TIT.2004.834793

L. Villemoes, Nonlinear approximation with walsh atoms Surface Fitting and Multiresolution Methods, Proc, pp.329-336, 1996.