Ring Partition-Based Fingerprint Indexing Algorithm

The shear number of fingerprints in a modern database makes exhaustive search, a computationally an expensive process. It is in this context a new indexing mechanism is proposed to speed up the process of identification of fingerprints. In this model, concentric circles are made around the core of a fingerprint, and by grouping the fingerprints according to the number of minutiae points in each of these rings, we can select the best prospective fingerprints for a particular query fingerprint, thus greatly reducing the number of fingerprints in which exhaustive search is to be employed and increasing the speed of Automated Fingerprint Identification Systems (AFIS). The proposed model was tested on different datasets of FVC2000 database, and the results show that the model achieves high CIP with a low penetration rate and our model was able to significantly speed up the process.