L. Daudet, Sparse and structured decompositions of audio signals in overcomplete spaces, Proc. Int'l Conference on Digital Audio Effects (DAFx), pp.22-26, 2004.

C. Févotte, L. Daudet, S. J. Godsill, and B. Torrésani, Sparse Regression with Structured Priors: Application to Audio Denoising, 2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings, pp.174-185, 2008.
DOI : 10.1109/ICASSP.2006.1660589

B. D. Jeffs and M. Gunsay, Restoration of blurred star field images by maximally sparse optimization, IEEE Transactions on Image Processing, vol.2, issue.2, pp.202-211, 1993.
DOI : 10.1109/83.217223

R. M. Figueras, P. Ventura, P. Vandergheynst, and . Frossard, Low rate and scalable image coding with redundant representations, Tech. Rep, 2003.

D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory, vol.52, issue.4, pp.1289-1306, 2006.
DOI : 10.1109/TIT.2006.871582
URL : https://hal.archives-ouvertes.fr/inria-00369486

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

A. Miller, Subset selection in regression, 2002.

B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, Least angle regression, The Annals of Statistics, vol.32, issue.2, p.407499, 2004.

H. Markowitz, The optimization of a quadratic function subject to linear constraints, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.111-133, 1956.
DOI : 10.1002/nav.3800030110

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, 1998.
DOI : 10.1137/S1064827596304010

R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society, vol.58, pp.267-288, 1996.

I. F. Gorodnitsky and B. D. Bhaskar, Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm, IEEE Transactions on Signal Processing, vol.45, issue.3, pp.600-616, 1997.
DOI : 10.1109/78.558475

N. G. Kingsbury and T. H. Reeves, Overcomplete image coding using iterative projection-based noise shaping, Proc. IEEE Int'l Conference on Image Processing (ICIP), pp.597-600, 2002.

T. Blumensath and M. E. Davies, Iterative Thresholding for Sparse Approximations, Journal of Fourier Analysis and Applications, vol.73, issue.10, pp.629-654, 2008.
DOI : 10.1007/s00041-008-9035-z

I. Daubechies, M. Defrise, and C. Demol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Communications on Pure and Applied Mathematics, vol.58, issue.11, pp.1413-1457, 2004.
DOI : 10.1002/cpa.20042

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

Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers, pp.40-44, 1993.
DOI : 10.1109/ACSSC.1993.342465
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.5735

C. Chen, Adaptive transform coding via quadtree-based variable blocksize DCT, International Conference on Acoustics, Speech, and Signal Processing, pp.23-26, 1989.
DOI : 10.1109/ICASSP.1989.266814

D. L. Donoho, Y. Tsaig, I. Drori, and J. Starck, Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.58, issue.2, 2006.
DOI : 10.1109/TIT.2011.2173241

W. Dai and O. Milenkovic, Subspace Pursuit for Compressive Sensing Signal Reconstruction, IEEE Transactions on Information Theory, vol.55, issue.5, pp.2230-2249, 2009.
DOI : 10.1109/TIT.2009.2016006
URL : http://arxiv.org/abs/0803.0811

D. Needell and J. A. Tropp, CoSaMP, Communications of the ACM, vol.53, issue.12, pp.301-321, 2009.
DOI : 10.1145/1859204.1859229

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

M. S. Lewicki and T. J. Sejnowski, Learning Overcomplete Representations, Neural Computation, vol.33, issue.2, pp.337-365, 2000.
DOI : 10.1109/18.119725
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.7690

M. Girolami, A Variational Method for Learning Sparse and Overcomplete Representations, Neural Computation, vol.22, issue.10, pp.2517-2532, 2003.
DOI : 10.1109/18.119725

C. Févotte and S. J. , A Bayesian Approach for Blind Separation of Sparse Sources, IEEE Transactions on Audio, Speech and Language Processing, vol.14, issue.6, pp.2174-2188, 2006.
DOI : 10.1109/TSA.2005.858523

C. Févotte and S. J. , Blind separation of sparse sources using jeffrey's inverse prior and the expectationmaximization algorithm, Proc. Int'l Conference on Independent Component Analysis and Blind Source Separation (ICA), pp.593-600, 2006.

P. Schniter, L. C. Potter, and J. Ziniel, Fast bayesian matching pursuit, 2008 Information Theory and Applications Workshop, pp.326-333, 2008.
DOI : 10.1109/ITA.2008.4601068

