Towards Bloom filter-based indexing of iris biometric data

Détails

ID Serval
serval:BIB_C75754BE758B
Type
Actes de conférence (partie): contribution originale à la littérature scientifique, publiée à l'occasion de conférences scientifiques, dans un ouvrage de compte-rendu (proceedings), ou dans l'édition spéciale d'un journal reconnu (conference proceedings).
Collection
Publications
Titre
Towards Bloom filter-based indexing of iris biometric data
Titre de la conférence
2015 International Conference on Biometrics (ICB)
Auteur⸱e⸱s
Rathgeb C., Breitinger F., Baier H., Busch C.
Editeur
IEEE
ISBN
9781479978243
Statut éditorial
Publié
Date de publication
05/2015
Langue
anglais
Résumé
Conventional biometric identification systems require exhaustive 1 : N comparisons in order to identify a bio- metric probe, i.e. comparison time frequently dominates the overall computational workload. Biometric database indexing represents a challenging task since biometric data does not exhibit any natural sorting order. In this paper we present a preliminary study on the feasibility of applying Bloom filters for the purpose of iris biometric database indexing. It is shown that, by constructing a binary tree data structure of Bloom filters extracted from binary iris biometric templates (iris-codes), the search space can be reduced to O(log N ). In experiments, which are carried out on a medium-sized database of N = 256 subjects, biometric performance (accuracy) is maintained for different conventional identification systems. Further, perspectives on how to employ the proposed scheme on large-scale databases are given.
Mots-clé
Accuracy, Algorithm design and analysis, Binary search trees, Feature extraction, Indexing, Iris recognition
Création de la notice
06/05/2021 12:01
Dernière modification de la notice
06/05/2021 12:44
Données d'usage