Fusion of Biometric Algorithms in Recognition Problem

Published

January 1, 2005

Author(s)

Andrew L. Rukhin, Igor Malioutov

Abstract

This note concerns the mathematical aspects for several biometric algorithms in the recognition or identification problem. It is assumed that a biometric signature is presented to a system which compares it with a database of signatures of known individuals (gallery). On the basis of this comparison, an algorithm produces the similarity scores of this probe to the signatures in the gallery, which are then ranked according to their similarity scores of the probe. The suggested procedures define several versions of aggregated rankings. An example from the FERET (Face Recognition Technology) program with four recognition algorithms is considered.

Citation

Pattern Recognition Letters

Volume

26

Issue

No. 1

Pub Type

Journals

Download Paper

Local Download

Keywords

aggregated algorithm, gallery, metrics on permutations, permutation matrix, probe, similarity score

Citation

Rukhin, A. and Malioutov, I. (2005), Fusion of Biometric Algorithms in Recognition Problem, Pattern Recognition Letters, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=151795 (Accessed April 25, 2024)