Generalized elastic graph matching for face recognition

  • Authors:
  • Hochul Shin;Seong-Dae Kim;Hae-Chul Choi

  • Affiliations:
  • Division of Electrical Engineering, Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology (KAIST), 373-1 Guseong-dong, Yuseong-gu, Daejeon 3 ...;Division of Electrical Engineering, Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology (KAIST), 373-1 Guseong-dong, Yuseong-gu, Daejeon 3 ...;Broadcasting Media Research Group, Electronics and Telecommunications Research Institute (ETRI), 161 Gajeong-dong, Yuseong-gu, Daejeon 305-701, Republic of Korea

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2007

Quantified Score

Hi-index 0.10

Visualization

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.