Random projection-based partial feature extraction for robust face recognition

被引:11
作者
Ma, Chunfei [1 ]
Jung, June-Young [1 ]
Kim, Seung-Wook [1 ]
Ko, Sung-Jea [1 ]
机构
[1] Korea Univ, Dept Elect Engn, Seoul 136713, South Korea
基金
新加坡国家研究基金会;
关键词
Face recognition; Feature extraction; Robustness; Random projection; Compressed sensing; FRAMEWORK; PATTERNS;
D O I
10.1016/j.neucom.2014.09.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a novel feature extraction method for robust face recognition (FR) is proposed. The proposed method combines a simple yet effective dimensionality increasing (DI) method with an information-preserving dimensionality reduction (DR) method. For the proposed DI method, we employ the rectangle filters which sum the pixel values within a randomized rectangle window on the face image to extract the feature. By convolving the face image with all possible rectangle filters having various locations and scales. the face image in the image space is projected to a very high-dimensional feature space where more discriminative information can be incorporated. In order to significantly reduce the computational complexity while preserving the most informative features, we adopt a random projection method based on the compressed sensing theory for DR. Unlike the traditional holistic-based feature extraction methods requiring the time-consuming data-dependent training procedure, the proposed method has the partial-based and data-independent properties. Extensive experimental results on representative FR databases show that, as compared with conventional feature extraction methods, our proposed method not only achieves the higher recognition accuracy but also shows better robustness to corruption, occlusion, and disguise. (c) 2014 Elsevier B.V All rights reserved.
引用
收藏
页码:1232 / 1244
页数:13
相关论文
共 45 条
[1]   Face description with local binary patterns:: Application to face recognition [J].
Ahonen, Timo ;
Hadid, Abdenour ;
Pietikainen, Matti .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (12) :2037-2041
[2]  
[Anonymous], 2001, P S PRINC DAT SYST
[3]  
[Anonymous], 2006, P 12 ACM SIGKDD INT, DOI 10.1145/1150402.1150436
[4]  
[Anonymous], 2007, Tech. Rep. 07-49
[5]  
Baraniuk R.G., 2007, Foundations of Computational Mathematics, V9, P51
[6]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[7]   Face recognition by independent component analysis [J].
Bartlett, MS ;
Movellan, JR ;
Sejnowski, TJ .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2002, 13 (06) :1450-1464
[8]   Lambertian reflectance and linear subspaces [J].
Basri, R ;
Jacobs, DW .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (02) :218-233
[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]  
Bingham E., 2001, KDD-2001. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P245, DOI 10.1145/502512.502546