Cart (Loading....) | Create Account
Close category search window
 

A Framework for Efficient Fingerprint Identification Using a Minutiae Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mansukhani, P. ; Center for Unified Biometrics & Sensors, State Univ. of New York at Buffalo, Buffalo, NY, USA ; Tulyakov, S. ; Govindaraju, V.

Given the existence of large fingerprint databases, including distributed systems, the development of algorithms for performing fast searches in them has become the important topic for biometric researchers. In this paper, we propose a new indexing method for fingerprint templates consisting of a set of minutia points. In contrast to previously presented methods, our algorithm is tree-based and well addresses the efficiency needs of complex (possibly distributed) systems. One large index tree is constructed and the enrolled templates are represented by the leaves of the tree. The branches in the index tree correspond to different local configurations of minutia points. Searching the index tree entails extracting local minutia neighborhoods of the test fingerprint and matching them against tree nodes. Therefore, the search time does not depend on the number of enrolled fingerprint templates, but only on the index tree configuration. This framework can be adapted for different tree-building parameters (feature sets, indexing levels, bin boundaries) according to user requirements and different enrollment and searching techniques can be applied to improve accuracy. We conduct a number of the experiments on Fingerprint Verification Competition databases, as well as the databases of synthetically generated fingerprint templates. The experiments confirm the ability of the proposed algorithm to find correct matches in the database and the minimum search time requirements.

Published in:

Systems Journal, IEEE  (Volume:4 ,  Issue: 2 )
Biometrics Compendium, IEEE

Date of Publication:

June 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.