A New Discriminative Sparse Representation Method for Robust Face Recognition via l2 Regularization

被引:142
作者
Xu, Yong [1 ,2 ]
Zhong, Zuofeng [1 ]
Yang, Jian [3 ]
You, Jane [4 ]
Zhang, David [4 ]
机构
[1] Harbin Inst Technol, Shenzhen Grad Sch, Biocomp Res Ctr, Shenzhen 518055, Peoples R China
[2] Key Lab Network Oriented Intelligent Computat, Shenzhen 518055, Peoples R China
[3] Nanjing Univ Sci Sci & Technol, Sch Comp Sci & Technol, Nanjing 210094, Jiangsu, Peoples R China
[4] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Efficient computation; face recognition; l(2) regularization; sparse representation; K-SVD; DICTIONARY; ALGORITHMS;
D O I
10.1109/TNNLS.2016.2580572
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sparse representation has shown an attractive performance in a number of applications. However, the available sparse representation methods still suffer from some problems, and it is necessary to design more efficient methods. Particularly, to design a computationally inexpensive, easily solvable, and robust sparse representation method is a significant task. In this paper, we explore the issue of designing the simple, robust, and powerfully efficient sparse representation methods for image classification. The contributions of this paper are as follows. First, a novel discriminative sparse representation method is proposed and its noticeable performance in image classification is demonstrated by the experimental results. More importantly, the proposed method outperforms the existing state-of-the-art sparse representation methods. Second, the proposed method is not only very computationally efficient but also has an intuitive and easily understandable idea. It exploits a simple algorithm to obtain a closed-form solution and discriminative representation of the test sample. Third, the feasibility, computational efficiency, and remarkable classification accuracy of the proposed l(2) regularization-based representation are comprehensively shown by extensive experiments and analysis. The code of the proposed method is available at http://www.yongxu.org/lunwen.html.
引用
收藏
页码:2233 / 2242
页数:10
相关论文
共 46 条
[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], COMMUN ACM
[3]  
[Anonymous], 2008, 2008 IEEE C COMP VIS, DOI DOI 10.1109/CVPR.2008.4587369
[4]  
[Anonymous], 2008, 2008 IEEE C COMP VIS, DOI DOI 10.1109/CVPR.2008.4587652
[5]  
[Anonymous], 2010, P 27 INT C INT C MAC
[6]  
[Anonymous], L1 LS SIMPLE MATLAB
[7]   IEEE-SPS and connexions - An open access education collaboration [J].
Baraniuk, Richard G. ;
Burrus, C. Sidney ;
Thierstein, E. Joel .
IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (06) :6-+
[8]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[9]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[10]  
Dong WS, 2011, PROC CVPR IEEE, P457, DOI 10.1109/CVPR.2011.5995478