Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonlinear component analysis as a kernel eigenvalue problem
Neural Computation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multilinear Analysis of Image Ensembles: TensorFaces
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
Extended isomap for pattern classification
Eighteenth national conference on Artificial intelligence
Kernel Eigenfaces vs. Kernel Fisherfaces: Face Recognition Using Kernel Methods
FGR '02 Proceedings of the Fifth IEEE International Conference on Automatic Face and Gesture Recognition
Face Recognition Using Kernel Based Fisher Discriminant Analysis
FGR '02 Proceedings of the Fifth IEEE International Conference on Automatic Face and Gesture Recognition
Face Recognition Using Laplacianfaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multilinear Independent Components Analysis
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Generalized Discriminant Analysis Using a Kernel Approach
Neural Computation
Journal of Cognitive Neuroscience
Improving kernel Fisher discriminant analysis for face recognition
IEEE Transactions on Circuits and Systems for Video Technology
Face recognition by independent component analysis
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Recently proposed manifold learning algorithms, e.g. Isometric feature mapping (Isomap), Locally Linear Embedding (LLE), and Laplacian Eigenmaps, are based on minimizing the construction error for data description and visualization, but not optimal from classification viewpoint. A discriminant isometric feature mapping for face recognition is presented in this paper. In our method, the geodesic distances between data points are estimated by Floyd's algorithm, and Kernel Fisher Discriminant is then utilized to achieve the discriminative nonlinear embedding. Prior to the estimation of geodesic distances, the neighborhood graph is constructed by incorporating class information. Experimental results on two face databases demonstrate that the proposed algorithm achieves lower error rate for face recognition.