Maximum–minimum–median average MSD-based approach for face recognition

Abstract A new and efficient improved maximum scatter difference (MSD) model is introduced in this paper. The main weakness of the MSD model is that the class mean vector is constructed via class sample average when the within-class and between-class scatter matrices are formed. For a few of given samples with non-ideal conditions (e.g., variations of expression, pose and noisy environment), the assessment result is very weak by using the class sample average. That is because there will be some outliers in these samples. Therefore, the recognition performance of maximum scatter difference criterion will decline significantly. To solve the problem, in the traditional MSD model, we use within-class maximum–minimum–median average vector to construct within-class scatter matrix ( S w ) and between-class scatter matrix ( S b ) instead of within-class mean vector. The experimental results show that an improvement of the MSD model is possible with the proposed technique in ORL and Yale face database recognition problems.

[1]  Patrick J. Flynn,et al.  Overview of the face recognition grand challenge , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[2]  Jianqiang Gao,et al.  Median null(Sw)-based method for face feature recognition , 2013, Appl. Math. Comput..

[3]  Azriel Rosenfeld,et al.  Face recognition: A literature survey , 2003, CSUR.

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

[5]  Tao Zhang,et al.  Median MSD-based method for face recognition , 2009, Neurocomputing.

[6]  Ja-Chen Lin,et al.  A new LDA-based face recognition system which can solve the small sample size problem , 1998, Pattern Recognit..

[7]  Jianguo Wang,et al.  Kernel maximum scatter difference based feature extraction and its application to face recognition , 2008, Pattern Recognit. Lett..

[8]  Tao Zhang,et al.  Weighted maximum scatter difference based feature extraction and its application to face recognition , 2010, Machine Vision and Applications.

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

[10]  Jian Yang,et al.  Essence of kernel Fisher discriminant: KPCA plus LDA , 2004, Pattern Recognit..

[11]  Song Feng,et al.  Maximum Scatter Difference,Large Margin Linear Projection and Support Vector Machines , 2004 .

[12]  Jian Yang,et al.  Median LDA: A Robust Feature Extraction Method for Face Recognition , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[13]  Jian Yang,et al.  Why can LDA be performed in PCA transformed space? , 2003, Pattern Recognit..

[14]  Lizhong Xu,et al.  A practical application of kernel-based fuzzy discriminant analysis , 2013, Int. J. Appl. Math. Comput. Sci..

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

[16]  Hanqing Lu,et al.  Improving kernel Fisher discriminant analysis for face recognition , 2004, IEEE Transactions on Circuits and Systems for Video Technology.

[17]  David Zhang,et al.  A parameterized direct LDA and its application to face recognition , 2007, Neurocomputing.

[18]  Shuicheng Yan,et al.  Graph Embedding and Extensions: A General Framework for Dimensionality Reduction , 2007 .

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