Newshot

How Many Persistent Features Does a Biometric Need? A Law Linking Equal Error Rate to Feature Count and Persistence

Summary

arXiv:2611.21973v1 Announce Type: new Abstract: A biometric designer controls the number of features and their temporal persistence. Earlier empirical work linked the equal error rate (EER) to persistence and to the required number of features by straight lines. We derive the law behind these regularities. For $N$ independent standardized Gaussian features with test-retest correlation $\rho$, scored by cosine similarity, Fisher's $z$-transform turns the genuine and impostor scores into two normals, giving $\mathrm{EER}=\Phi(-\frac{1}{2}\sqrt{N}\,\operatorname{atanh}\rho)$ and, inversely, $N=(2q/\operatorname{atanh}\rho)^2$ with $q=\Phi^{-1}(1-\mathrm{EER})$; intercorrelated features enter through an effective count $N_{\mathrm{eff}}$. The central extension lets persistence vary across comparisons with spread $\tau$ on Fisher's scale: $\mathrm{EER}=\Phi(-m/(\sqrt{\tau^2+v}+\sqrt{v}))$ with $v=1/(N_{\mathrm{eff}}-2)$, which for a normal spread has a floor $\Phi(-m/\tau)$ that no number o…

Original text(via arXiv cs.CV)

Computer Science > Computer Vision and Pattern Recognition

Title:How Many Persistent Features Does a Biometric Need? A Law Linking Equal Error Rate to Feature Count and Persistence

Abstract:A biometric designer controls the number of features and their temporal persistence. Earlier empirical work linked the equal error rate (EER) to persistence and to the required number of features by straight lines. We derive the law behind these regularities. For $N$ independent standardized Gaussian features with test-retest correlation $\rho$, scored by cosine similarity, Fisher's $z$-transform turns the genuine and impostor scores into two normals, giving $\mathrm{EER}=\Phi(-\frac{1}{2}\sqrt{N}\,\operatorname{atanh}\rho)$ and, inversely, $N=(2q/\operatorname{atanh}\rho)^2$ with $q=\Phi^{-1}(1-\mathrm{EER})$; intercorrelated features enter through an effective count $N_{\mathrm{eff}}$. The central extension lets persistence vary across comparisons with spread $\tau$ on Fisher's scale: $\mathrm{EER}=\Phi(-m/(\sqrt{\tau^2+v}+\sqrt{v}))$ with $v=1/(N_{\mathrm{eff}}-2)$, which for a normal spread has a floor $\Phi(-m/\tau)$ that no number of features can lower. With no fitted parameter the simple law reproduces published simulations and the EER-ICC line, and predicts the KCC-EER relation of eye-movement embeddings on GazeBase ($R^2=0.88$), though less well on GazeBaseVR ($0.63$). Read from the genuine and impostor scores, the general form matches the EER of eye movements, keystroke dynamics, the ECG and face embeddings over 101 conditions with $R^2=0.98$ and a median error of $0.6$ points, against $0.87$ and $1.9$ points for the simple law. The 61 eye-movement, keystroke and ECG conditions check consistency on the same scores; the 40 face conditions use held-out subjects, with the same accuracy. The product $\tau\sqrt{N_{\mathrm{eff}}-2}$ gives a design rule: adding or decorrelating features pays fully while it is well below one and little once it exceeds about three, where only higher or more uniform persistence helps.
Subjects:Computer Vision and Pattern Recognition (cs.CV)
Cite as:arXiv:2611.21973 [cs.CV]
(or arXiv:2611.21973v1 [cs.CV] for this version)
https://doi.org/10.48550/arXiv.2611.21973 arXiv-issued DOI via DataCite (pending registration)

Submission history

Access Paper:

  • HTML (experimental)

Additional Features

  • Audio Summary

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv cs.CV
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