Using Discriminant Eigenfeatures for Image Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Performance Evaluation of the Nearest Feature Line Method in Image Classification and Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis and extension of spectral methods for nonlinear dimensionality reduction
ICML '05 Proceedings of the 22nd international conference on Machine learning
Nearest manifold approach for face recognition
FGR' 04 Proceedings of the Sixth IEEE international conference on Automatic face and gesture recognition
SINOBIOMETRICS'04 Proceedings of the 5th Chinese conference on Advances in Biometric Person Authentication
Ensembling local learners ThroughMultimodal perturbation
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Locally linear discriminant embedding: An efficient method for face recognition
Pattern Recognition
A novel maximum margin neighborhood preserving embedding for face recognition
Future Generation Computer Systems
Hi-index | 0.02 |
The locally linear embedding (LLE) algorithm can be used to discover a low-dimensional subspace from face manifolds. However, it does not mean that a good accuracy can be obtained when classifiers work under the subspace. Based on the proposed ULLELDA (Unified LLE and linear discriminant analysis) algorithm, an ensemble version of the ULLELDA (En-ULLELDA) is proposed by perturbing the neighbor factors of the LLE algorithm. Here many component learners are generated, each of which produces a single face subspace through some neighborhood parameter of the ULLELDA algorithm and is trained by a classifier. The classification results of these component learners are then combined through majority voting to produce the final prediction. Experiments on several face databases show the promising of the En-ULLELDA algorithm.