Learning a discriminative dictionary for sparse coding via label consistent K-SVD
University of Maryland, College Park · Adobe Systems (United States)
Abstract
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also associate label information with each dictionary item (columns of the dictionary matrix) to enforce discriminability in sparse codes during the dictionary learning process. More specifically, we introduce a new label consistent constraint called `discriminative sparse-code error' and combine it with the reconstruction error and the classification error to form a unified objective function. The optimal solution is efficiently obtained using the K-SVD algorithm. Our algorithm learns a single over-complete dictionary and an optimal linear…
Citation impact
- FWCI
- 75.71
- Percentile
- 100%
- References
- 52
Authors
3Topics & keywords
- K-SVD
- Discriminative model
- Neural coding
- Pattern recognition (psychology)
- Computer science
- Artificial intelligence
- Dictionary learning
- Sparse approximation
- Reduced inequalities