About: Accelerating Biometric Identification

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Accelerating Biometric Identification Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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. 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. (en)
Title	Accelerating Biometric Identification Accelerating Biometric Identification (en)
skos:prefLabel	Accelerating Biometric Identification Accelerating Biometric Identification (en)
skos:notation	RIV/00216224:14330/12:00067652!RIV14-MSM-14330___
http://linked.open...avai/predkladatel	Fakulta informatiky
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Říha, Zdeněk
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	120832
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/12:00067652
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	biometrics; biometric identification; correlation (en)
http://linked.open.../riv/klicoveSlovo	correlation biometric identification biometrics
http://linked.open...ontrolniKodProRIV	[A2BA2D8FBE6C]
http://linked.open...v/mistoKonaniAkce	Budapest, Hungary
http://linked.open...i/riv/mistoVydani	Budapest, Hungary
http://linked.open...i/riv/nazevZdroje	Infocommunications Journal, Volume 4, Issue IV
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Říha, Zdeněk Naccache, David
http://linked.open...vavai/riv/typAkce	CST - Celostátní
http://linked.open.../riv/zahajeniAkce	2012-01-01 (xsd:date)
issn	2061-2079
number of pages	3 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Scientific Association for Infocommunica
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software