Learning Linear, Sparse, Factorial Codes
In previous work (Olshausen & Field 1996), an algorithm was described for learning linear sparse codes which, when trained on natural images, produces a set of basis functions that are spatially localized, oriented, and bandpass (i.e., wavelet-like). This note shows how the algorithm may b...
Main Author: | Olshausen, Bruno A. |
---|---|
Language: | en_US |
Published: |
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/7184 |
Similar Items
-
Concurrent Single-Label Image Classification and Annotation via Efficient Multi-Layer Group Sparse Coding
by: Gao, Shenghua, et al.
Published: (2016) -
An Equivalence Between Sparse Approximation and Support Vector Machines
by: Girosi, Federico
Published: (2004) -
Rate-distortion optimized sparse coding with ordered dictionary for image set compression
by: Zhang, Xinfeng, et al.
Published: (2020) -
Decoding sparse Reed-Solomon codes with known support
by: Kim, Wilton, et al.
Published: (2024) -
Slice-based online convolutional dictionary learning
by: Zeng, Yijie, et al.
Published: (2022)