By Topic

Using Particle Swarm Optimisation for Elastic Bunch Graph Matching to Recognise Faces

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)
Senaratne, R. ; Mechatron. Res. Group, Univ. of Melbourne, Melbourne, VIC ; Halgamuge, S.

A new approach to face recognition, where elastic bunch graph matching technique optimised with particle swarm optimisation is proposed in this paper. It is a fully automatic algorithm and can be used for databases where only one image per person is available. A face is represented by a face graph. A face bunch graph is created as a generalised representation of faces of various individuals. The face graph similarity between the face bunch graph and the deformable graph that has to be fitted to the face in the image is maximised by particle swarm optimisation, to locate the landmarks and thereby to find the optimal graph to represent a face. Improved results were obtained by this method as apposed to elastic bunch graph matching without optimisation. Results were further improved by hybridising it with principal component analysis.

Published in:

TENCON 2005 2005 IEEE Region 10

Date of Conference:

21-24 Nov. 2005