A fast and elastic fingerprint matching algorithm using minutiae-centered circular regions

The International Conference on Emerging Security Information, Systems, and Technologies (SECUREWARE 2007) Pub Date : 2007-10-14 DOI:10.1109/SECUREWARE.2007.4385335

Haiyong Chen, Hongwei Sun, K. Lam

{"title":"A fast and elastic fingerprint matching algorithm using minutiae-centered circular regions","authors":"Haiyong Chen, Hongwei Sun, K. Lam","doi":"10.1109/SECUREWARE.2007.4385335","DOIUrl":null,"url":null,"abstract":"Reliably and fast matching fingerprints is still a challenging problem in a fingerprint verification system. This paper proposes a minutiae matching algorithm that uses minutiae-centered circular regions to help ensure the speed of matching and the robustness to non-linear distortion. In our method, a circular region is constructed around each minutia, which can be regarded as a secondary feature. Using the constructed regions, the proposed algorithm can find matched minutiae more rapidly via regional matching. Since each minutia's region is formed from only a small area of the fingerprint, our algorithm is more tolerant to non-linear distortion when compared to global matching approaches. On the other hand, the area of the constructed region is much larger than that of local neighborhood in local matching approaches, which means that circular region, including a larger subnet of minutiae, is more reliable and distinct feature. Experiment results show our algorithm 's good performance on processing speed and accuracy.","PeriodicalId":257937,"journal":{"name":"The International Conference on Emerging Security Information, Systems, and Technologies (SECUREWARE 2007)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The International Conference on Emerging Security Information, Systems, and Technologies (SECUREWARE 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECUREWARE.2007.4385335","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

Abstract

Reliably and fast matching fingerprints is still a challenging problem in a fingerprint verification system. This paper proposes a minutiae matching algorithm that uses minutiae-centered circular regions to help ensure the speed of matching and the robustness to non-linear distortion. In our method, a circular region is constructed around each minutia, which can be regarded as a secondary feature. Using the constructed regions, the proposed algorithm can find matched minutiae more rapidly via regional matching. Since each minutia's region is formed from only a small area of the fingerprint, our algorithm is more tolerant to non-linear distortion when compared to global matching approaches. On the other hand, the area of the constructed region is much larger than that of local neighborhood in local matching approaches, which means that circular region, including a larger subnet of minutiae, is more reliable and distinct feature. Experiment results show our algorithm 's good performance on processing speed and accuracy.

查看原文本刊更多论文

一种基于小中心圆区域的快速弹性指纹匹配算法

在指纹验证系统中，快速、可靠地匹配指纹仍然是一个具有挑战性的问题。为了保证匹配的速度和对非线性失真的鲁棒性，本文提出了一种利用最小中心圆区域的细节匹配算法。在我们的方法中，在每个细节周围构造一个圆形区域，可以将其视为次要特征。利用构造的区域，通过区域匹配可以更快地找到匹配的细节。由于每个细节区域仅由指纹的一小块区域形成，因此与全局匹配方法相比，我们的算法对非线性失真的容忍度更高。另一方面，在局部匹配方法中，构造区域的面积要比局部邻域的面积大得多，这意味着圆形区域包含更大的细节子网，具有更可靠、更鲜明的特征。实验结果表明，该算法在处理速度和精度方面具有良好的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

The International Conference on Emerging Security Information, Systems, and Technologies (SECUREWARE 2007)

自引率

0.00%

发文量