A Locality-Constrained and Label Embedding Dictionary Learning Algorithm for Image Classification

被引:167
作者
Li, Zhengming [1 ,2 ]
Lai, Zhihui [3 ]
Xu, Yong [1 ]
Yang, Jian [4 ]
Zhang, David [5 ]
机构
[1] Harbin Inst Technol, Shenzhen Grad Sch, Biocomp Res Ctr, Shenzhen 518055, Peoples R China
[2] Guangdong Polytech Normal Univ, Ind Training Ctr, Guangzhou 510665, Guangdong, Peoples R China
[3] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[4] Nanjing Univ Sci & Technol, Sch Comp Sci, Nanjing 210094, Jiangsu, Peoples R China
[5] Hong Kong Polytech Univ, Dept Comp, Biometr Res Ctr, Hong Kong, Hong Kong, Peoples R China
关键词
Dictionary learning; label embedding; locality constrained; profile; sparse coding; SPARSE REPRESENTATION; OVERCOMPLETE DICTIONARIES; DISCRIMINATIVE DICTIONARY; FACE RECOGNITION; ILLUMINATION;
D O I
10.1109/TNNLS.2015.2508025
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Locality and label information of training samples play an important role in image classification. However, previous dictionary learning algorithms do not take the locality and label information of atoms into account together in the learning process, and thus their performance is limited. In this paper, a discriminative dictionary learning algorithm, called the locality constrained and label embedding dictionary learning (LCLE-DL) algorithm, was proposed for image classification. First, the locality information was preserved using the graph Laplacian matrix of the learned dictionary instead of the conventional one derived from the training samples. Then, the label embedding term was constructed using the label information of atoms instead of the classification error term, which contained discriminating information of the learned dictionary. The optimal coding coefficients derived by the locality-based and label-based reconstruction were effective for image classification. Experimental results demonstrated that the LCLE-DL algorithm can achieve better performance than some state-of-the-art algorithms.
引用
收藏
页码:278 / 293
页数:16
相关论文
共 43 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], 1998, TECH REP
[3]  
[Anonymous], 2005, ICML
[4]  
[Anonymous], 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition, DOI DOI 10.1109/CVPR.2008.4587408
[5]  
Arpit D, 2012, INT C PATT RECOG, P1687
[6]   Orthogonal laplacianfaces for face recognition [J].
Cai, Deng ;
He, Xiaofei ;
Han, Jiawei ;
Zhang, Hong-Jiang .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (11) :3608-3614
[7]  
Chen Y, 2011, PROC CVPR IEEE, P569, DOI 10.1109/CVPR.2011.5995400
[8]   Sparse representation and learning in visual recognition: Theory and applications [J].
Cheng, Hong ;
Liu, Zicheng ;
Yang, Lu ;
Chen, Xuewen .
SIGNAL PROCESSING, 2013, 93 (06) :1408-1425
[9]   Sparse and Redundant Representation Modeling-What Next? [J].
Elad, Michael .
IEEE SIGNAL PROCESSING LETTERS, 2012, 19 (12) :922-928
[10]  
Fei-Fei L, 2004, Workshop on Generative Model Based Vision, P178, DOI 10.1109/CVPR.2004.383