IEEE Transactions on Pattern Analysis and Machine Intelligence
Convex Optimization
Face Recognition Using Laplacianfaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Local Discriminant Embedding and Its Variants
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Down-Sampling Face Images and Low-Resolution Face Recognition
ICICIC '08 Proceedings of the 2008 3rd International Conference on Innovative Computing Information and Control
LPP solution schemes for use with face recognition
Pattern Recognition
A Multiple Maximum Scatter Difference Discriminant Criterion for Facial Feature Extraction
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Manifold learning problem, aims to seek some directions, which can keep the local structure and neighborhood of each sample as much as possible. In the conventional manifold learning approaches, feature extraction is performed in the original data space. In this paper, a new method called "the maximized discriminant subspace algorithm" (MDS) is implemented before feature extraction and classification. Extensive experiments show the better classification results than the conventional manifold approaches, due to projecting the original data onto the maximized discriminant subspace in a preliminary phase before feature extraction and classification in the transformed data space.