Study on the center of rotation method based on minimum spanning tree matching algorithm for fingerprint recognition

作     者：Oh, CS Ryu, YK 

作者机构：SunMoon Univ Dept Elect Informat & Commun Engn Tanghchung Myun 336708 Asan Si Chungna South Korea 

出 版 物：《OPTICAL ENGINEERING》 (光学工程)

年 卷 期：2004年第43卷第4期

页      面：822-829页

核心收录：

学科分类：08[工学] 080401[工学-精密仪器及机械] 0804[工学-仪器科学与技术] 081102[工学-检测技术与自动化装置] 0811[工学-控制科学与工程] 0702[理学-物理学] 

基　　金：Sun Moon University  SMU 

主　　题：fingerprint matching algorithm center of rotation method minimum spanning tree fingerprint recognition 

摘      要：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. (C) 2004 Society of Photo-Optical Instrumentation Engineers.