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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.