Fingerprint identification using graph matching

摘要

A new algorithm for automated fingerprint encoding and matching is presented. The algorithm is intended to be insensitive to imperfections introduced during fingerprint registration, such as noise, distortion and displacement. A fingerprint is represented in the form of a graph whose nodes correspond to ridges in the print. Edges of the graph connect nodes that represent neighboring or intersecting ridges. Hence the graph structure captures the topological relationships within the fingerprint. The algorithm has been implemented and tested using a library of real-life fingerprint images.