暂无分享,去创建一个
Karthikeyan Natesan Ramamurthy | Andreas Spanias | Jayaraman J. Thiagarajan | Prasanna Sattigeri | P. Sattigeri | K. Ramamurthy | A. Spanias
[1] Michael Elad,et al. Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries , 2006, IEEE Transactions on Image Processing.
[2] Stéphane Mallat,et al. Image modeling and enhancement via structured sparse model selection , 2010, 2010 IEEE International Conference on Image Processing.
[3] Shuicheng Yan,et al. Learning With $\ell ^{1}$-Graph for Image Analysis , 2010, IEEE Transactions on Image Processing.
[4] Karthikeyan Natesan Ramamurthy,et al. Supervised local sparse coding of sub-image features for image retrieval , 2012, 2012 19th IEEE International Conference on Image Processing.
[5] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[6] Thomas S. Huang,et al. Image Super-Resolution Via Sparse Representation , 2010, IEEE Transactions on Image Processing.
[7] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[8] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[9] Michael Elad,et al. Why Simple Shrinkage Is Still Relevant for Redundant Representations? , 2006, IEEE Transactions on Information Theory.
[10] Michael Elad,et al. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[11] Michael Elad,et al. Sparse and Redundant Representations - From Theory to Applications in Signal and Image Processing , 2010 .
[12] Thomas G. Dietterich. Multiple Classifier Systems , 2000, Lecture Notes in Computer Science.
[13] Yihong Gong,et al. Linear spatial pyramid matching using sparse coding for image classification , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[14] Michael Elad,et al. A Plurality of Sparse Representations Is Better Than the Sparsest One Alone , 2009, IEEE Transactions on Information Theory.
[15] S. Frick,et al. Compressed Sensing , 2014, Computer Vision, A Reference Guide.
[16] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.
[17] Ke Huang,et al. Sparse Representation for Signal Classification , 2006, NIPS.
[18] Thomas S. Huang,et al. Image super-resolution as sparse representation of raw image patches , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[19] 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.
[20] Sergei Vassilvitskii,et al. Scalable K-Means++ , 2012, Proc. VLDB Endow..
[21] Yoav Freund,et al. A Short Introduction to Boosting , 1999 .
[22] Rajat Raina,et al. Efficient sparse coding algorithms , 2006, NIPS.
[23] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[24] Thomas G. Dietterich. An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization , 2000, Machine Learning.
[25] Guillermo Sapiro,et al. Supervised Dictionary Learning , 2008, NIPS.
[26] Michael Elad,et al. A wide-angle view at iterated shrinkage algorithms , 2007, SPIE Optical Engineering + Applications.
[27] Guillermo Sapiro,et al. Online dictionary learning for sparse coding , 2009, ICML '09.
[28] B. Rao,et al. Forward sequential algorithms for best basis selection , 1999 .
[29] Andreas Spanias,et al. Multilevel dictionary learning for sparse representation of images , 2011, 2011 Digital Signal Processing and Signal Processing Education Meeting (DSP/SPE).
[30] David P. Helmbold,et al. Boosting Methods for Regression , 2002, Machine Learning.
[31] Bhaskar D. Rao,et al. Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..
[32] Allen Y. Yang,et al. Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[33] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .
[34] R. Tibshirani,et al. Least angle regression , 2004, math/0406456.
[35] Jayaraman J. Thiagarajan,et al. Sparse representations for automatic target classification in SAR images , 2010, 2010 4th International Symposium on Communications, Control and Signal Processing (ISCCSP).
[36] R. Polikar,et al. Ensemble based systems in decision making , 2006, IEEE Circuits and Systems Magazine.
[37] Baoxin Li,et al. Discriminative K-SVD for dictionary learning in face recognition , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[38] Karthikeyan Natesan Ramamurthy,et al. Sparse Representations for Pattern Classification using Learned Dictionaries , 2008, SGAI Conf..
[39] René Vidal,et al. Sparse Subspace Clustering: Algorithm, Theory, and Applications , 2012, IEEE transactions on pattern analysis and machine intelligence.
[40] Ying Zhang,et al. Boosted Learning of Visual Word Weighting Factors for Bag-of-Features Based Medical Image Retrieval , 2011, 2011 Sixth International Conference on Image and Graphics.
[41] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[42] Andreas Spanias,et al. Learning dictionaries for local sparse coding in image classification , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).
[43] Thomas G. Dietterich,et al. Learning non-redundant codebooks for classifying complex objects , 2009, ICML '09.
[44] David J. Field,et al. What Is the Goal of Sensory Coding? , 1994, Neural Computation.