ePrints

A Fast Search Algorithm for a Large Fuzzy Database

Lookup NU author(s): Professor Feng Hao

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

In this paper, we propose a fast search algorithm for a large fuzzy database that stores iris codes or data with a similar binary structure. The fuzzy nature of iris codes and their high dimensionality render many modern search algorithms, mainly relying on sorting and hashing, inadequate. The algorithm that is used in all current public deployments of iris recognition is based on a brute force exhaustive search through a database of iris codes, looking for a match that is close enough. Our new technique, Beacon Guided Search (BGS), tackles this problem by dispersing a multitude of ldquobeaconsrdquo in the search space. Despite random bit errors, iris codes from the same eye are more likely to collide with the same beacons than those from different eyes. By counting the number of collisions, BGS shrinks the search range dramatically with a negligible loss of precision. We evaluate this technique using 632,500 iris codes enrolled in the United Arab Emirates (UAE) border control system, showing a substantial improvement in search speed with a negligible loss of accuracy. In addition, we demonstrate that the empirical results match theoretical predictions.

Publication metadata

Author(s): Hao F, Daugman J, Zielinski P

Publication type: Article

Publication status: Published

Journal: IEEE Transactions on Information Forensics and Security

Year: 2008

Volume: 3

Issue: 2

Pages: 203-212

ISSN (print): 1556-6013

ISSN (electronic): 1556-6021

Publisher: IEEE

URL: http://dx.doi.org/10.1109/TIFS.2008.920726

DOI: 10.1109/TIFS.2008.920726

Altmetrics

Share