By Topic

Fingerprint preselection using eigenfeatures

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

2 Author(s)
Kaniel, T. ; C&C Media Res. Labs., NEC Corp., Kawasaki, Japan ; Mizoguchi, M.

In this paper we propose a new distance measure for an identification problem and describe experiments on fingerprint preselection using eigenfeatures of ridge direction patterns. The distance is defined by likelihood ratio of error distribution of feature vectors to the whole distribution of feature vector differences. In addition, we introduce “quality indexes” of feature vectors and make the distance adaptive to the quality indexes. Experiments on fingerprint preselection for ten-print cards revealed that our proposed distance is much more effective than the Mahalanobis distance. By combining the eigenfeatures and traditional classification features, 0.06% false acceptance rate at 2.0% false rejection rate and one million cards/sec preselection speed on a standard workstation have been achieved. This makes it possible to construct high performance fingerprint identification systems

Published in:

Computer Vision and Pattern Recognition, 1998. Proceedings. 1998 IEEE Computer Society Conference on

Date of Conference:

23-25 Jun 1998