Patch Based Face Recognition via Fast Collaborative Representation Based Classification and Expression Insensitive Two-Stage Voting

被引:3
作者
Yang, Decheng [1 ]
Chen, Weiting [1 ]
Wang, Jiangtao [1 ]
Xu, Yan [1 ]
机构
[1] East China Normal Univ, Comp Sci & Software Engn Inst, Shanghai 200062, Peoples R China
来源
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2016, PT II | 2016年 / 9787卷
关键词
Face recognition; Small sample size; Ensemble learning; Collaborative representation;
D O I
10.1007/978-3-319-42108-7_44
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Small sample size (SSS) is one of the most challenging problems in Face Recognition (FR). Recently the collaborative representation based classification with 12-norm regularization (CRC) shows very effective face recognition performance with low computational cost. Patch based CRC (PCRC) also could well handle the SSS problem, and a more effective method is conducted PCRC on different scales with various patch sizes (MSPCRC). However, computation of reconstruction residuals on all patches is still time consuming. In this paper, we devote to improve the performance for SSS problem in face recognition and decrease the computational cost. First, fast collaborative representation based classification (FCRC) is proposed to further decrease the computational cost of CRC. Instead of computing reconstruction residual on all classes, FCRC computes the residual on a small subset of classes which has a big coefficient, such a category full make use of the discrimination of representation coefficients and decrease the computational cost. Our experiments results show that FCRC has a significantly lower computational cost than CRC and slightly outperforms CRC. FCRC is especially powerful when it is applied on patches. To further improve the performance under varying expression, we use a two-stage voting method to combine the recognition outputs of all patches. Extended experiments show that the proposed two-stage voting based FCRC (TSPFCRC) outperforms many state-of-the-art face recognition algorithms and have a significantly lower computational cost.
引用
收藏
页码:562 / 570
页数:9
相关论文
共 19 条
[1]  
[Anonymous], 2008, PROC WORKSHOP FACES
[2]  
[Anonymous], 1998, AR FACE DATABASE
[3]  
[Anonymous], SPARSE REPRESENTATIO
[4]   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
[5]  
Guillaumin M., IS YOU METRIC LEARNI, P498
[6]   Face recognition using Laplacianfaces [J].
He, XF ;
Yan, SC ;
Hu, YX ;
Niyogi, P ;
Zhang, HJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (03) :328-340
[7]  
Kumar R., MAXIMIZING ALL MARGI, P2375
[8]  
Kumar R., VOLTERRAFACES DISCRI, P150
[9]  
Lin D., RECOGNIZE HIGH RESOL, P1355
[10]   Discriminative Multimanifold Analysis for Face Recognition from a Single Training Sample per Person [J].
Lu, Jiwen ;
Tan, Yap-Peng ;
Wang, Gang .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (01) :39-51