A. Cohen, W. Dahmen, and R. A. Devore, Compressed sensing and best $k$-term approximation, Journal of the American Mathematical Society, vol.22, issue.1, pp.211-231, 2009.
DOI : 10.1090/S0894-0347-08-00610-3

E. J. Candès, J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Communications on Pure and Applied Mathematics, vol.7, issue.8, pp.1207-1223, 2006.
DOI : 10.1002/cpa.20124

E. J. Candès, The restricted isometry property and its implications for compressed sensing Compte Rendus de l'Academie des Sciences, pp.589-592, 2008.

M. Elad, P. Milanfar, and R. Rubinstein, Analysis versus synthesis in signal priors, IOP Inverse Problems, pp.947-968, 2007.
DOI : 10.1088/0266-5611/23/3/007

S. Nam, M. E. Davies, M. Elad, and R. Gribonval, The cosparse analysis model and algorithms, Applied and Computational Harmonic Analysis, vol.34, issue.1, pp.30-56, 2013.
DOI : 10.1016/j.acha.2012.03.006

URL : https://hal.archives-ouvertes.fr/inria-00602205

E. J. Candès, Y. C. Eldar, D. Needell, and P. Randall, Compressed sensing with coherent and redundant dictionaries, Applied and Computational Harmonic Analysis, vol.31, issue.1, pp.59-73, 2011.
DOI : 10.1016/j.acha.2010.10.002

R. Giryes, S. Nam, M. Elad, R. Gribonval, and M. E. Davies, Greedy-like algorithms for the cosparse analysis model, Linear Algebra and its Applications, vol.441, 2012.
DOI : 10.1016/j.laa.2013.03.004

URL : https://hal.archives-ouvertes.fr/hal-00716593

C. La and M. N. Do, Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction, 2006 International Conference on Image Processing, 2005.
DOI : 10.1109/ICIP.2006.312578

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

Y. C. Eldar, P. Kuppinger, and H. Bolcskei, Block-Sparse Signals: Uncertainty Relations and Efficient Recovery, IEEE Transactions on Signal Processing, vol.58, issue.6, pp.3042-3054, 2010.
DOI : 10.1109/TSP.2010.2044837

T. Blumensath, Sampling and Reconstructing Signals From a Union of Linear Subspaces, IEEE Transactions on Information Theory, vol.57, issue.7, pp.4660-4671, 2011.
DOI : 10.1109/TIT.2011.2146550

M. Elad, Sparse Representations Are Most Likely to Be the Sparsest Possible, EURASIP Journal on Advances in Signal Processing, vol.31, issue.1, pp.1-12, 2006.
DOI : 10.1155/ASP/2006/96247

T. Blumensath and M. E. Davies, Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces, IEEE Transactions on Information Theory, vol.55, issue.4, pp.1872-1882, 2009.
DOI : 10.1109/TIT.2009.2013003