LocalScore: Local Density-Aware Similarity Scoring for Biometrics

๐Ÿ“… 2026-02-01
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
This work addresses the challenge in open-set biometrics where unenrolled probes are difficult to detect due to conventional methods compressing intra-class variations into a single global representation, resulting in ambiguous decision boundaries and poor robustness. To overcome this limitation, the authors propose LocalScore, a plug-and-play algorithm that introduces, for the first time in biometric scoring, an explicit k-nearest neighborโ€“based local density estimation to construct a similarity scoring mechanism sensitive to the local structure of the feature space. LocalScore incurs minimal computational overhead and is compatible with arbitrary model architectures and loss functions. Experimental results demonstrate significant improvements in open-set performance across multiple modalities: the open-set retrieval FNIR@FPIR drops from 53% to 40%, and verification TAR@FAR increases from 51% to 74%.

Technology Category

Application Category

๐Ÿ“ Abstract
Open-set biometrics faces challenges with probe subjects who may not be enrolled in the gallery, as traditional biometric systems struggle to detect these non-mated probes. Despite the growing prevalence of multi-sample galleries in real-world deployments, most existing methods collapse intra-subject variability into a single global representation, leading to suboptimal decision boundaries and poor open-set robustness. To address this issue, we propose LocalScore, a simple yet effective scoring algorithm that explicitly incorporates the local density of the gallery feature distribution using the k-th nearest neighbors. LocalScore is architecture-agnostic, loss-independent, and incurs negligible computational overhead, making it a plug-and-play solution for existing biometric systems. Extensive experiments across multiple modalities demonstrate that LocalScore consistently achieves substantial gains in open-set retrieval (FNIR@FPIR reduced from 53% to 40%) and verification (TAR@FAR improved from 51% to 74%). We further provide theoretical analysis and empirical validation explaining when and why the method achieves the most significant gains based on dataset characteristics.
Problem

Research questions and friction points this paper is trying to address.

open-set biometrics
non-mated probes
multi-sample galleries
intra-subject variability
local density
Innovation

Methods, ideas, or system contributions that make the work stand out.

LocalScore
local density
open-set biometrics
k-nearest neighbors
multi-sample gallery
๐Ÿ”Ž Similar Papers
No similar papers found.
Yiyang Su
Yiyang Su
Michigan State University
Computer Vision
Minchul Kim
Minchul Kim
Michigan State University
Machine LearningComputer Vision
J
Jie Zhu
Michigan State University
C
Christopher Perry
Michigan State University
Feng Liu
Feng Liu
Assistant Professor, Drexel University
Computer VisionPattern RecognitionMachine LearningBiometrics
A
Anil Jain
Michigan State University
X
Xiaoming Liu
University of North Carolina, Chapel Hill