P. Zhao, G. Rocha, Y. , and B. , The composite absolute penalties family for grouped and hierarchical variable selection, The Annals of Statistics, vol.37, issue.6A, pp.3468-3497, 2009.
DOI : 10.1214/07-AOS584

R. Jenatton, J. Audibert, and F. Bach, Structured variable selection with sparsity-inducing norms, tech. rep, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00377732

L. Jacob, G. Obozinski, and J. Vert, Group lasso with overlap and graph lasso, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, 2009.
DOI : 10.1145/1553374.1553431

J. Huang, Z. Zhang, and D. Metaxas, Learning with structured sparsity, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, 2009.
DOI : 10.1145/1553374.1553429

R. G. Baraniuk, V. Cevher, M. Duarte, and C. Hegde, Model-Based Compressive Sensing, IEEE Transactions on Information Theory, vol.56, issue.4, pp.1982-2001, 2010.
DOI : 10.1109/TIT.2010.2040894

V. Cehver, M. F. Duarte, C. Hedge, and R. G. Baraniuk, Sparse signal recovery using Markov random fields, [Advances in Neural Information Processing Systems, 2008.

L. He and L. Carin, Exploiting structure in wavelet-based Bayesian compressive sensing, IEEE Transactions on Signal Processing, vol.57, issue.9, pp.3488-3497, 2009.

B. A. Turlach, W. N. Venables, W. , and S. J. , Simultaneous Variable Selection, Technometrics, vol.47, issue.3, pp.349-363, 2005.
DOI : 10.1198/004017005000000139

M. Yuan and Y. Lin, Model selection and estimation in regression with grouped variables, Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol.58, issue.1, pp.49-67, 2006.
DOI : 10.1198/016214502753479356

G. Obozinski, B. Taskar, J. , and M. I. , Joint covariate selection and joint subspace selection for multiple classification problems, Statistics and Computing, vol.8, issue.68, pp.231-252, 2010.
DOI : 10.1007/s11222-008-9111-x

R. Jenatton, J. Mairal, G. Obozinski, and F. Bach, Proximal methods for hierarchical sparse coding, Journal of Machine Learning Research, vol.12, pp.2297-2334, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00516723

J. Mairal, R. Jenatton, G. Obozinski, and F. Bach, Network flow algorithms for structured sparsity, [Advances in Neural Information Processing Systems, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00512556

J. Mairal, R. Jenatton, G. Obozinski, and F. Bach, Convex and network flow optimization for structured sparsity, " accepted with minor revision in the, preprint arXiv, pp.1104-1872, 2011.

B. A. Olshausen and D. J. Field, Sparse coding with an overcomplete basis set: A strategy employed by V1?, Vision Research, vol.37, issue.23, pp.3311-3325, 1997.
DOI : 10.1016/S0042-6989(97)00169-7

B. A. Olshausen and D. J. Field, Emergence of simple-cell receptive field properties by learning a sparse code for natural images, Nature, vol.381, issue.6583, pp.607-609, 1996.
DOI : 10.1038/381607a0

K. Engan, S. O. Aase, and J. H. Husoy, Frame based signal compression using method of optimal directions (MOD), ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349), p.4, 1999.
DOI : 10.1109/ISCAS.1999.779928

M. Elad and M. Aharon, Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries, IEEE Transactions on Image Processing, vol.15, issue.12, pp.3736-3745, 2006.
DOI : 10.1109/TIP.2006.881969
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.6477

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

J. Mairal, M. Elad, and G. Sapiro, Sparse Representation for Color Image Restoration, IEEE Transactions on Image Processing, vol.17, issue.1, pp.53-69, 2008.
DOI : 10.1109/TIP.2007.911828

K. Kavukcuoglu, M. Ranzato, R. Fergus, and Y. Lecun, Learning invariant features through topographic filter maps, 2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009.
DOI : 10.1109/CVPR.2009.5206545
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.9635

A. Hyvärinen, P. Hoyer, and M. Inki, Topographic Independent Component Analysis, Neural Computation, vol.18, issue.10, pp.1527-1558, 2001.
DOI : 10.1016/S0013-4694(97)00042-8

E. Candes and D. L. Donoho, singularities, Communications on Pure and Applied Mathematics, vol.9, issue.7, pp.219-266, 2004.
DOI : 10.1002/cpa.10116

D. L. Donoho, Wedgelets: nearly minimax estimation of edges, The Annals of Statistics, vol.27, issue.3, pp.859-897, 1998.
DOI : 10.1214/aos/1018031261

S. Mallat and E. L. Pennec, Bandelet image approximation and compression, SIAM Multiscale Modelling and Simulation, vol.4, issue.3, pp.992-1039, 2005.

S. Mallat, [A Wavelet Tour of Signal Processing, 1999.

J. Mairal, F. Bach, J. Ponce, G. Sapiro, and A. Zisserman, Non-local sparse models for image restoration, 2009 IEEE 12th International Conference on Computer Vision, 2009.
DOI : 10.1109/ICCV.2009.5459452

G. Peyré, Sparse Modeling of Textures, Journal of Mathematical Imaging and Vision, vol.27, issue.2, pp.17-31, 2009.
DOI : 10.1007/s10851-008-0120-3

R. Tibshirani, Regression shrinkage and selection via the Lasso, Journal of the Royal Statistical Society: Series B, vol.58, issue.1, pp.267-288, 1996.

J. Friedman, machine., The Annals of Statistics, vol.29, issue.5, pp.1189-1232, 2001.
DOI : 10.1214/aos/1013203451

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

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

B. Natarajan, Sparse Approximate Solutions to Linear Systems, SIAM Journal on Computing, vol.24, issue.2, p.227, 1995.
DOI : 10.1137/S0097539792240406

J. M. Shapiro, Embedded image coding using zerotrees of wavelet coefficients, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3445-3462, 1993.
DOI : 10.1109/78.258085

M. Aharon, M. Elad, and A. M. 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

D. D. Lee and H. S. Seung, Algorithms for non-negative matrix factorization, [Advances in Neural Information Processing Systems, pp.556-562, 2001.

J. Mairal, Sparse coding for machine learning, image processing and computer vision, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00595312

F. Bach, R. Jenatton, J. Mairal, and G. Obozinski, Convex optimization with sparsity-inducing norms, " in [Optimization for Machine Learning, 2011.

P. L. Combettes and J. Pesquet, Proximal splitting methods in signal processing, " in [Fixed-Point Algorithms for Inverse Problems in Science and Engineering, 2010.

Y. Nesterov, Gradient methods for minimizing composite objective function, tech. rep., Center for Operations Research and Econometrics (CORE), 2007.
DOI : 10.1007/s10107-012-0629-5

A. Beck and M. Teboulle, A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems, SIAM Journal on Imaging Sciences, vol.2, issue.1, pp.183-202, 2009.
DOI : 10.1137/080716542

P. Brucker, An O(n) algorithm for quadratic knapsack problems, Operations Research Letters, vol.3, issue.3, pp.163-166, 1984.
DOI : 10.1016/0167-6377(84)90010-5

N. Maculan and J. R. De-paula, A linear-time median-finding algorithm for projecting a vector on the simplex of n, Operations Research Letters, vol.8, issue.4, pp.219-222, 1989.
DOI : 10.1016/0167-6377(89)90064-3

J. Friedman, T. Hastie, and R. Tibshirani, A note on the group Lasso and a sparse group Lasso, tech. rep, pp.1001-0736, 2010.

P. Sprechmann, I. Ramirez, G. Sapiro, and Y. C. Eldar, Collaborative hierarchical sparse modeling, 2010 44th Annual Conference on Information Sciences and Systems (CISS), 2010.
DOI : 10.1109/CISS.2010.5464845
URL : http://arxiv.org/abs/1003.0400

F. Bach, Structured sparsity-inducing norms through submodular functions, Adv. NIPS ], 2010.
URL : https://hal.archives-ouvertes.fr/hal-00511310

D. P. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: Numerical Methods, 1989.

R. Tomioka, T. Suzuki, and M. Sugiyama, Augmented Lagrangian methods for learning, selecting and combining features, " in [Optimization for Machine Learning, 2011.

S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, Foundations and Trends?? in Machine Learning, vol.3, issue.1, pp.1-122, 2011.
DOI : 10.1561/2200000016

Z. Qin and D. Goldfarb, Structured sparsity via alternating directions methods, tech. rep, 2011.

D. Martin, C. Fowlkes, D. Tal, M. , and J. , A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, 2001.
DOI : 10.1109/ICCV.2001.937655

P. Garrigues and B. Olshausen, Group sparse coding with a laplacian scale mixture prior, [Advances in Neural Information Processing Systems, 2010.