On Using a Pre-clustering Technique to Optimize LDA-Based Classifiers for Appearance-Based Face Recognition

Fisher's Linear Discriminant Analysis (LDA) is a traditional dimensionality reduction method that has been proven to be successful for decades. To enhance the LDA's power for high-dimensional pattern classification, such as face recognition, numerous LDA-extension approaches have been proposed in the literature. This paper proposes a new method that improves the performance of LDA-based classification by simply increasing the number of (sub)-classes through clustering a few of classes of the training set prior to the execution of LDA. This is based on the fact that the eigen space of the training set consists of the range space and the null space, and that the dimensionality of the range space increases as the number of classes increases. Therefore, when constructing the transformation matrix, through minimizing the null space, the loss of discriminative information resulted from this space can be minimized. To select the classes to be clustered, in the present paper, the intraset distance is employed as a criterion and the k-means clustering is performed to divide them. Our experimental results for an artificial data set of XOR-type samples and a well-known benchmark face database of Yale demonstrate that the classification efficiency of the proposed method could be improved.

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

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

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

[4]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[5]  Jianlin Wang,et al.  Solving the small sample size problem in face recognition using generalized discriminant analysis , 2006, Pattern Recognit..

[6]  Ujjwal Maulik,et al.  Performance Evaluation of Some Clustering Algorithms and Validity Indices , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Sang-Woon Kim,et al.  On Using a Dissimilarity Representation Method to Solve the Small Sample Size Problem for Face Recognition , 2006, ACIVS.

[8]  Aleix M. Martínez,et al.  Subclass discriminant analysis , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Ravi Kothari,et al.  Adaptive linear dimensionality reduction for classification , 2000, Pattern Recognit..

[10]  Javier Ruiz-del-Solar,et al.  Eigenspace-based face recognition: a comparative study of different approaches , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[11]  Jieping Ye,et al.  A two-stage linear discriminant analysis via QR-decomposition , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Luis Rueda,et al.  A New Approach to Multi-class Linear Dimensionality Reduction , 2006, CIARP.

[13]  Ming-Hsuan Yang,et al.  Kernel Eigenfaces vs. Kernel Fisherfaces: Face recognition using kernel methods , 2002, Proceedings of Fifth IEEE International Conference on Automatic Face Gesture Recognition.

[14]  Abraham Kandel,et al.  Introduction to Pattern Recognition: Statistical, Structural, Neural and Fuzzy Logic Approaches , 1999 .

[15]  Josef Kittler,et al.  Locally linear discriminant analysis for multimodally distributed classes for face recognition with a single model image , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[18]  José Francisco Martínez-Trinidad,et al.  Progress in Pattern Recognition, Image Analysis and Applications, 12th Iberoamericann Congress on Pattern Recognition, CIARP 2007, Valparaiso, Chile, November 13-16, 2007, Proceedings , 2008, CIARP.

[19]  Robert P. W. Duin,et al.  Linear dimensionality reduction via a heteroscedastic extension of LDA: the Chernoff criterion , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.