NACCACHE, David and Zdeněk ŘÍHA. Accelerating Biometric Identification. In Infocommunications Journal, Volume 4, Issue IV. Budapest, Hungary: Scientific Association for Infocommunica, 2012. p. 42-44. ISSN 2061-2079.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Accelerating Biometric Identification
Name in Czech Zrychlování biometrické identifikace
Authors NACCACHE, David (250 France) and Zdeněk ŘÍHA (203 Czech Republic, guarantor, belonging to the institution).
Edition Budapest, Hungary, Infocommunications Journal, Volume 4, Issue IV, p. 42-44, 3 pp. 2012.
Publisher Scientific Association for Infocommunica
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Hungary
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
RIV identification code RIV/00216224:14330/12:00067652
Organization unit Faculty of Informatics
ISSN 2061-2079
Keywords (in Czech) biometrika; biometrická identifkace; korelace
Keywords in English biometrics; biometric identification; correlation
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 28. 4. 2014 09:41.
By opposition to biometric matching, biometric identification is a relatively costly process. Let $B=\{b_1,\ldots,b_n\}$ be a database of $n$ biometric templates and let $b$ be a given individual biometric acquisition. The biometric identification problem consist in finding the $b_i$ corresponding to $b$. Whilst in reality matching algorithms usually return a score compared to a threshold, for the sake of simplicity this paper assume the existence of an oracle $\mathfrak{A}$ taking as $b$ and $b_i$, and responding with true or false: $$\mathfrak{A}(b,b_i) \in \{{\sf T},{\sf F}\}$$ Considering $\mathfrak{A}$ as an {\sl atomic} operation, any system-level optimization must necessarily minimize the number of calls to $\mathfrak{A}$ per identification session. This is the parameter that we attempt to optimize in this paper. We show that indeed, by using statistically justified comparison strategies considerable speed gains can be obtained.
Abstract (in Czech)
Biometrická identifikace je náročnější proces než verifikace. Nechť B=(b1, ..., bn) je databáze n biometrických šablon. Biometrická identifikace spočívá bi co nejvíce podobného biometrickému vzorku b. Vycházíme z existence verifikačního orácula A, který porovná b a bi a vrátí výsledek pravda či nepravda. Bereme A jako atomickou operaci a při identifikaci se snažíme optimalizovat počet volání A.
PrintDisplayed: 13. 8. 2022 02:02