Abstract
We present our graph matching approach for 3D facial feature localisation. The work here uses a basic graph model (three vertices and three arcs) to locate the inner eye corners and the nose tip simultaneously. We intend to extend this to a larger set of the eleven features that exist in our ground truth of the Face Recognition Grand Challenge (FRGC) database. We apply the structural matching algorithm "relaxation by elimination" using a simple "distance to local plane" node property and a "Euclidean distance" arc property. After the graph matching process has eliminated unlikely candidates, the most likely feature combination (left eye, right eye and nose tip) is selected, by exhaustive search, as the minimum Mahalanobis distance over a six dimensional space, corresponding to three node variables and three arc variables. Our results on the 3D FRGC database are presented and discussed.
| Original language | English |
|---|---|
| Title of host publication | 2008 IEEE SECOND INTERNATIONAL CONFERENCE ON BIOMETRICS: THEORY, APPLICATIONS AND SYSTEMS (BTAS) |
| Place of Publication | NEW YORK |
| Publisher | IEEE |
| Pages | 346-351 |
| Number of pages | 6 |
| ISBN (Print) | 978-1-4244-2729-1 |
| Publication status | Published - 2008 |
| Event | 2nd IEEE International Conference on Biometrics - Theory, Applications and Systems (BTAS 2008) - Washington Duration: 29 Sep 2008 → 1 Oct 2008 |
Conference
| Conference | 2nd IEEE International Conference on Biometrics - Theory, Applications and Systems (BTAS 2008) |
|---|---|
| City | Washington |
| Period | 29/09/08 → 1/10/08 |