Elsevier

Pattern Recognition

Volume 38, Issue 10, October 2005, Pages 1672-1684
Pattern Recognition

A minutia-based partial fingerprint recognition system

https://doi.org/10.1016/j.patcog.2005.03.016Get rights and content

Abstract

Matching incomplete or partial fingerprints continues to be an important challenge today, despite the advances made in fingerprint identification techniques. While the introduction of compact silicon chip-based sensors that capture only part of the fingerprint has made this problem important from a commercial perspective, there is also considerable interest in processing partial and latent fingerprints obtained at crime scenes. When the partial print does not include structures such as core and delta, common matching methods based on alignment of singular structures fail. We present an approach that uses localized secondary features derived from relative minutiae information. A flow network-based matching technique is introduced to obtain one-to-one correspondence of secondary features. Our method balances the tradeoffs between maximizing the number of matches and minimizing total feature distance between query and reference fingerprints. A two-hidden-layer fully connected neural network is trained to generate the final similarity score based on minutiae matched in the overlapping areas. Since the minutia-based fingerprint representation is an ANSI-NIST standard [American National Standards Institute, New York, 1993], our approach has the advantage of being directly applicable to existing databases. We present results of testing on FVC2002's DB1 and DB2 databases.

Introduction

Fingerprint matching based on minutia features is a well researched problem. During the last four decades, various algorithms have been proposed to match two minutia templates of fingerprints. Most of these algorithms assume that the two templates are approximately of the same size. This hypothesis is no longer valid. Miniaturization of fingerprint sensors has led to small sensing areas usually varying from 1” × 1” to 0.42” × 0.42”. However, fingerprint scanners with a sensing area smaller than 0.5” × 0.7”, which is considered to be the average fingerprint size [2], can only capture partial fingerprints.

Matching small (partial) fingerprints to full pre-enrolled images in the database has several problems: (i) the number of minutia points available in such prints is few, thus reducing its discriminating power; (ii) loss of singular points (core and delta) is likely and therefore, a robust algorithm independent of these singularities is required; and (iii) uncontrolled impression environments result in unspecified orientations of partial fingerprints, and distortions like elasticity and humidity are introduced due to characteristics of the human skin.

A minutiae-based fingerprint matching system usually returns the number of matched minutiae on both query and reference fingerprints and uses it to generate similarity scores. Generally, more matched minutiae yield higher similarity scores. That is when the number of minutiae on both fingerprints is large we can confidently distinguish the genuine and imposter fingerprint using the number of matched minutiae. According to forensic guidelines, when two fingerprints have a minimum of 12 matched minutiae they are considered to have come from the same finger [3]. However, it is not reasonable to use an absolute number of matched minutiae alone in case of partial fingerprints. We must also consider the overlapped areas on both prints and the total distance between all the matched minutiae to obtain a similarity score.

In this paper, we discuss the various issues involved in the matching of such partial fingerprints. In Section 2, we outline our approach to partial fingerprint matching. A localized secondary feature matching is described. The secondary features are derived from minutiae features. It does not depend on global ridge structures (e.g. core and delta) making it suitable for matching partial fingerprints. The notion of dynamic tolerance area and generation of reliable similarity score is discussed. In Section 3, we briefly review the minimum-cost flow (MCF) problem in the context of fingerprint matching. This technique is applied to both secondary feature matching and the brute-force matching derived from minutiae features. Experimental results are presented in Section 4.

Section snippets

Partial fingerprint matching

Our system works on the minutiae-based representation of a fingerprint. Minutiae, in fingerprint context, are the various ridge discontinuities of a fingerprint. More than 100 different types of minutiae have been identified, among which ridge bifurcations and endings (Fig. 1) are the most widely used. Minutia-based representation of fingerprints is an ANSI-NIST standard [1], [4] and contains only local information without relying on global information such as singular points or center of mass

MCF

The matching of the minutiae feature points in fingerprints presents several unique challenges. Matching the feature points on two fingerprints is equivalent to finding the correspondences between the feature points (Fig. 11). The numbers of feature points on query and reference fingerprints are rarely equal and therefore not every feature point finds a matched feature point. Thus, obtaining an optimal pairing is not trivial even when two fingerprints are aligned.

The most important rule of

Results

Our system has been tested on fingerprint databases of FVC2002 [3]. The DB1 database contains 110 different fingers and 8 impressions of each finger yielding a total of 880 fingerprints (388pixels×374pixels) at 500 dots-per-inch. The DB2 database has the same number of fingerprint images as DB1 but at different size and resolution (296pixels×560pixels at 569 dpi). Each database has two different sets: A and B. Set A contains the fingerprint images from the first 100 fingers, while Set B has the

Summary

Automated partial fingerprint identification is a problem that is not yet solved for generic applications. Proposed matching algorithms overcome the drawbacks of conventional approaches to partial fingerprint matching by using localized “secondary features” and a flow network based brute-force matching. The secondary features and matching algorithm have the following advantages: (i) secondary features are generated from minutiae, so can be easily adapted to existing applications; (ii) secondary

References (19)

  • A.M. Bazen et al.

    Fingerprint matching by thin-plate spline modeling of elastic deformations

    Pattern Recognition

    (2003)
  • A.V. Goldberg

    An efficient implementation of a scaling minimum-cost flow algorithm

    J. Algorithms

    (1997)
  • American National Standard for Information Systems, Data format for the interchange of fingerprint information, Doc#...
  • Biometrika inc., A technical evaluation of fingerprint scanners, http://www.biometrika.it/eng/wp_scfing.html, Monte...
  • D. Maltoni et al.

    Handbook of Fingerprint Recognition

    (2003)
  • A.K. Jain et al.

    An identity-authentication system using fingerprints

    Proc. IEEE

    (1997)
  • J.H. Wegstein, An automated fingerprint identification system, U.S. Government Publication, U.S. Department of...
  • X. Luo, J. Tian, Y. Wu, A minutia matching algorithm in fingerprint verification, Proceedings of the International...
  • Z.M. Kovács-Vajna

    A fingerprint verification system based on triangular matching and dynamic time warping

    IEEE Trans. Pattern Anal. Mach. Intell.

    (2000)
There are more references available in the full text version of this article.

Cited by (217)

  • High Precision Fingerprint Verification for Small Area Sensor Based on Deep Learning

    2024, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
View all citing articles on Scopus
View full text