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

Citations Over TimeTop 1% of 2011 papers

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.

Related Papers

• → Geometry constrained sparse coding for single image super-resolution(2012)99 cited
• → Double sparse dictionary learning for image super resolution(2016)3 cited
• → A decomposition method for large-scale sparse coding in representation learning(2014)4 cited
• → Image representation via sub-dictionary based sparse coding(2016)
• → Letter from Prof. Kirchhoff on the chemical analysis of the solar atmosphere(1862)