Consensus fingerprint matching with genetically optimised approach

  • Authors:

  • W. Sheng;G. Howells;M. C. Fairhurst;F. Deravi;K. Harmer

  • Affiliations:

  • School of Engineering and Design, Brunel University, Uxbridge, London UB8 3PH, UK;Department of Electronics, University of Kent, Canterbury, Kent CT2 7NT, UK;Department of Electronics, University of Kent, Canterbury, Kent CT2 7NT, UK;Department of Electronics, University of Kent, Canterbury, Kent CT2 7NT, UK;Department of Electronics, University of Kent, Canterbury, Kent CT2 7NT, UK

  • Venue:
  • Pattern Recognition
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Fingerprint matching has been approached using various criteria based on different extracted features. However, robust and accurate fingerprint matching is still a challenging problem. In this paper, we propose an improved integrated method which operates by first suggesting a consensus matching function, which combines different matching criteria based on heterogeneous features. We then devise a genetically guided approach to optimise the consensus matching function for simultaneous fingerprint alignment and verification. Since different features usually offer complementary information about the matching task, the consensus function is expected to improve the reliability of fingerprint matching. A related motivation for proposing such a function is to build a robust criterion that can perform well over a variety of different fingerprint matching instances. Additionally, by employing the global search functionality of a genetic algorithm along with a local matching operation for population initialisation, we aim to identify the optimal or near optimal global alignment between two fingerprints. The proposed algorithm is evaluated by means of a series of experiments conducted on public domain collections of fingerprint images and compared with previous work. Experimental results show that the consensus function can lead to a substantial improvement in performance while the local matching operation helps to identify promising initial alignment configurations, thereby speeding up the verification process. The resulting algorithm is more accurate than several other proposed methods which have been implemented for comparison.