Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Fusion of Biometric Algorithms in Recognition Problem

Published

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

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 June 17, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created January 1, 2005, Updated February 17, 2017