Learning a discriminative dictionary for sparse coding via label consistent K-SVD

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 classifier jointly. It yields dictionaries so that feature points with the same class labels have similar sparse codes. Experimental results demonstrate that our algorithm outperforms many recently proposed sparse coding techniques for face and object category recognition under the same learning conditions.

DOI: 10.1109/CVPR.2011.5995354

Extracted Key Phrases

7 Figures and Tables

0501002011201220132014201520162017
Citations per Year

528 Citations

Semantic Scholar estimates that this publication has 528 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Jiang2011LearningAD, title={Learning a discriminative dictionary for sparse coding via label consistent K-SVD}, author={Zhuolin Jiang and Zhe L. Lin and Larry S. Davis}, booktitle={CVPR}, year={2011} }