论文信息 - Unsupervised Learning of Feature Hierarchies - 字舞流文

Unsupervised Learning of Feature Hierarchies

Koray Kavukcuoglu | K. Kavukcuoglu

[1] Michael Elad,et al. From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

[2] Rajat Raina,et al. Efficient sparse coding algorithms , 2006, NIPS.

[3] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[4] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[5] Terrence J. Sejnowski,et al. Learning Overcomplete Representations , 2000, Neural Computation.

[6] Bhaskar D. Rao,et al. Sparse basis selection, ICA, and majorization: towards a unified perspective , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[7] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[8] David J. Field,et al. Sparse coding with an overcomplete basis set: A strategy employed by V1? , 1997, Vision Research.

[9] D. Field,et al. Natural image statistics and efficient coding. , 1996, Network.

[10] Terrence J. Sejnowski,et al. An Information-Maximization Approach to Blind Separation and Blind Deconvolution , 1995, Neural Computation.