Semi-random subspace method for face recognition

The small sample size (SSS) and the sensitivity to variations such as illumination, expression and occlusion are two challenging problems in face recognition. In this paper, we propose a novel method, called semi-random subspace (Semi-RS), to simultaneously address the two problems. Different from the traditional random subspace method (RSM) which samples features from the whole pattern feature set in a completely random way, the proposed Semi-RS randomly samples features on each local region (or a sub-image) partitioned from the original face image. More specifically, we first divide a face image into several sub-images in a deterministic way, then construct a set of base classifiers on different randomly sampled feature sets from each sub-image set, and finally combine all base classifiers for the final decision. Experimental results on five face databases (AR, Extended YALE, FERET, Yale and ORL) show that the proposed Semi-RS method is effective, relatively robust to illumination and occlusion, etc., and also suitable to slight variations in pose angle and the scenario of one training sample per person. In addition, kappa-error diagram, which is used to analyze the diversity of algorithm, reveals that Semi-RS constructs more diverse base classifiers than other methods, and also explains why Semi-RS can yield better performance than RSM and V-SpPCA.

[1]  Bruce A. Draper,et al.  The CSU Face Identification Evaluation System , 2005, Machine Vision and Applications.

[2]  A. Martínez,et al.  The AR face databasae , 1998 .

[3]  John Shawe-Taylor,et al.  Canonical Correlation Analysis: An Overview with Application to Learning Methods , 2004, Neural Computation.

[4]  Xiaogang Wang,et al.  Random Sampling for Subspace Face Recognition , 2006, International Journal of Computer Vision.

[5]  Xiaogang Wang,et al.  Random sampling LDA for face recognition , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[6]  Hideaki Tanaka,et al.  Low frequency band monitoring method for PMD compensation , 2002 .

[7]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[8]  David J. Kriegman,et al.  Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection , 1996, ECCV.

[9]  Yunde Jia,et al.  A linear discriminant analysis framework based on random subspace for face recognition , 2007, Pattern Recognit..

[10]  Thomas G. Dietterich,et al.  Pruning Adaptive Boosting , 1997, ICML.

[11]  Zhi-Hua Zhou,et al.  Face recognition from a single image per person: A survey , 2006, Pattern Recognit..

[12]  Songcan Chen,et al.  Adaptively weighted sub-pattern PCA for face recognition , 2005, Neurocomputing.

[13]  Aleix M. Martinez,et al.  The AR face database , 1998 .

[14]  Vijayan K. Asari,et al.  An improved face recognition technique based on modular PCA approach , 2004, Pattern Recognit. Lett..

[15]  Yulian Zhu,et al.  Subpattern-based principle component analysis , 2004, Pattern Recognit..

[16]  Anuj Srivastava,et al.  Face recognition using optimal linear components of range images , 2006, Image Vis. Comput..

[17]  Xiaogang Wang,et al.  Subspace analysis using random mixture models , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[18]  Keinosuke Fukunaga,et al.  Introduction to Statistical Pattern Recognition , 1972 .

[19]  Hua Yu,et al.  A direct LDA algorithm for high-dimensional data - with application to face recognition , 2001, Pattern Recognit..

[20]  Cuiping Zhang,et al.  MMP-PCA face recognition method , 2002 .

[21]  Pavel Pudil,et al.  Introduction to Statistical Pattern Recognition , 2006 .

[22]  Alex Pentland,et al.  View-based and modular eigenspaces for face recognition , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[23]  Xuelong Li,et al.  Asymmetric bagging and random subspace for support vector machines-based relevance feedback in image retrieval , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Kagan Tumer,et al.  Error Correlation and Error Reduction in Ensemble Classifiers , 1996, Connect. Sci..

[25]  Yang Yu,et al.  Ensembling local learners ThroughMultimodal perturbation , 2005, IEEE Trans. Syst. Man Cybern. Part B.

[26]  Daoqiang Zhang,et al.  A new face recognition method based on SVD perturbation for single example image per person , 2005, Appl. Math. Comput..

[27]  Juan José Rodríguez Diez,et al.  Rotation Forest: A New Classifier Ensemble Method , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[28]  Tin Kam Ho,et al.  The Random Subspace Method for Constructing Decision Forests , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  David J. Kriegman,et al.  Acquiring linear subspaces for face recognition under variable lighting , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[30]  H. Sebastian Seung,et al.  Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[31]  Xiaolong Teng,et al.  Face recognition using discriminant locality preserving projections , 2006, Image Vis. Comput..

[32]  Bruce A. Draper,et al.  The CSU Face Identification Evaluation System: Its Purpose, Features, and Structure , 2003, ICVS.

[33]  Keinosuke Fukunaga,et al.  Introduction to statistical pattern recognition (2nd ed.) , 1990 .

[34]  R. Chellappa.  Introduction of New Editor-in-Chief , 2005 .

[35]  Harry Wechsler,et al.  The FERET database and evaluation procedure for face-recognition algorithms , 1998, Image Vis. Comput..

[36]  Nitesh V. Chawla,et al.  Random subspaces and subsampling for 2-D face recognition , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).