摘要
指纹细节匹配算法是自动指纹识别系统 (AFIS)中一项关键的任务 ,目前存在大量的研究和算法 .依据算法是否依赖中心点 ,指纹细节点匹配算法可以分为两类 :基于中心点的匹配算法和非中心点匹配算法 .大多数非中心点匹配算法都非常耗时 ,因此不适合在线应用 .而基于中心点方法的效率相对较高 ,但是这类算法极度依赖于中心点的定位精度 .在本文中 ,提出了一种全新的基于中心点的指纹细节结构匹配算法 ,该算法综合了基于中心点匹配算法和非中心点匹配算法的优点 ,同时又避免了二者的缺点 .首先利用中心点检测算法获得中心点的位置 ,然后在中心区域定义了一些局部的结构 ,同时利用这些局部结构寻找指纹细节的对应点 ,并通过对应点和中心点的相对关系来确认这些对应细节点 .其次利用这些细节对应点匹配全局的细节信息 ,最后 ,利用匹配细节的全局距离和距离方差来判决最终匹配结果 .实验结果表明 ,算法的匹配效果非常好 ,同时匹配效率较高 。
Fingerprint matching algorithm is a key issue of the fingerprint recognition, there already exist many study about fingerprint matching algorithms. According to dependence on core point, fingerprint matching algorithms can be grouped into two categories: core-based match algorithms and structure-based match algorithms. Most of the structure-based matching algorithms are time consuming, therefore they are not suitable for on-line application. Meanwhile, core-based matching algorithm is more efficient than the structure-based matching algorithm, but it highly depends on core point detection precision. We present a new core-based structure matching algorithm which both considers efficient and precision. Firstly, we use core point detection algorithm to find the core point and define some local minutiae structures around core point. Through matching these local minutiae structures, we can get some corresponding points of the two fingerprint images. Secondly, we use the corresponding points to match the global feature of fingerprints, where a match table is constructed to prevent one to many false minutiae match. Finally, we promote the global match distance and global match distance variance to help make the final decision. Experimental result shows that the performance of the proposed algorithm is good.
出处
《自动化学报》
EI
CSCD
北大核心
2003年第6期842-850,共9页
Acta Automatica Sinica
基金
SupportedbyCreativeFoundationofChineseAcademyofSciences ,theProjectofInstituteofAutomation
