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 correspon...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition 1986, Vol.19 (2), p.113-122
Main Authors: Isenor, D.K., Zaky, S.G.
Format: Article
Language:English
Subjects:
Encoding
Fingerprint recognition
Graph matching
Identification
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0031-3203
1873-5142
DOI:10.1016/0031-3203(86)90017-8