Impact of singular point detection on fingerprint matching performance
A majority of the minutiae based fingerprint verification algorithms rely on explicit or implicit alignment of the minutiae points for matching the two prints. With no prior knowledge about point correspondences, this becomes a combinatorial problem. Global features of the fingerprints such as the core and delta points represent intrinsic points of reference that can be used to align the two prints and reduce the computational complexity of the matcher. However, automatic extraction of singular points is usually error prone and is therefore not used by existing matchers. But, a systematic study of the impact on matching performance when core/delta points are available has not been done to date. In this paper, we explore the effects of the availability of reliable core and delta points on speed and accuracy of a matching algorithm. Towards this end, we present significant improvements to core and delta point detection algorithm based on complex filtering principles originally proposed by Nilsson et al., (2005). We also present a modified graph based matching algorithm that can run in O(n) time when the reference points are available. We analyse the resulting improvement in computational complexity and present experimental evaluation over FVC2002 database. We show that there is upto 43% improvement (70.2 ms to 39.8 ms) in average verification time and almost no loss in accuracy when reliable core and delta points are used.