E. J. Candès, J. Romberg, and T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, IEEE Transactions on Information Theory, vol.52, issue.2, pp.489-509, 2006.
DOI : 10.1109/TIT.2005.862083

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

R. G. Baraniuk, Compressive sensing, 2008 42nd Annual Conference on Information Sciences and Systems, pp.118-124, 2007.
DOI : 10.1109/CISS.2008.4558479
URL : https://hal.archives-ouvertes.fr/hal-00452261

R. Gribonval and S. Lesage, A survey of sparse component analysis for blind source separation: Principles, perspectives, and new challenges, Proc. Eur. Symp. Artif, pp.323-330, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00544897

P. Bofill and M. Zibulevsky, Underdetermined blind source separation using sparse representations, Signal Processing, vol.81, issue.11, pp.2353-2362, 2001.
DOI : 10.1016/S0165-1684(01)00120-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.3694

P. G. Georgiev, F. J. Theis, and A. Cichocki, Blind source separation and sparse component analysis for over-complete mixtures, Proc. Int. Conf. Acoust. Speech Signal Process, pp.493-496, 2004.

Y. Li, A. Cichocki, and S. Amari, Sparse component analysis for blind source separation with less sensors than sources, Proc. 4th Int. Symp. Ind. Component Anal, pp.89-94, 2003.

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

D. L. Donoho, M. Elad, and V. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Transactions on Information Theory, vol.52, issue.1, pp.6-18, 2006.
DOI : 10.1109/TIT.2005.860430

E. J. Candès and T. Tao, Decoding by Linear Programming, IEEE Transactions on Information Theory, vol.51, issue.12, pp.4203-4215, 2005.
DOI : 10.1109/TIT.2005.858979

M. A. Figueiredo and R. D. Nowak, An EM algorithm for wavelet-based image restoration, IEEE Transactions on Image Processing, vol.12, issue.8, pp.906-916, 2003.
DOI : 10.1109/TIP.2003.814255

M. A. Figueiredo and R. D. Nowak, A bound optimization approach to wavelet-based image deconvolution, IEEE International Conference on Image Processing 2005, pp.10-1109, 2005.
DOI : 10.1109/ICIP.2005.1530172

M. Elad, Why Simple Shrinkage Is Still Relevant for Redundant Representations?, IEEE Transactions on Information Theory, vol.52, issue.12, pp.5559-5569, 2006.
DOI : 10.1109/TIT.2006.885522

I. F. Gorodnitsky and B. D. Rao, 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

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

R. Gribonval and M. Nielsen, Sparse representations in unions of bases, IEEE Transactions on Information Theory, vol.49, issue.12, pp.3320-3325, 2003.
DOI : 10.1109/TIT.2003.820031
URL : https://hal.archives-ouvertes.fr/inria-00570057

D. L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via ??1 minimization, Proc. Nat. Acad
DOI : 10.1073/pnas.0437847100

H. Mohimani, M. Babaie-zadeh, and C. Jutten, Fast Sparse Representation Based on Smoothed ???0 Norm, Proceedings of 7th International Conference on Independent Component Analysis and Signal Separation (ICA2007), ser. Lecture Notes in Computer Science, pp.389-396, 2007.
DOI : 10.1007/978-3-540-74494-8_49
URL : https://hal.archives-ouvertes.fr/hal-00173357

H. Mohimani, M. Babaie-zadeh, and C. Jutten, A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed <formula formulatype="inline"><tex Notation="TeX">$\ell ^{0}$</tex></formula> Norm, IEEE Transactions on Signal Processing, vol.57, issue.1, pp.289-301, 2009.
DOI : 10.1109/TSP.2008.2007606

E. Van-den, M. P. Berg, and . Friedlander, Probing the Pareto Frontier for Basis Pursuit Solutions, SIAM Journal on Scientific Computing, vol.31, issue.2, pp.890-912, 2008.
DOI : 10.1137/080714488

A. A. Amini, M. Babaie-zadeh, and C. Jutten, A fast method for sparse component analysis based on iterative detection-projection, Proc. AIP Conf, pp.123-130, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00105882

Y. Wang and W. Yin, Sparse Signal Reconstruction via Iterative Support Detection, SIAM Journal on Imaging Sciences, vol.3, issue.3, 2009.
DOI : 10.1137/090772447
URL : http://arxiv.org/abs/0909.4359

R. Ward, Compressed Sensing With Cross Validation, IEEE Transactions on Information Theory, vol.55, issue.12, pp.5773-5782, 2009.
DOI : 10.1109/TIT.2009.2032712

D. M. Malioutov, S. R. Sanghavi, and A. S. Willsky, Sequential Compressed Sensing, IEEE Journal of Selected Topics in Signal Processing, vol.4, issue.2, pp.435-444, 2010.
DOI : 10.1109/JSTSP.2009.2038211

S. Foucart and M. Lai, Sparsest solutions of underdetermined linear systems via -minimization for, Appl. Comput. Harmonic Anal, vol.26, issue.3, pp.397-407, 2009.

