This paper presents a 3D facial recognition algorithm based on the Hausdorff distance metric. The standard 3D formulation of the Hausdorff matching algorithm has been modified to operate on a 2D range image, enabling a reduction in computation from O(N2) to O(N) without large storage requirements. The Hausdorff distance is known for its robustness to data outliers and inconsistent data between two data sets, making it a suitable choice for dealing with the inherent problems in many 3D datasets due to sensor noise and object self-occlusion. For optimal performance, the algorithm assumes a good initial alignment between probe and template datasets. However, to minimize the error between two faces, the alignment can be iteratively refined. Results from the algorithm are presented using 3D face images from the Face Recognition Grand Challenge database version 1.0.
A 2D Range Hausdorff Approach for 3D Face Recognition
01.01.2005
382928 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Face Recognition from 3D Face Profiles Using the Hausdorff Distance
British Library Online Contents | 2003
|Robust face recognition from 2D and 3D images using structural Hausdorff distance
British Library Online Contents | 2006
|New star pattern recognition approach based on Hausdorff distance
British Library Online Contents | 2005
|A novel weighted Hausdorff distance for face localization
British Library Online Contents | 2006
|