H. Zayyani, M. Babaie-zadeh, and C. Jutten, Bayesian Pursuit algorithm for sparse representation, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, 2009.
DOI : 10.1109/ICASSP.2009.4959892
URL : https://hal.archives-ouvertes.fr/hal-00400478

H. Zayyani, M. Babaie-zadeh, and C. Jutten, An Iterative Bayesian Algorithm for Sparse Component Analysis in Presence of Noise, IEEE Transactions on Signal Processing, vol.57, issue.11, pp.4378-4390, 2009.
DOI : 10.1109/TSP.2009.2025154
URL : https://hal.archives-ouvertes.fr/hal-00428706

D. Baron, S. Sarvotham, and R. G. Baraniuk, Bayesian Compressive Sensing Via Belief Propagation, IEEE Transactions on Signal Processing, vol.58, issue.1, 2009.
DOI : 10.1109/TSP.2009.2027773
URL : http://arxiv.org/abs/0812.4627

C. Herzet and A. Drémeau, Sparse representation algorithms based on mean-field approximations, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, pp.2034-2037, 2010.
DOI : 10.1109/ICASSP.2010.5494965
URL : https://hal.archives-ouvertes.fr/inria-00589354

C. Herzet and A. Drémeau, Bayesian pursuit algorithms, Proc. European Signal Processing Conference (EUSIPCO), 2010.
URL : https://hal.archives-ouvertes.fr/hal-00673801

C. Soussen, J. Idier, D. Brie, and J. Duan, From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration, IEEE Transactions on Signal Processing, vol.59, issue.10, 2010.
DOI : 10.1109/TSP.2011.2160633

D. Ge, J. Idier, and E. L. Carpentier, Enhanced sampling schemes for MCMC based blind Bernoulli???Gaussian deconvolution, Signal Processing, pp.759-772, 2011.
DOI : 10.1016/j.sigpro.2010.08.009
URL : https://hal.archives-ouvertes.fr/hal-00517861

F. Krzakala, M. Mézart, F. Sausset, Y. F. Sun, and L. Zdeborová, Statistical-Physics-Based Reconstruction in Compressed Sensing, Physical Review X, vol.2, issue.2, 2011.
DOI : 10.1103/PhysRevX.2.021005
URL : https://hal.archives-ouvertes.fr/hal-00716897

J. Vila and P. Schniter, Expectation-maximization Bernoulli-Gaussian approximate message passing, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2011.
DOI : 10.1109/ACSSC.2011.6190117
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.4327

Y. C. Eldar and M. Mishali, Robust Recovery of Signals From a Structured Union of Subspaces, IEEE Transactions on Information Theory, vol.55, issue.11, pp.5302-5316, 2009.
DOI : 10.1109/TIT.2009.2030471

Y. C. Eldar, P. Kuppinger, and H. Bolcskei, Compressed sensing of block-sparse signals: uncertainty relations and efficient recovery, 2010.

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

L. Yu, J. Barbot, G. Zheng, and H. Sun, Compressive sensing for cluster structured sparse signals: variational Bayes approach, IET Signal Processing, vol.10, issue.7, 2011.
DOI : 10.1049/iet-spr.2014.0157
URL : https://hal.archives-ouvertes.fr/hal-00573953

L. Yu, H. Sun, J. Barbot, and G. Zheng, Bayesian Compressive Sensing for clustered sparse signals, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.3948-3951, 2011.
DOI : 10.1109/ICASSP.2011.5947216
URL : https://hal.archives-ouvertes.fr/hal-00573954

J. Huang, T. 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

S. Rangan, A. K. Fletcher, V. K. Goyal, and P. Schniter, Hybrid generalized approximate message passing with applications to structured sparsity, 2012 IEEE International Symposium on Information Theory Proceedings, 2011.
DOI : 10.1109/ISIT.2012.6283054

D. L. Donoho, A. Maleki, and A. Montanari, Message passing algorithms for compressed sensing: I. motivation and construction, IEEE Information Theory Workshop 2010 (ITW 2010), pp.1-5, 2010.
DOI : 10.1109/ITWKSPS.2010.5503193

P. Sprechmann, I. Ramirez, and G. Sapiro, Collaborative hierarchical sparse modeling, 2010 44th Annual Conference on Information Sciences and Systems (CISS), 2010.
DOI : 10.1109/CISS.2010.5464845

