By Topic

Shape-Driven Gabor Jets for Face Description and Authentication

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
$33 $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)

This paper proposes, through the combination of concepts and tools from different fields within the computer vision community, an alternative path to the selection of key points in face images. The classical way of attempting to solve the face recognition problem using algorithms which encode local information is to localize a predefined set of points in the image, extract features from the regions surrounding those locations, and choose a measure of similarity (or distance) between correspondent features. Our approach, namely shape-driven Gabor jets, aims at selecting an own set of points and features for a given client. After applying a ridges and valleys detector to a face image, characteristic lines are extracted and a set of points is automatically sampled from these lines where Gabor features (jets) are calculated. So each face is depicted by R2 points and their respective jets. Once two sets of points from face images have been extracted, a shape-matching algorithm is used to solve the correspondence problem (i.e., map each point from the first image to a point within the second image) so that the system is able to compare shape-matched jets. As a byproduct of the matching process, geometrical measures are computed and compiled into the final dissimilarity function. Experiments on the AR face database confirm good performance of the method against expression and, mainly, lighting changes. Moreover, results on the XM2VTS and BANCA databases show that our algorithm achieves better performance than implementations of the elastic bunch graph matching approach and other related techniques.

Published in:

IEEE Transactions on Information Forensics and Security  (Volume:2 ,  Issue: 4 )