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

G. Davis, S. Mallat, and Z. Zhang, Adaptive Time-Frequency Approximations with Matching Pursuits, Wavelets: theory, algorithms, and applications (Taormina, pp.271-293, 1993.
DOI : 10.1016/B978-0-08-052084-1.50018-1

K. Lee and . Jones, On a conjecture of Huber concerning the convergence of projection pursuit regression, Ann. Statist, vol.15, issue.2, pp.880-882, 1987.

L. David, X. Donoho, and . Huo, Uncertainty principles and ideal atomic decomposition, IEEE Trans. Inform. Theory, vol.47, issue.7, pp.2845-2862, 2001.

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

L. David, M. Donoho, and . Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via l 1 minimization, Proc. Natl. Acad. Sci. USA, pp.2197-2202, 2003.

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

J. A. 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

R. Gribonval and M. Nielsen, Sparse representations in unions of bases, IEEE Transactions on Information Theory, vol.49, issue.12, pp.3320-3325, 2003.
DOI : 10.1109/TIT.2003.820031
URL : https://hal.archives-ouvertes.fr/inria-00570057

R. Gribonval and M. Nielsen, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Applied and Computational Harmonic Analysis, vol.22, issue.3, 2003.
DOI : 10.1016/j.acha.2006.09.003
URL : https://hal.archives-ouvertes.fr/inria-00544779

R. Gribonval and P. Vandergheynst, On the exponential convergence of matching pursuits in quasi-incoherent dictionaries, IEEE Transactions on Information Theory, vol.52, issue.1, 2004.
DOI : 10.1109/TIT.2005.860474
URL : https://hal.archives-ouvertes.fr/inria-00544945

L. Daudet and B. Torrésani, Hybrid representations for audiophonic signal encoding, Signal Processing, vol.82, issue.11, pp.1595-1617, 2002.
DOI : 10.1016/S0165-1684(02)00304-3
URL : https://hal.archives-ouvertes.fr/hal-01300317

J. Cardoso, Blind signal separation: statistical principles, Proceedings of the IEEE, vol.86, issue.10, pp.2009-2025, 1998.
DOI : 10.1109/5.720250

M. Zibulevsky and B. A. Pearlmutter, Blind Source Separation by Sparse Decomposition in a Signal Dictionary, Neural Computation, vol.1, issue.4, pp.863-882, 1007.
DOI : 10.1016/S0042-6989(97)00169-7

J. A. Tropp, A. C. Gilbert, and M. J. Strauss, Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit, Signal Processing, vol.86, issue.3, 2004.
DOI : 10.1016/j.sigpro.2005.05.030

A. Jourjine, S. Rickard, and O. Yilmaz, Blind separation of disjoint orthogonal signals: demixing N sources from 2 mixtures, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100), pp.2985-2988, 2000.
DOI : 10.1109/ICASSP.2000.861162

D. Leviatan and V. N. Temlyakov, Simultaneous approximation by greedy algorithms Advances in Comp, Math

K. Engan, S. F. Cotter, B. D. Rao, and K. Kreutz-delgado, Sparse solutions to linear inverse problems with multiple measurement vectors, IEEE Transactions on Signal Processing, 2005.

V. N. Temlyakov, Weak greedy algorithms, Advances in Computational Mathematics, vol.12, issue.2/3, pp.213-227, 2000.
DOI : 10.1023/A:1018917218956

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