R. Rubinstein, A. M. Bruckstein, and M. Elad, Dictionaries for Sparse Representation Modeling, Proceedings of the IEEE, pp.1045-1057, 2010.
DOI : 10.1109/JPROC.2010.2040551
URL : https://hal.archives-ouvertes.fr/inria-00565811

J. Cooley and J. Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of Computation, vol.19, issue.90, pp.297-301, 1965.
DOI : 10.1090/S0025-5718-1965-0178586-1

S. Mallat, A theory for multiresolution signal decomposition: the wavelet representation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.11, issue.7, pp.674-693, 1989.
DOI : 10.1109/34.192463

R. Rubinstein, M. Zibulevsky, and M. Elad, Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation, IEEE Transactions on Signal Processing, vol.58, issue.3, pp.1553-1564, 2010.
DOI : 10.1109/TSP.2009.2036477

O. Chabiron, F. Malgouyres, J. Tourneret, and N. Dobigeon, Toward Fast Transform Learning, International Journal of Computer Vision, vol.60, issue.12, 2013.
DOI : 10.1007/s11263-014-0771-z
URL : https://hal.archives-ouvertes.fr/hal-00862903

J. Bolte, S. Sabach, and M. Teboulle, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Mathematical Programming, pp.1-36, 2013.
DOI : 10.1007/s10107-013-0701-9
URL : https://hal.archives-ouvertes.fr/hal-00916090

A. B. Lee, B. Nadler, and L. Wasserman, Treelets???An adaptive multi-scale basis for sparse unordered data, The Annals of Applied Statistics, vol.2, issue.2, pp.435-471, 2008.
DOI : 10.1214/07-AOAS137

G. Cao, L. R. Bachega, and C. A. Bouman, The Sparse Matrix Transform for Covariance Estimation and Analysis of High Dimensional Signals, IEEE Transactions on Image Processing, vol.20, issue.3, pp.625-640, 2011.
DOI : 10.1109/TIP.2010.2071390

S. Lyu and X. Wang, On algorithms for sparse multi-factor NMF, Advances in Neural Information Processing Systems 26, pp.602-610

B. Neyshabur and R. Panigrahy, Sparse matrix factorization. CoRR, abs/1311, 2013.

S. Arora, A. Bhaskara, R. Ge, and T. Ma, Provable bounds for learning some deep representations. CoRR, abs, 1310.

K. Gregor and Y. Lecun, Learning fast approximations of sparse coding, Proceedings of the 27th Annual International Conference on Machine Learning, ICML '10, pp.399-406, 2010.

P. Sprechmann, A. M. Bronstein, and G. Sapiro, Learning Efficient Sparse and Low Rank Models, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.37, issue.9, 1212.
DOI : 10.1109/TPAMI.2015.2392779
URL : http://arxiv.org/abs/1212.3631

S. G. 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

M. Aharon, M. Elad, and A. Bruckstein, <tex>$rm K$</tex>-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation, IEEE Transactions on Signal Processing, vol.54, issue.11, pp.4311-4322, 2006.
DOI : 10.1109/TSP.2006.881199

R. Rubinstein, M. Zibulevsky, and M. Elad, Efficient Implementation of the K- SVD Algorithm using Batch Orthogonal Matching Pursuit, 2008.

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online learning for matrix factorization and sparse coding, Journal of Machine Learning Research, vol.11, issue.1, pp.19-60, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00408716