.png){kind=icon}
返回
A robust alignment-free fingerprint hashing algorithm based on minimum distance graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2012.02.022.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The abstraction of a fingerprint in the form of a hash can be used for secure authentication. The main challenge is in finding the right choice of features which remain relatively invariant to distortions such as rotation, translation and minutiae insertions and deletions, while at the same time capturing the diversity across users. In this paper, an alignment-free novel fingerprint hashing algorithm is proposed which uses\ a graph comprising of the inter-minutia minimum distance vectors originating from the core point as a feature set called the minimum distance graph. Matching of hashes has been implemented using a corresponding search algorithm. Based on the experiments conducted on the FVC2002-DB1a and FVC2002-DB2a databases, we obtained an equal error rate of 2.27%. The computational cost associated with our fingerprint hash generation and matching processes is relatively low, despite its success in capturing the minutia positional variations across users. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Fingerprint
Hash
Minimum distance graph
Corresponding search algorithm
Security
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.4W
被引数:
4.5W
机构
引用论文
A hybrid biometric cryptosystem for securing fingerprint minutiae templates用于保护指纹细节模板的混合生物识别密码系统
OAAI
OAAI分享收藏Health risks of airplane boarding methods with apron buses when some passengers disregard safe social distancing.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏A Contact Model for the Effect of Particle Coating on Improving the Flowability of Cohesive PowdersOAAI
OAAI分享收藏
查看更多内容