Face recognition via domain adaptation and manifold distance metric learning

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

Abstract

A novel approach for face recognition via domain adaptation and manifold distance metric learning is presented in this paper. Recently, unconstrained face recognition is becoming a research hot in computer vision. For the non-independent and identically distributed data set, the maximum mean discrepancy algorithm in domain adaption learning is used to represent the difference between the training set and the test set. At the same time, assume that the same type of face data are distributed on the same manifold and the different types of face data are distributed on different manifolds, the face image set is used to model multiple manifolds and the distance between affine hulls is used to represent the distance between manifolds. At last, a projection matrix will be explored by maximizing the distance between manifolds and minimizing the difference between the training set and test set. A large number of experimental results on different face data sets show the efficiency of the proposed method.

Cite

CITATION STYLE

APA

Li, B., Zheng, P. P., Liu, J., & Zhang, X. L. (2017). Face recognition via domain adaptation and manifold distance metric learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10362 LNCS, pp. 3–10). Springer Verlag. https://doi.org/10.1007/978-3-319-63312-1_1

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