Copyright © 2007 Elsevier B.V. All rights reserved.
Generalized elastic graph matching for face recognition
Received 3 November 2005;
revised 2 January 2007.
Communicated by T.K. Ho.
Available online 17 January 2007.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Elastic graph matching (EGM) is a well-known approach in face recognition area for the robust face recognition to a rotation in depth and facial expression change. We extended the conventional EGM to the generalized EGM (G-EGM), which is afford to handle even globally warped faces, by enhancing the robustness of node descriptors to a global warping, and introducing warping-compensated edges in graph matching cost function. The improved performance of the G-EGM was evaluated through the recognition simulation based on arbitrary posed faces.
Keywords: Face recognition; Face alignment; Elastic graph matching







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)






