Abstract | ||
---|---|---|
Two-dimensional principal components analysis (2DPCA) needs more coefficients than principal components analysis (PCA) for image representation and hence needs more time for classification. The bidirectional PCA (BDPCA) is proposed to overcome these drawbacks of 2DPCA. Both 2DPCA and BDPCA, however, can work only in Euclidean space. In this paper, we propose Laplacian BDPCA (LBDPCA) to enhance the robustness of BDPCA by extending it to non-Euclidean space. Experimental results on representative face databases show that LBDPCA works well and it surpasses BDPCA. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1016/j.neucom.2010.08.020 | Neurocomputing |
Keywords | Field | DocType |
2DPCA,BDPCA,Laplacian,Face recognition | Computer vision,Facial recognition system,Pattern recognition,Image representation,Euclidean space,Robustness (computer science),Artificial intelligence,Principal component analysis,Mathematics,Machine learning,Laplace operator | Journal |
Volume | Issue | ISSN |
74 | 1 | 0925-2312 |
Citations | PageRank | References |
10 | 0.56 | 11 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Wankou Yang | 1 | 535 | 34.68 |
Changyin Sun | 2 | 2002 | 157.17 |
Lei Zhang | 3 | 16326 | 543.99 |
Karl Ricanek | 4 | 165 | 18.65 |