基于聚类的模板生成,实现快速安全的指纹匹配

Debashis Das, S. Mukhopadhyay, G. P. Biswas
{"title":"基于聚类的模板生成,实现快速安全的指纹匹配","authors":"Debashis Das, S. Mukhopadhyay, G. P. Biswas","doi":"10.1145/2979779.2979803","DOIUrl":null,"url":null,"abstract":"Most of the fingerprint recognition systems depend on pair-wise matching of the minutia feature vectors which consist of several spatial properties associated with the minutia points. Due to various non-linear deformations like translation and rotation, minutia based matching is quite a challenging issue. To deal with this problem, most of the techniques in the literature solely depend upon a reference point selection. In this paper, we propose a novel cluster based template generation and matching algorithm which is invariant to translation and rotation of the minutia points. The cardinality of minutia clusters are stored as fingerprint template instead of minutia feature vectors. The stored template reveals no information regarding the spatial pattern of the fingerprint which provides a strong security against information leakage. Finally, a robust match score estimation technique is introduced to increase the matching efficiency. Moreover, the proposed method produces a faster execution. We present the performance on FVC2004 database to show the effectiveness of our method along with a comparative study against some other existing matching algorithms which establishes the efficacy of the proposed method.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Cluster based template generation for fast and secure fingerprint matching\",\"authors\":\"Debashis Das, S. Mukhopadhyay, G. P. Biswas\",\"doi\":\"10.1145/2979779.2979803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most of the fingerprint recognition systems depend on pair-wise matching of the minutia feature vectors which consist of several spatial properties associated with the minutia points. Due to various non-linear deformations like translation and rotation, minutia based matching is quite a challenging issue. To deal with this problem, most of the techniques in the literature solely depend upon a reference point selection. In this paper, we propose a novel cluster based template generation and matching algorithm which is invariant to translation and rotation of the minutia points. The cardinality of minutia clusters are stored as fingerprint template instead of minutia feature vectors. The stored template reveals no information regarding the spatial pattern of the fingerprint which provides a strong security against information leakage. Finally, a robust match score estimation technique is introduced to increase the matching efficiency. Moreover, the proposed method produces a faster execution. We present the performance on FVC2004 database to show the effectiveness of our method along with a comparative study against some other existing matching algorithms which establishes the efficacy of the proposed method.\",\"PeriodicalId\":298730,\"journal\":{\"name\":\"Proceedings of the International Conference on Advances in Information Communication Technology & Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Conference on Advances in Information Communication Technology & Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2979779.2979803\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2979779.2979803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

大多数指纹识别系统依赖于微小特征向量的成对匹配,这些特征向量由与微小点相关的多个空间属性组成。由于各种非线性变形,如平移和旋转,基于细节的匹配是相当具有挑战性的问题。为了解决这个问题,文献中的大多数技术仅仅依赖于参考点的选择。本文提出了一种新的基于聚类的模板生成与匹配算法,该算法不受细节点平移和旋转的影响。将特征聚类的基数存储为指纹模板而不是特征向量。所存储的模板不泄露指纹的空间模式信息,具有很强的防信息泄露的安全性。最后,引入了一种鲁棒匹配分数估计技术来提高匹配效率。此外,该方法的执行速度更快。我们给出了在FVC2004数据库上的性能,以显示我们的方法的有效性,并与其他一些现有的匹配算法进行了比较研究,从而确定了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cluster based template generation for fast and secure fingerprint matching
Most of the fingerprint recognition systems depend on pair-wise matching of the minutia feature vectors which consist of several spatial properties associated with the minutia points. Due to various non-linear deformations like translation and rotation, minutia based matching is quite a challenging issue. To deal with this problem, most of the techniques in the literature solely depend upon a reference point selection. In this paper, we propose a novel cluster based template generation and matching algorithm which is invariant to translation and rotation of the minutia points. The cardinality of minutia clusters are stored as fingerprint template instead of minutia feature vectors. The stored template reveals no information regarding the spatial pattern of the fingerprint which provides a strong security against information leakage. Finally, a robust match score estimation technique is introduced to increase the matching efficiency. Moreover, the proposed method produces a faster execution. We present the performance on FVC2004 database to show the effectiveness of our method along with a comparative study against some other existing matching algorithms which establishes the efficacy of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信