Fingerprints matching algorithm using a longest path problem

This paper presents a novel algorithm to fingerprint verification using longest path problem. Central to the proposed approach is the idea of the longest path searchin a specially constructed graph. A computational speed of the proposed approach considers 100 comparisons per second in average (Intel Core i5-2500 CPU @3.30 GHz 3.30GHz,4 Гб ОЗУ, ОС Windows 7). The proposed algorithm has been tested on a database FVC2002 DB1b of 80 fingerprints (8 fingerprints from 10 persons) and a database FTdb (5 fingerprints from 211 persons), demonstrating better performance then Astr-algorithm.