Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
The FERET Evaluation Methodology for Face-Recognition Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Two-Dimensional PCA: A New Approach to Appearance-Based Face Representation and Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Face recognition: A literature survey
ACM Computing Surveys (CSUR)
Face Recognition Using Laplacianfaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Journal of Cognitive Neuroscience
Bidirectional PCA with assembled matrix distance metric for image recognition
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
BDPCA plus LDA: a novel fast feature extraction technique for face recognition
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Probabilistic learning of similarity measures for tensor PCA
Pattern Recognition Letters
Facial expressions analysis based on cooperative neuro-computing interactions
IScIDE'12 Proceedings of the third Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
Novel and efficient pedestrian detection using bidirectional PCA
Pattern Recognition
Coarse to fine K nearest neighbor classifier
Pattern Recognition Letters
Using the idea of the sparse representation to perform coarse-to-fine face recognition
Information Sciences: an International Journal
Hi-index | 0.01 |
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.