M. E. Davies and R. Gribonval, Restricted Isometry Constants Where <formula formulatype="inline"> <tex Notation="TeX">$\ell ^{p}$</tex></formula> Sparse Recovery Can Fail for <formula formulatype="inline"><tex Notation="TeX">$0&#x226A; p \leq 1$</tex></formula>, IEEE Transactions on Information Theory, vol.55, issue.5, pp.2203-2214, 2009.
DOI : 10.1109/TIT.2009.2016030

R. Gribonval, R. M. Figueras, P. Ventura, and . Vandergheynst, A simple test to check the optimality of a sparse signal approximation, Signal Processing, vol.86, issue.3, pp.496-510, 2006.
DOI : 10.1016/j.sigpro.2005.05.026

M. Babaie-zadeh, H. Mohimani, and C. Jutten, An upper bound on the estimation error of the sparsest solution of underdetermined linear systems Matrix Analysis, Proc. Workshop Signal Process. Adaptive Sparse Structured Represent. (SPARS), 1990.

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

B. Wohlberg, Noise sensitivity of sparse signal representations: reconstruction error bounds for the inverse problem, IEEE Transactions on Signal Processing, vol.51, issue.12, pp.3053-3060, 2003.
DOI : 10.1109/TSP.2003.819006

M. Babaie-zadeh and C. Jutten, On the Stable Recovery of the Sparsest Overcomplete Representations in Presence of Noise, IEEE Transactions on Signal Processing, vol.58, issue.10, pp.5396-5400, 2010.
DOI : 10.1109/TSP.2010.2052357
URL : https://hal.archives-ouvertes.fr/hal-00523533

J. J. Fuchs, Recovery of Exact Sparse Representations in the Presence of Bounded Noise, IEEE Transactions on Information Theory, vol.51, issue.10, pp.3601-3608, 2005.
DOI : 10.1109/TIT.2005.855614

J. A. Tropp, Algorithms for simultaneous sparse approximation. Part II: Convex relaxation, Signal Processing, vol.86, issue.3, pp.589-602, 2006.
DOI : 10.1016/j.sigpro.2005.05.031

J. A. Tropp, Just relax: convex programming methods for identifying sparse signals in noise, IEEE Transactions on Information Theory, vol.52, issue.3, pp.1030-1051, 2006.
DOI : 10.1109/TIT.2005.864420

J. A. Tropp, Corrigendum in &#x201C;Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise&#x201D; [Mar 06 1030-1051], IEEE Transactions on Information Theory, vol.55, issue.2, pp.917-918, 2009.
DOI : 10.1109/TIT.2008.2009806

A. Eftekhari, M. Babaie-zadeh, C. Jutten, and H. Abrishami-moghaddam, Robust-SL0 for stable sparse representation in noisy settings, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, pp.3433-3436, 2009.
DOI : 10.1109/ICASSP.2009.4960363
URL : https://hal.archives-ouvertes.fr/hal-00400700

A. Civril and M. Magdon-ismail, On selecting a maximum volume sub-matrix of a matrix and related problems, Theor. Comput. Sci, vol.410, pp.47-49, 2009.

A. Edelman, Eigenvalues and Condition Numbers of Random Matrices, SIAM Journal on Matrix Analysis and Applications, vol.9, issue.4, 1989.
DOI : 10.1137/0609045

K. R. Davidson and S. J. Szarek, Local Operator Theory, Random Matrices and Banach Spaces, Handbook on the Geometry of Banach Spaces, pp.317-366, 2001.
DOI : 10.1016/S1874-5849(01)80010-3

Y. Q. Yin, Z. D. Bai, and P. R. Krishnaiah, On the limit of the largest eigenvalue of the large dimensional sample covariance matrix, Probability Theory and Related Fields, vol.31, issue.2, pp.509-521, 1988.
DOI : 10.1007/BF00353874

S. Geman, A Limit Theorem for the Norm of Random Matrices, The Annals of Probability, vol.8, issue.2, pp.252-261, 1980.
DOI : 10.1214/aop/1176994775

J. W. Silverstein, The Smallest Eigenvalue of a Large Dimensional Wishart Matrix, The Annals of Probability, vol.13, issue.4, pp.1364-1368, 1985.
DOI : 10.1214/aop/1176992819

Z. D. Bai and Y. Q. Yin, Limit of the Smallest Eigenvalue of a Large Dimensional Sample Covariance Matrix, The Annals of Probability, vol.21, issue.3, pp.1275-1294, 1993.
DOI : 10.1214/aop/1176989118

J. Shen, On the singular values of Gaussian random matrices, Linear Algebra and its Applications, vol.326, issue.1-3, pp.1-14, 2001.
DOI : 10.1016/S0024-3795(00)00322-0

E. J. Candès and T. Tao, Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?, IEEE Transactions on Information Theory, vol.52, issue.12, pp.5406-5425, 2006.
DOI : 10.1109/TIT.2006.885507