Adaptation of SIFT Features for Robust Face Recognition

Janez Križaj, Vitomir Štruc, Nikola Pavešić (2010): Adaptation of SIFT Features for Robust Face Recognition. Proceedings of the 7th International Conference on Image Analysis and Recognition (ICIAR 2010), Povoa de Varzim, Portugal, 2010.

Abstract

The Scale Invariant Feature Transform (SIFT) is an algorithm used to detect and describe scale-, translation- and rotation-invariant local features in images. The original SIFT algorithm has been successfully applied in general object detection and recognition tasks, panorama stitching and others. One of its more recent uses also includes face recognition, where it was shown to deliver encouraging results. SIFT-based face recognition techniques found in the literature rely heavily on the so-called keypoint detector, which locates interest points in the given image that are ultimately used to compute the SIFT descriptors. While these descriptors are known to be among others (partially) invariant to illumination changes, the keypoint detector is not. Since varying illumination is one of the main issues affecting the performance of face recognition systems, the keypoint detector represents the main source of errors in face recognition systems relying on SIFT features. To overcome the presented shortcoming of SIFT-based methods, we present in this paper a novel face recognition technique that computes the SIFT descriptors at predefined (fixed) locations learned during the training stage. By doing so, it eliminates the need for keypoint detection on the test images and renders our approach more robust to illumination changes than related approaches from the literature. Experiments, performed on the Extended Yale B face database, show that the proposed technique compares favorably with several popular techniques from the literature in terms of performance.

BibTeX (Download)

@conference{ICIAR2010_Sift,
title = {Adaptation of SIFT Features for Robust Face Recognition},
author = {Janez Kri\v{z}aj and Vitomir \v{S}truc and Nikola Pave\v{s}i\'{c}},
url = {http://luks.fe.uni-lj.si/nluks/wp-content/uploads/2016/09/FSIFT.pdf},
year  = {2010},
date = {2010-06-01},
booktitle = {Proceedings of the 7th International Conference on Image Analysis and Recognition (ICIAR 2010)},
pages = {394-404},
address = {Povoa de Varzim, Portugal},
abstract = {The Scale Invariant Feature Transform (SIFT) is an algorithm used to detect and describe scale-, translation- and rotation-invariant local features in images. The original SIFT algorithm has been successfully applied in general object detection and recognition tasks, panorama stitching and others. One of its more recent uses also includes face recognition, where it was shown to deliver encouraging results. SIFT-based face recognition techniques found in the literature rely heavily on the so-called keypoint detector, which locates interest points in the given image that are ultimately used to compute the SIFT descriptors. While these descriptors are known to be among others (partially) invariant to illumination changes, the keypoint detector is not. Since varying illumination is one of the main issues affecting the performance of face recognition systems, the keypoint detector represents the main source of errors in face recognition systems relying on SIFT features. To overcome the presented shortcoming of SIFT-based methods, we present in this paper a novel face recognition technique that computes the SIFT descriptors at predefined (fixed) locations learned during the training stage. By doing so, it eliminates the need for keypoint detection on the test images and renders our approach more robust to illumination changes than related approaches from the literature. Experiments, performed on the Extended Yale B face database, show that the proposed technique compares favorably with several popular techniques from the literature in terms of performance.},
keywords = {biometrics, dense SIFT, face recognition, performance evaluation, SIFT, SIFT features},
pubstate = {published},
tppubtype = {conference}
}