Issue No. 11 - Nov. (2013 vol. 35)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2013.88
Zhuolin Jiang , Inst. for Adv. Comput. Studies, Univ. of Maryland, College Park, MD, USA
Zhe Lin , Adv. Technol. Labs., Adobe, San Jose, CA, USA
L. S. Davis , Inst. for Adv. Comput. Studies, Univ. of Maryland, College Park, MD, USA
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 consistency 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 overcomplete dictionary and an optimal linear classifier jointly. The incremental dictionary learning algorithm is presented for the situation of limited memory resources. 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, action, scene, and object category recognition under the same learning conditions.
Dictionaries, Linear programming, Classification algorithms, Training, Algorithm design and analysis, Image reconstruction, Testing
Zhuolin Jiang, Zhe Lin and L. S. Davis, "Label Consistent K-SVD: Learning a Discriminative Dictionary for Recognition," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 35, no. 11, pp. 2651-2664, 2013.