Random Subspace Two-Dimensional PCA for face recognition

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

Abstract

The two-dimensional Principal Component Analysis (2DPCA) is a robust method in face recognition. Much recent research shows that the 2DPCA is more reliable than the well-known PCA method in recognising human face. However, in many cases, this method tends to be overfitted to sample data. In this paper, we proposed a novel method named random subspace two-dimensional PCA (RS-2DPCA), which combines the 2DPCA method with the random subspace (RS) technique. The RS-2DPCA inherits the advantages of both the 2DPCA and RS technique, thus it can avoid the overfitting problem and achieve high recognition accuracy. Experimental results in three benchmark face data sets -the ORL database, the Yale face database and the extended Yale face database B - confirm our hypothesis that the RS-2DPCA is superior to the 2DPCA itself. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Nguyen, N., Liu, W., & Venkatesh, S. (2007). Random Subspace Two-Dimensional PCA for face recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4810 LNCS, pp. 655–664). Springer Verlag. https://doi.org/10.1007/978-3-540-77255-2_81

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