Classifying faces with discriminant isometric feature mapping

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Li, R., Wang, C., Hao, H., & Tu, X. (2005). Classifying faces with discriminant isometric feature mapping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3789 LNAI, pp. 565–573). Springer Verlag. https://doi.org/10.1007/11579427_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free