An Efficient Indexing Scheme Based on K-Plet Representation for Fingerprint Database

Fingerprints are now widely employed in the security fields. A typical police fingerprint database may contain millions of template fingerprints. Consequently, fingerprint indexing plays an essential role to improve the performance of matching such a huge database. In this paper, the efficient index tree based on k-plet local patterns of minutiae for fingerprint database is proposed. The proposed algorithm is of robustness since the k-plet is translation-invariant and rotation-invariant, moreover, the multipath indexing strategy is introduced at the stage of indexing. As well, it is quite fast and effective due to look-up operation instead of complex computation. The performance testing was conducted in the datasets of FVC2002 DB1, NIST DB4 and NIST DB14, which concluded that the proposed algorithm is advantageous for fingerprint indexing since it achieves a high correct index performance with a fairly low penetration rate.