暂无分享,去创建一个
[1] D. Donoho. For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .
[2] Christian Jutten,et al. Fast Sparse Representation Based on Smoothed l0 Norm , 2007, ICA.
[3] Christian Jutten,et al. Fast Sparse Representation based on Smoothed � , 2006 .
[4] E. Candes,et al. 11-magic : Recovery of sparse signals via convex programming , 2005 .
[5] Rémi Gribonval,et al. A survey of Sparse Component Analysis for blind source separation: principles, perspectives, and new challenges , 2006, ESANN.
[6] Michael Elad,et al. Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.
[7] C. Jutten,et al. Source Estimation in Noisy Sparse Component Analysis , 2007, 2007 15th International Conference on Digital Signal Processing.
[8] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[9] Mário A. T. Figueiredo,et al. Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.