B. D. Rao, Signal processing with the sparseness constraint, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), pp.1861-1864, 1998.
DOI : 10.1109/ICASSP.1998.681826

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.5769

S. B. Stechkin, On absolute convergence of orthogonal series, Dok. Akad. Nauk SSSR, vol.102, pp.37-40, 1955.

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

R. Gribonval and M. Nielsen, Nonlinear Approximation with Dictionaries I. Direct Estimates, Journal of Fourier Analysis and Applications, vol.10, issue.1, 2003.
DOI : 10.1007/s00041-004-8003-5
URL : https://hal.archives-ouvertes.fr/inria-00567266

K. Kreutz-delgado, B. Rao, K. Engan, T. Lee, and T. Sejnowski, Convex/schur-convex (csc) log-priors and sparse coding, 6th Joint Symposium on Neural ComputationInstitute for Neural Computation), pp.65-71, 1999.

D. Donoho and M. Elad, Optimally sparse representation in general (non-orthogonal) dictionaries via minimization, Proc. Nat. Aca. Sci. 100, pp.2197-2202, 2003.

R. Gribonval and M. Nielsen, Sparse decompositions in unions of bases, 2002.

G. Davis, S. Mallat, and M. Avellaneda, Adaptive greedy approximations, Constructive Approximation, vol.21, issue.1, pp.57-98, 1997.
DOI : 10.1007/BF02678430
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7530

S. Chen, D. Donoho, and M. Saunders, Atomic Decomposition by Basis Pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1999.
DOI : 10.1137/S1064827596304010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7694

Y. Pati, R. Rezaiifar, and P. Krishnaprasad, Orthonormal matching pursuit : recursive function approximation with applications to wavelet decomposition, Proceedings of the Annual Asilomar Conf. on Signals, Systems and Computers, 1993.

D. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.9300

M. Elad and A. 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, 2002.
DOI : 10.1109/TIT.2003.811926

J. J. Fuchs, Une approchè a l'estimation et l'identification simultanées Actes duseizì eme colloque GRETSI, pp.1273-1276, 1997.

J. J. Fuchs, Detection and estimation of superimposed signals, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), pp.1649-1652, 1998.
DOI : 10.1109/ICASSP.1998.681771

J. Fuchs, On Sparse Representations in Arbitrary Redundant Bases, tech. rep., IRISA, 2002.
DOI : 10.1109/TIT.2004.828141
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1728

A. Gilbert, S. Muthukrishnan, and M. Strauss, Approximation of functions over redundant dictionaries using coherence, The 14th ACM-SIAM Symposium on Discrete Algorithms (SODA'03, 2003.

J. Tropp, Greed is Good: Algorithmic Results for Sparse Approximation, tech. rep., Texas Institute for Computational Engineering and Sciences, 2003.
DOI : 10.1109/TIT.2004.834793
URL : http://authors.library.caltech.edu/9035/1/TROieeetit04a.pdf

R. Gribonval and P. Vandergheynst, Exponential convergence of Matching Pursuit in quasi-incoherent dictionaries, " tech. rep, 2003.

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

R. Gribonval and M. Nielsen, Some remarks on nonlinear approximation with Schauder bases, East J. Approx, vol.7, issue.3, pp.267-285, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00576640

S. Konyagin and V. Temlyakov, A remark on greedy approximation in Banach spaces, East J. Approx, vol.5, issue.3, pp.365-379, 1999.

R. A. Devore, Nonlinear approximation, Acta numerica, pp.51-150, 1998.
DOI : 10.1007/BF02274662

R. Gribonval and M. Nielsen, On approximation with spline generated framelets, Constr. Approx, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00567338

R. Gribonval and M. Nielsen, On the quasi-greedy property and uniformly bounded orthonormal systems, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00576212

Z. S. Wang, J. Y. Cheung, Y. S. Xia, and J. D. Chen, Minimum fuel neural networks and their applications to overcomplete signal representations, IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol.47, issue.8, pp.1146-1159, 2000.
DOI : 10.1109/81.873870

S. Sardy, A. Bruce, and P. Tseng, Block coordinate relaxation methods for nonparametric wavelet denoising, Journal of Computational and Graphical Statistics, vol.9, issue.2, 2000.

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

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

V. Temlyakov, Weak greedy algorithms, Advances in Computational Mathematics, vol.122, pp.213-227, 2000.

L. 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

E. Livschitz and V. Temlyakov, Two Lower Estimates in Greedy Approximation, Constructive Approximation, vol.19, issue.4, 2003.
DOI : 10.1007/s00365-003-0533-6

L. Villemoes, Nonlinear approximation with walsh atoms Surface Fitting and Multiresolution Methods, Proceedings of, pp.329-336, 1996.
DOI : 10.1007/s003659900046

R. Gribonval and M. Nielsen, Nonlinear Approximation with Dictionaries. II. Inverse Estimates, Constructive Approximation, vol.24, issue.2, 2002.
DOI : 10.1007/s00365-005-0621-x
URL : https://hal.archives-ouvertes.fr/inria-00564480

B. Golubov, A. Efimov, and V. Skvortsov, Walsh series and transforms, Theory and applications, Translated from the 1987 Russian original by, 1991.

A. R. Calderbank, P. J. Cameron, W. M. Kantor, and J. J. Seidel, -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets, Proc. London Math. Soc. (3), pp.436-480, 1997.
DOI : 10.1112/S0024611597000403
URL : https://hal.archives-ouvertes.fr/hal-00084952

T. Strohmer and R. Heath, Grassmannian frames with applications to coding and communication, Applied and Computational Harmonic Analysis, vol.14, issue.3, 2002.
DOI : 10.1016/S1063-5203(03)00023-X

D. Field and B. Olshausen, Emergence of simple-cell receptive field properties by learning a sparse code for natural images, Nature, vol.381, pp.607-609, 1996.

A. Bell and T. Sejnowski, The ???independent components??? of natural scenes are edge filters, Vision Research, vol.37, issue.23, pp.3327-3338, 1997.
DOI : 10.1016/S0042-6989(97)00121-1

A. Bell and T. Sejnowski, Learning the higher-order structure of a natural sound, Network, vol.7, issue.2, 1996.

M. Lewicki, Efficient coding of natural sounds, Nature Neuroscience, vol.5, issue.4, pp.356-363, 2002.
DOI : 10.1038/nn831

S. Abdallah and M. Plumbley, If edges are the independent components of natural images, what are the independent components of natural sounds?, Proc. of the Int. Conf. on Indep. Component Anal. and Blind Signal Separation (ICA2001), pp.534-539, 2001.