Atomic Decomposition by Basis Pursuit, SIAM Review, vol.43, issue.1, pp.129-59, 2001. ,
DOI : 10.1137/S003614450037906X
Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-3415, 1993. ,
DOI : 10.1109/78.258082
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
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
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 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
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
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
The Matrix Cookbook, 2008. ,