# Face Identification by SIFT-based Complete Graph Topology

Source: [Face Identification by SIFT-based Complete Graph Topology](<https://www.sota2.com/research/paper/68fa600d1e209131ce9ed884>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:32:47.343Z

Authors: Dakshina Ranjan Kisku, Ajita Rattani, Enrico Grosso, Massimo Tistarelli

Published: 2010-02-02T08:00:33.000Z

## Abstract

This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully used for general object detection and recognition, only recently they were applied to face recognition. This paper further investigates the performance of identification techniques based on Graph matching topology drawn on SIFT features which are invariant to rotation, scaling and translation. Face projections on images, represented by a graph, can be matched onto new images by maximizing a similarity function taking into account spatial distortions and the similarities of the local features. Two graph based matching techniques have been investigated to deal with false pair assignment and reducing the number of features to find the optimal feature set between database and query face SIFT features. The experimental results, performed on the BANCA database, demonstrate the effectiveness of the proposed system for automatic face identification.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1002.0411>)

[PDF](<https://arxiv.org/pdf/1002.0411.pdf>)
