1 April 2004 Study on the center of rotation method based on minimum spanning tree matching algorithm for fingerprint recognition
Author Affiliations +
Abstract
The minimum spanning tree (MST) matching algorithm has been used for searching the partial matching points extracted from fingerprint images. The method, however, has some limitations. To obtain the relationship between the enrolled fingerprints and the input fingerprints the MST is used to generate the tree graph that represents the unique graph for the given minutiae. From the graph, the matching points are estimated. However, the shape of the graph highly depends on the positions of the minutiae. If there are some pseudo minutiae caused by noise, the shape of the graph will be totally different. To overcome the limitations of the MST, we propose the center of rotation method (CRM) that finds true partial matching points. The proposed method is based on the assumption that the input fingerprint minutiae are rigid body. In addition, we employ the polygon wrapping the minutiae for fast matching speed and reliable matching results. In conclusion we have been able to confirm fast performance and high identification ratio by using CRM.
© (2004) Society of Photo-Optical Instrumentation Engineers (SPIE)
Choonsuk Oh, Choonsuk Oh, Young Kee Ryu, Young Kee Ryu, } "Study on the center of rotation method based on minimum spanning tree matching algorithm for fingerprint recognition," Optical Engineering 43(4), (1 April 2004). https://doi.org/10.1117/1.1668280 . Submission:
JOURNAL ARTICLE
8 PAGES


SHARE
Back to Top