Learning Efficient Data Representations With Orthogonal Sparse Coding
We present the learning algorithm orthogonal sparse coding (OSC) to find an orthogonal basis in which a given data set has a maximally sparse representation. OSC is based on stochastic descent by Hebbian like updates and Gram Schmidt orthogonalizations, and is motivated by an algorithm that we introduce as the canonical approach (CA) First, we evaluate how well OSC can recover a generating basis from synthetic data. We show that, in contrast to competing methods, OSC can recover the generating basis for quite low and, remarkably, unknown sparsity levels. Moreover, on natural image patches and on images of handwritten digits, OSC learns orthogonal bases that attain significantly sparser representations compared to alternative orthogonal transforms. Furthermore, we demonstrate an application of OSC for image compression by showing that the rate distortion performance can be improved relative to the JPEG standard. Finally, we demonstrate the state of the art image denoising performance of OSC dictionaries. Our results demonstrate the potential of OSC for feature extraction, data compression, and image denoising, which is due to two important aspects: (1) the learned bases are adapted to the signal class, and (2) the sparse approximation problem can be solved efficiently and exactly.
IEEE Transactions on Computational Imaging