Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-3415, 1993. ,
DOI : 10.1109/78.258082
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.5769
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
A survey of sparse component analysis for blind source separation: principles, perspectives, and new challenges, Proceedings of ESANN'06, pp.323-330, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00544897
Decoding by Linear Programming, IEEE Transactions on Information Theory, vol.51, issue.12, pp.4203-4215, 2005. ,
DOI : 10.1109/TIT.2005.858979
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
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.8604
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
Robust face recognition via sparse representation, IEEE Transaction on Pattern Analysis and Machine Intelligence, issue.2, pp.210-227, 2009. ,
DOI : 10.1109/tpami.2008.79
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.4658
Optimally sparse representation in general (nonorthogonal) dictionaries via ??1 minimization, Proceedings of the National Academy of Sciences, vol.100, issue.5, pp.2197-2202, 2003. ,
DOI : 10.1073/pnas.0437847100
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
For most large underdetermined systems of linear equations the minimal ???1-norm solution is also the sparsest solution, Communications on Pure and Applied Mathematics, vol.50, issue.6, 2004. ,
DOI : 10.1002/cpa.20132
Fast sparse representation based on smoothed l0 norm, Proceedings of ICA'07, pp.389-396, 2007. ,
DOI : 10.1007/978-3-540-74494-8_49
URL : https://hal.archives-ouvertes.fr/hal-00173357
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