Regularized low-coherence overcomplete dictionary learning for sparse signal decomposition
暂无分享,去创建一个
[1] Mark D. Plumbley,et al. Learning Incoherent Dictionaries for Sparse Approximation Using Iterative Projections and Rotations , 2013, IEEE Transactions on Signal Processing.
[2] Yoram Singer,et al. Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.
[3] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[4] Michael Elad,et al. Improving Dictionary Learning: Multiple Dictionary Updates and Coefficient Reuse , 2013, IEEE Signal Processing Letters.
[5] Christian Jutten,et al. A new algorithm for learning overcomplete dictionaries , 2013, 21st European Signal Processing Conference (EUSIPCO 2013).
[6] E.J. Candes,et al. An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.
[7] Stephen P. Boyd,et al. Proximal Algorithms , 2013, Found. Trends Optim..
[8] Nazanin Rahnavard,et al. Union of low-rank subspaces detector , 2013, IET Signal Process..
[9] Xiaoming Huo,et al. Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.
[10] Christian Jutten,et al. Dictionary Learning for Sparse Representation: A Novel Approach , 2013, IEEE Signal Processing Letters.
[11] 24th European Signal Processing Conference, EUSIPCO 2016, Budapest, Hungary, August 29 - September 2, 2016 , 2016, European Signal Processing Conference.
[12] Christian Jutten,et al. Learning Overcomplete Dictionaries Based on Atom-by-Atom Updating , 2014, IEEE Transactions on Signal Processing.
[13] Michael Elad,et al. Dictionaries for Sparse Representation Modeling , 2010, Proceedings of the IEEE.
[14] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[15] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[16] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .
[17] Zuowei Shen,et al. Dictionary Learning for Sparse Coding: Algorithms and Convergence Analysis , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[18] Mark D. Plumbley,et al. INK-SVD: Learning incoherent dictionaries for sparse representations , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[19] Jorge Nocedal,et al. On the limited memory BFGS method for large scale optimization , 1989, Math. Program..
[20] Joachim M. Buhmann,et al. Learning Dictionaries With Bounded Self-Coherence , 2012, IEEE Signal Processing Letters.
[21] Stephen J. Wright,et al. Computational Methods for Sparse Solution of Linear Inverse Problems , 2010, Proceedings of the IEEE.
[22] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.
[23] Thomas Strohmer,et al. GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.