Face recognition algorithm based on feature descriptor and weighted linear sparse representation

被引:5
作者
Liao, Mengmeng [1 ]
Gu, Xiaodong [1 ]
机构
[1] Fudan Univ, Dept Elect Engn, Shanghai 200433, Peoples R China
基金
中国国家自然科学基金;
关键词
feature extraction; principal component analysis; image representation; face recognition; distinctive feature descriptor; named logarithmic-weighted sum; face recognition algorithm; weighted linear sparse representation; real-time recognition; recognition rate; sparse-based methods; sparse representation classifier; good recognition result; query samples; different atoms; sparse-weighted representation classifier; different importance; LEAST-SQUARES; SUBSPACE; DEFENSE; PCA;
D O I
10.1049/iet-ipr.2018.5263
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Generally, the commonly used sparse-based methods, such as sparse representation classifier, have achieved a good recognition result in face recognition. However, there exist several problems in those methods. First, those methods think that the importance of each atom is the same in representing other query samples. This is not reasonable because different atoms contain different amounts of information, their importance should be different when they together represent the query samples. Second, those methods cannot meet the real-time requirement when dealing with large data set. In this study, on the one hand, the authors propose a fast extended sparse-weighted representation classifier (FESWRC) by considering the different importance of atoms and using primal augmented Lagrangian method as well as principal component analysis. On the other hand, the authors propose a distinctive feature descriptor, named logarithmic-weighted sum (LWS) feature descriptor. The authors combine FESWRC and LWS and used for face recognition, this method is called face recognition algorithm based on feature descriptor and weighted linear sparse representation (FDWLSR). Experimental results show that FDWLSR can realise real-time recognition and the recognition rate can achieve 100.0, 100.0, 91.6, 93.4 and 87.4%, respectively, on the Yale, Olivetti Research Laboratory (ORL), faculdade de engenharia industrial (FEI), face recognition technology program (FERET) and labelled face in the wild datasets.
引用
收藏
页码:2281 / 2293
页数:13
相关论文
共 53 条
[1]   Principal component analysis [J].
Abdi, Herve ;
Williams, Lynne J. .
WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2010, 2 (04) :433-459
[2]  
[Anonymous], BAHRIA U J INF COMMU
[3]  
[Anonymous], P 2014 IEEE INT C CO
[4]  
[Anonymous], COMPUT PHYS
[5]  
[Anonymous], 1983, SOV MATH DOKL
[6]   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
[7]   NESTA: A Fast and Accurate First-Order Method for Sparse Recovery [J].
Becker, Stephen ;
Bobin, Jerome ;
Candes, Emmanuel J. .
SIAM JOURNAL ON IMAGING SCIENCES, 2011, 4 (01) :1-39
[8]   Templates for convex cone problems with applications to sparse signal recovery [J].
Becker S.R. ;
Candès E.J. ;
Grant M.C. .
Mathematical Programming Computation, 2011, 3 (3) :165-218
[9]   In defense of Nearest-Neighbor based image classification [J].
Boiman, Oren ;
Shechtman, Eli ;
Irani, Michal .
2008 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-12, 2008, :1992-+
[10]   Subpattern-based principle component analysis [J].
Chen, SC ;
Zhu, YL .
PATTERN RECOGNITION, 2004, 37 (05) :1081-1083