A clustering approach to optimize online dictionary learning
暂无分享,去创建一个
[1] Dorin Comaniciu,et al. Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[2] Shie Mannor,et al. The Sample Complexity of Dictionary Learning , 2010, COLT.
[3] Paul D. Gader,et al. EK-SVD: Optimized dictionary design for sparse representations , 2008, 2008 19th International Conference on Pattern Recognition.
[4] Guillermo Sapiro,et al. Sparse Modeling with Universal Priors and Learned Incoherent Dictionaries(PREPRINT) , 2009 .
[5] D. Freedman,et al. Fast Mean Shift by compact density representation , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[6] Andreas Krause,et al. Submodular Dictionary Selection for Sparse Representation , 2010, ICML.
[7] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.
[8] Mike E. Davies,et al. Dictionary Learning for Sparse Approximations With the Majorization Method , 2009, IEEE Transactions on Signal Processing.
[9] Michael Elad,et al. Image Denoising Via Learned Dictionaries and Sparse representation , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[10] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .
[11] Guillermo Sapiro,et al. Online Learning for Matrix Factorization and Sparse Coding , 2009, J. Mach. Learn. Res..
[12] Mike E. Davies,et al. Regularized dictionary learning for sparse approximation , 2008, 2008 16th European Signal Processing Conference.
[13] Alexander G. Gray,et al. Fast Mean Shift with Accurate and Stable Convergence , 2007, AISTATS.