M. Kowalski and B. Torrésani, Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients, Signal, image and video processing, pp.251-264, 2009.
DOI : 10.1007/s11760-008-0076-1
URL : https://hal.archives-ouvertes.fr/hal-00206245

L. Daudet, Sparse and structured decompositions of signals with the molecular matching pursuit, IEEE Transactions on Audio, Speech and Language Processing, vol.14, issue.5, pp.1808-1816, 2006.
DOI : 10.1109/TSA.2005.858540
URL : https://hal.archives-ouvertes.fr/hal-00105054

R. Jenatton, J. Mairal, G. Obozinski, and F. Bach, Proximal methods for hierarchical sparse coding, Tech. Rep, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00516723

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

L. He, H. Chen, and L. Carin, Tree-structured compressive sensing with variational bayesian analysis, IEEE Signal Processing Letters, vol.17, issue.3, pp.233-236, 2010.

P. Schniter, Turbo reconstruction of structured sparse signals, 2010 44th Annual Conference on Information Sciences and Systems (CISS), pp.1-6, 2010.
DOI : 10.1109/CISS.2010.5464920

P. J. Garrigues and B. A. Olshausen, Learning horizontal connections in a sparse coding model of natural images, Advances in Neural Information Processing Systems (NIPS), pp.505-512, 2008.

V. Cevher, M. F. Duarte, C. Hegde, and R. G. Baraniuk, Sparse signal recovery using markov random fields, Advances in Neural Information Processing Systems (NIPS), 2008.

T. Faktor, Y. C. Eldar, and M. Elad, Exploiting statistical dependencies in sparse representations for signal recovery

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

D. H. Ackley, G. E. Hinton, and T. J. Sejnowski, A Learning Algorithm for Boltzmann Machines*, Cognitive Science, vol.85, issue.1, pp.147-169, 1985.
DOI : 10.1207/s15516709cog0901_7

C. Bernard and . Levy, Principles of Signal Detection and Parameter Estimation, 2008.

M. J. Wainwright and M. I. Jordan, Graphical Models, Exponential Families, and Variational Inference, Foundations and Trends?? in Machine Learning, vol.1, issue.1???2, 2003.
DOI : 10.1561/2200000001

M. Beal, Variational algorithms for approximate Bayesian inference, 2003.

T. P. Minka, Using lower bounds to approximate integrals, 2001.

M. J. Beal and Z. Ghahramani, The variational bayesian em algorithm for incomplete data: with application to scoring graphical model structures, Bayesian Statistics, vol.7, pp.453-463, 2003.

A. P. Dempster, N. M. Laird, and D. B. Rubin, Maximum likelihood from incomplete data via the em algorithm, Journal of the Royal Statistical Society. Series B (Methodological), vol.39, pp.1-38, 1977.

R. M. Neal and G. E. Hinton, A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants, Learning in graphical models, pp.355-368, 1998.
DOI : 10.1007/978-94-011-5014-9_12

A. Drémeau, C. Herzet, and L. Daudet, Soft Bayesian pursuit algorithm for sparse representations, 2011 IEEE Statistical Signal Processing Workshop (SSP), pp.341-344, 2011.
DOI : 10.1109/SSP.2011.5967699

H. Zayyani, M. Babaie-zadeh, and C. Jutten, Sparse component analysis in presence of noise using em-map, Proc
URL : https://hal.archives-ouvertes.fr/hal-00173379

. Int and . Conf, on Independent Component Analysis and Signal Separation, 2007.

I. Murray, Z. Ghahramani, and D. J. Mackay, Mcmc for doubly-intractable distributions, Proc. Annual Conference on Uncertainty in Artificial Intelligence (UAI), pp.359-366, 2006.

M. J. Nijman and H. J. Kappen, Efficient learning in sparsely connected Boltzmann machines, Proc. Int'l Conf. on Artificial Neural Networks, 1996.
DOI : 10.1007/3-540-61510-5_11

N. L. Lawrence, C. M. Bishop, and M. I. Jordan, Mixture representations for inference and learning in boltzmann machines, Proc. Conference on Uncertainty in Artificial Intelligence, 1998.

S. Rangan, Generalized approximate message passing for estimation with random linear mixing, 2011 IEEE International Symposium on Information Theory Proceedings, 2010.
DOI : 10.1109/ISIT.2011.6033942