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.
KeywordsFace Recognition Linear Discriminant Analysis (LDA) Pre-clustered LDA (PLDA)
- 5.Yang, M.-H.: Kernel eigenfaces vs. kernel Fisherfaces: Face recognition using kernel methods. In: Proceedings of Fifth IEEE International Conference on Automatic Face and Gesture Recognition, pp. 215–220 (2002)Google Scholar
- 14.Friedman, M., Kandel, A.: Introduction to Pattern Recognition - Statistical, Structural, Neural and Fuzzy Logic Approaches. World Scientific, New Jersey (1999)Google Scholar