Fingerprint matching using a geometric subgraph mining approach

Abstract

In the present work, a new representation of fingerprints in form of geometric graph, is proposed. This representation is obtained by fusing two previously defined approaches found in the literature and proves to be very tolerant to occlusions and distortions in the minutiae. Also, a novel matching fingerprint algorithm that uses geometric graphs was introduced. The mentioned algorithm applies frequent geometric subgraph mining in order to match fingerprint representations for computing a final similarity score. The introduced proposal reports very promising accuracy values and it applies a new approach allowing many future improvements.