By Topic

Local Graph Matching for Face Recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ersi, E.F. ; Dept. of Syst. Design Eng., Waterloo Univ., Ont. ; Zelek, J.S.

We represent face images by a set of triangular labeled graphs, each containing information on the appearance and geometry of a 3-tuple of face feature points. Our method automatically learns a model set and builds a graph space for each individual. A two-stage method for fast matching is developed, where in the first stage a maximum a posterior solution based on PCA factorization is used to efficiently prune the search space and select very few candidate model sets, and in the second stage a nearest neighborhood classifier is used to find the closest model graphs to the query image graphs. Finally, the probe image is assigned to the trained individual with the maximum number of references. Our proposed technique achieves perfect results on the ORL face set and an accuracy rate of 97.7% on the FERET face set, which shows the superiority of the proposed technique over all considered state-of-the-art methods (elastic bunch graph matching, LDA+PCA, Bayesian intra/extra-personal classifier, boosted Haar classifier)

Published in:

Applications of Computer Vision, 2007. WACV '07. IEEE Workshop on

Date of Conference:

Feb. 2007