By Topic

Inexact graph matching using stochastic optimization techniques for facial feature 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

3 Author(s)
Cesar, R. ; Inst. de Matematica e Estatistica, Sao Paulo Univ., Brazil ; Bengoetxea, E. ; Bloch, I.

We propose a formalization of model-based facial feature recognition as an inexact graph matching problem, one graph representing a model of a face and the other an image where recognition has to be performed. The graphs are built from regions and relationships between regions. Both nodes and edges are attributed. A global dissimilarity function is defined based on comparison of attributes of the two graphs, and accounting for the fact that several image regions can correspond to the same model region. This junction is then minimized using several stochastic algorithms.

Published in:

Pattern Recognition, 2002. Proceedings. 16th International Conference on  (Volume:2 )

Date of Conference:

2002