暂无分享,去创建一个
[1] Joel A. Tropp,et al. Topics in sparse approximation , 2004 .
[2] Eric P. Xing,et al. Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity , 2009, ICML.
[3] Chih-Jen Lin,et al. LIBLINEAR: A Library for Large Linear Classification , 2008, J. Mach. Learn. Res..
[4] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[5] Marc'Aurelio Ranzato,et al. Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition , 2010, ArXiv.
[6] Cordelia Schmid,et al. Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[7] Guillermo Sapiro,et al. Non-local sparse models for image restoration , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[8] Yihong Gong,et al. Linear spatial pyramid matching using sparse coding for image classification , 2009, CVPR.
[9] M. Maggioni,et al. Multiscale Geometric Methods for Data Sets II: Geometric Multi-Resolution Analysis , 2011, 1105.4924.
[10] Yann LeCun,et al. Learning Fast Approximations of Sparse Coding , 2010, ICML.
[11] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.
[12] Junzhou Huang,et al. Learning with structured sparsity , 2009, ICML '09.
[13] J SchulmanLeonard,et al. The effectiveness of lloyd-type methods for the k-means problem , 2013 .
[14] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.
[15] Sanjoy Dasgupta,et al. Random projection trees and low dimensional manifolds , 2008, STOC.
[16] Nicolas Le Roux,et al. Ask the locals: Multi-way local pooling for image recognition , 2011, 2011 International Conference on Computer Vision.
[17] Jean-Philippe Vert,et al. Group lasso with overlap and graph lasso , 2009, ICML '09.
[18] Guillermo Sapiro,et al. Classification and clustering via dictionary learning with structured incoherence and shared features , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[19] Jean Ponce,et al. Learning mid-level features for recognition , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[20] David J. Field,et al. Emergence of simple-cell receptive field properties by learning a sparse code for natural images , 1996, Nature.
[21] Julien Mairal,et al. Proximal Methods for Sparse Hierarchical Dictionary Learning , 2010, ICML.
[22] G. Griffin,et al. Caltech-256 Object Category Dataset , 2007 .
[23] Hans-Peter Kriegel,et al. Subspace clustering , 2012, WIREs Data Mining Knowl. Discov..
[24] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .
[25] Joel A. Tropp,et al. Simultaneous sparse approximation via greedy pursuit , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..
[26] Liang-Tien Chia,et al. Local features are not lonely – Laplacian sparse coding for image classification , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[27] Thomas S. Huang,et al. Efficient Highly Over-Complete Sparse Coding Using a Mixture Model , 2010, ECCV.
[28] Y. C. Pati,et al. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.
[29] Volkan Cevher,et al. Model-Based Compressive Sensing , 2008, IEEE Transactions on Information Theory.