In Defense of Sparsity Based Face Recognition

被引:150
作者
Deng, Weihong [1 ]
Hu, Jiani [1 ]
Guo, Jun [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Beijing 100876, Peoples R China
来源
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2013年
关键词
REPRESENTATION;
D O I
10.1109/CVPR.2013.58
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The success of sparse representation based classification (SRC) has largely boosted the research of sparsity based face recognition in recent years. A prevailing view is that the sparsity based face recognition performs well only when the training images have been carefully controlled and the number of samples per class is sufficiently large. This paper challenges the prevailing view by proposing a "prototype plus variation" representation model for sparsity based face recognition. Based on the new model, a Superposed SRC (SSRC), in which the dictionary is assembled by the class centroids and the sample-to-centroid differences, leads to a substantial improvement on SRC. The experiments results on AR, FERET and FRGC databases validate that, if the proposed prototype plus variation representation model is applied, sparse coding plays a crucial role in face recognition, and performs well even when the dictionary bases are collected under uncontrolled conditions and only a single sample per classes is available.
引用
收藏
页码:399 / 406
页数:8
相关论文
共 21 条
[1]  
[Anonymous], CVPR
[2]  
[Anonymous], ICCV
[3]  
[Anonymous], CVPR
[4]  
[Anonymous], 2012, CVPR
[5]  
[Anonymous], CVPR
[6]  
[Anonymous], CVPR
[7]  
Chao Y. W., 2011, ICIP
[8]   Extended SRC: Undersampled Face Recognition via Intraclass Variant Dictionary [J].
Deng, Weihong ;
Hu, Jiani ;
Guo, Jun .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (09) :1864-1870
[9]   Fast Solution of l1-Norm Minimization Problems When the Solution May Be Sparse [J].
Donoho, David L. ;
Tsaig, Yaakov .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (11) :4789-4812
[10]  
Huang J., 2008, CVPR