Fast match-on-card technique using in-matcher clustering with ISO minutia template

T. Chen, W. Yau, Xudong Jiang
{"title":"Fast match-on-card technique using in-matcher clustering with ISO minutia template","authors":"T. Chen, W. Yau, Xudong Jiang","doi":"10.1504/IJBM.2015.070925","DOIUrl":null,"url":null,"abstract":"Fingerprint match-on-card is receiving more attention from society because of higher level of security and less privacy concern. The ISO/IEC19794-2 for match-on-card defines the minutiae data format that contains the basic information. Therefore, match-on-card is a challenge, especially when dealing with deformation and common correspondence for alignment. In this paper, a novel in-matcher clustering method is proposed to search for the matched minutia clusters to cater for deformation. Moreover, a further matching step using Mahalanobis distance to measure the inter-cluster similarity is proposed to remove the wrongly matched clusters. Finally, the overall match score is generated by combining the scores from matched clusters and the geometrical structure of clusters. The proposed algorithm achieved an average EER ⇐ 5.1979% using all FVC databases. In the NIST evaluation, the achieved false match rate FMR = 0.001 and false non-match rate FNMR = 0.08 and the average on-card verification time is 1.01s using 8-bit smartcard.","PeriodicalId":262486,"journal":{"name":"Int. J. Biom.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Biom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJBM.2015.070925","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Fingerprint match-on-card is receiving more attention from society because of higher level of security and less privacy concern. The ISO/IEC19794-2 for match-on-card defines the minutiae data format that contains the basic information. Therefore, match-on-card is a challenge, especially when dealing with deformation and common correspondence for alignment. In this paper, a novel in-matcher clustering method is proposed to search for the matched minutia clusters to cater for deformation. Moreover, a further matching step using Mahalanobis distance to measure the inter-cluster similarity is proposed to remove the wrongly matched clusters. Finally, the overall match score is generated by combining the scores from matched clusters and the geometrical structure of clusters. The proposed algorithm achieved an average EER ⇐ 5.1979% using all FVC databases. In the NIST evaluation, the achieved false match rate FMR = 0.001 and false non-match rate FNMR = 0.08 and the average on-card verification time is 1.01s using 8-bit smartcard.
使用ISO细节模板的匹配器聚类的快速卡片匹配技术
指纹卡匹配由于安全性高、隐私问题少,越来越受到社会的关注。用于卡片匹配的ISO/IEC19794-2定义了包含基本信息的详细数据格式。因此,卡上匹配是一个挑战,特别是在处理变形和常见的对齐对应时。本文提出了一种新的匹配内聚类方法来搜索匹配的细节聚类,以适应变形。此外,提出了利用马氏距离度量聚类间相似性的进一步匹配步骤,以去除错误匹配的聚类。最后,将匹配的聚类得分与聚类的几何结构相结合,生成总体匹配分数。该算法在所有FVC数据库中均达到了平均EER = 5.1979%。在NIST评估中,使用8位智能卡,实现了误匹配率FMR = 0.001,误不匹配率FNMR = 0.08,平均卡上验证时间为1.01s。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信