Improvement on PCA and 2DPCA algorithms for face recognition

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Principle Component Analysis (PCA) technique is an important and well-developed area of image recognition and to date many linear discrimination methods have been put forward. Despite these efforts, there persist in the traditional PCA some weaknesses. In this paper, we propose new PCA-based methods that can improve the performance of the traditional PCA and two-dimensional PCA (2DPCA) approaches. In face recognition where the training data are labeled, a projection is often required to emphasize the discrimination between the clusters. Both PCA and 2DPCA may fail to accomplish this, no matter how easy the task is, as they are unsupervised techniques. The directions that maximize the scatter of the data might not be as adequate to discriminate between clusters. So we proposed new PCA-based schemes which can straightforwardly take into consideration data labeling, and makes the performance of recognition system better. Experiment results show our method achieves better performance in comparison with the traditional PCA and 2DPCA approaches with the complexity nearly as same as that of PCA and 2DPCA methods. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Nhat, V. D. M., & Lee, S. (2005). Improvement on PCA and 2DPCA algorithms for face recognition. In Lecture Notes in Computer Science (Vol. 3568, pp. 568–577). Springer Verlag. https://doi.org/10.1007/11526346_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free