Abstract
We propose a new method to learn overcomplete dictionaries for sparse coding structured as unions of orthonormal bases. The interest of such a structure is manifold. Indeed, it seems that many signals or images can be modeled as the superimposition of several layers with sparse decompositions in as many bases. Moreover, in such dictionaries, the efficient Block Coordinate Relaxation (BCR) algorithm can be used to compute sparse decompositions. We show that it is possible to design an iterative learning algorithm that produces a dictionary with the required structure. Each step is based on the coefficients estimation, using a variant of BCR, followed by the update of one chosen basis, using Singular Value Decomposition. We assess experimentally how well the learning algorithm recovers dictionaries that may or may not have the required structure, and to what extent the noise level is a disturbing factor. 1.
Keywords
Orthonormal basisSingular value decompositionAlgorithmComputer scienceNeural codingSingular valueBasis (linear algebra)K-SVDPattern recognition (psychology)Artificial intelligenceOrthonormalitySparse approximationMathematicsEigenvalues and eigenvectors
Affiliated Institutions
Related Publications
Atomic Decomposition by Basis Pursuit
The time-frequency and time-scale communities have recently developed a large number of overcomplete waveform dictionaries --- stationary wavelets, wavelet packets, cosine packe...
Using Linear Algebra for Intelligent Information Retrieval
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users’ requests and those in or assigned to docum...
Tensor Decompositions and Applications
This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or N-way array. Decompositions...
Principal component analysis
Abstract Principal component analysis (PCA) is a multivariate technique that analyzes a data table in which observations are described by several inter‐correlated quantitative d...
Uncertainty principles and ideal atomic decomposition
Suppose a discrete-time signal S(t), 0/spl les/t<N, is a superposition of atoms taken from a combined time-frequency dictionary made of spike sequences 1/sub {t=/spl tau/}/ and ...
Publication Info
- Year
- 2006
- Type
- article
- Volume
- 5
- Pages
- 293-296
- Citations
- 126
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
126
OpenAlex
Cite This
Sylvain Lesage,
Rémi Gribonval,
Frédéric Bimbot
et al.
(2006).
Learning Unions of Orthonormal Bases with Thresholded Singular Value Decomposition.
, 5
, 293-296.
https://doi.org/10.1109/icassp.2005.1416298
Identifiers
- DOI
- 10.1109/icassp.2005.1416298