Generalized elastic graph matching for face recognition

Cited 21 time in webofscience Cited 0 time in scopus
  • Hit : 196
  • Download : 0
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. (c) 2007 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2007-07
Language
English
Article Type
Article
Keywords

AUTHENTICATION

Citation

PATTERN RECOGNITION LETTERS, v.28, pp.1077 - 1082

ISSN
0167-8655
DOI
10.1016/j.patrec.2007.01.003
URI
http://hdl.handle.net/10203/90081
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 21 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0