Information Theoretic Bounds on Accuracy for Biometric Identification in Metric Spaces of Data Representations

For both datasets of biometric objects given by images and an ensemble of the different modality datasets, the lower bounds on the error probability of person identification subject to a fixed amount of information have been investigated. The bounds are constructed using a probabilistic object classification model in metric spaces of the object representations. These bounds are independent of decision algorithms and are given by the inverses of the rate-distortion functions for discrete source coding with Hamming distortion, when the source letters are transmitted over a noisy channel. The difference between unity and any obtained lower bound produces an appropriate upper bound on the accuracy of person identification, depending on a given amount of processed information in a dataset of object representations. The obtained bounds are useful for estimating the efficiency of decision algorithms in terms of deviations of the algorithm error probability or accuracy relative to the boundary values, subject to a given average amount of information used for decision-making.

Authors

Institutions

Publication Details

Journal
Journal of Computer and Systems Sciences International
Published
2025-12-01
DOI
https://doi.org/10.1134/s1064230725700856
Primary Topic
Biometric Identification and Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Information Theoretic Bounds on Accuracy for Biometric Identification in Metric Spaces of Data Representations

S. V. Paramonov, A. M. Lange, M. M. Lange
Journal of Computer and Systems Sciences International
Biometric Identification and Security
article

Information Theoretic Bounds on Accuracy for Biometric Identification in Metric Spaces of Data Representations

S. V. Paramonov, A. M. Lange, M. M. Lange
article en

Abstract

For both datasets of biometric objects given by images and an ensemble of the different modality datasets, the lower bounds on the error probability of person identification subject to a fixed amount of information have been investigated. The bounds are constructed using a probabilistic object classification model in metric spaces of the object representations. These bounds are independent of decision algorithms and are given by the inverses of the rate-distortion functions for discrete source coding with Hamming distortion, when the source letters are transmitted over a noisy channel. The difference between unity and any obtained lower bound produces an appropriate upper bound on the accuracy of person identification, depending on a given amount of processed information in a dataset of object representations. The obtained bounds are useful for estimating the efficiency of decision algorithms in terms of deviations of the algorithm error probability or accuracy relative to the boundary values, subject to a given average amount of information used for decision-making.

Journal of Computer and Systems Sciences InternationalVol. 64(6)
Russian Academy of Sciences (RU)
Peace, Justice and strong institutions
Openalex Percentile: Top 27%
Biometric Identification and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.