3D Face Recognition using Log-Gabor Templates

Cook, Jamie A. and Chandran, Vinod and Fookes, Clinton B. (2006) 3D Face Recognition using Log-Gabor Templates. In Proceedings British Machine Vision Conference, Edinborugh, Scotland.

Full text available as: PDF - Requires Adobe Acrobat Reader or other PDF viewer.

Abstract

The use of Three Dimensional (3D) data allows new facial recognition algorithms to overcome factors such as pose and illumination variations which have plagued traditional 2D Face Recognition. In this paper a new method for providing insensitivity to expression variation in range images based on Log-Gabor Templates is presented. By decomposing a single image of a subject into 147 observations the reliance of the algorithm upon any particular part of the face is relaxed allowing high accuracy even in the presence of occulusions, distortions and facial expressions. Using the 3D database collected by University of Notre Dame for the Face Recognition Grand Challenge (FRGC), benchmarking results are presented showing superior performance of the proposed method. Comparisons showing the relative strength of the algorithm against two commercial and two academic 3D face recognition algorithms are also presented. algoritms are also presented. 1 Introduction

Item Type:	Conference Paper
Status:	Published
Keywords:	face recognition; part face; decomposition; gabor; log-gabor; FRGC
Subjects:	280000 Information, Computing and Communication Sciences > 280200 Artificial Intelligence and Signal and Image Processing > 280203 Image Processing 280000 Information, Computing and Communication Sciences > 280200 Artificial Intelligence and Signal and Image Processing > 280207 Pattern Recognition
ID Code:	10914
Deposited By:	Cook, James
Deposited On:	26 November 2007
Alternative Locations:	http://www.macs.hw.ac.uk/bmvc2006/papers/286.pdf, http://jamie.homelinux.org/wp-content/uploads/2006/09/cook_loggabortemplates-final.pdf, http://www.macs.hw.ac.uk/bmvc2006/
Copyright Owner:	Copyright 2006 (please consult authors)
Additional Information:	The contents of this paper can be freely accessed online via the conference web page (see hypertext link). For more information, please contact the authors.