iso 19794-2 指纹格式 [英] iso 19794-2 fingerprint format

查看:22
本文介绍了iso 19794-2 指纹格式的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我使用的是 iso 19794-2 指纹数据格式.所有数据均采用iso 19794-2格式.我有超过十万个指纹.我希望进行有效的搜索以识别匹配项.是否可以构造一个二叉树状结构来执行有效(最快)的匹配搜索?或建议我找到匹配的更好方法.并建议我一个开源的java api 来进行指纹匹配.帮我.谢谢.

解决方案

你有指纹匹配的背景吗?这不是一个简单的问题,您需要一些理论来解决这样的问题.看看这个介绍指纹匹配由博洛尼亚大学生物实验室(该领域的领先研究实验室)进行.

现在让我们回答您的问题,即如何提高搜索效率.

指纹可以根据其表现出的宏观奇异性的类型分为 5 个主要类别.

宏奇点分为三种类型:

  • whorl(一种圆形)
  • 循环(U 倒转)
  • delta(一种三向交叉)

根据这些宏观奇异点的位置,可以将指纹归入这些类:

  • 拱形
  • 帐篷拱门
  • 右循环
  • 左循环
  • 螺纹

一旦您将搜索范围缩小到正确的类别,您就可以进行匹配.从你的问题看来你必须做一个识别任务,所以恐怕你必须做所有的比较,或者添加一些预处理层(如我写的分类)以进一步缩小搜索字段.

您可以在 Maltoni 所著的指纹识别手册一书中找到许多有关指纹匹配的信息,Maio、Jain 和 Prabhakar - 该领域的领先研究人员.

为了读取 ISO 19794-2 格式,您可以使用 NIST 开发的一些名为 BiomDI 的实用程序,支持标准生物特征数据交换格式的软件工具.您可以尝试将其与开源匹配算法连接,例如在此生物识别 SDK 中找到的算法.然而,这需要大量工作,包括从一种格式转换为另一种格式以及算法的微调.

我的观点(作为一名从事生物识别的博士生)是,在该领域,您可以轻松编写代码,立即完成 60% 的需求,但剩下的 40% 将是:

  • 难写(20%);和
  • 没有金钱和时间真的很难写作 (20%).

希望有帮助!

编辑:添加了有关 NIST BiomDI 的信息

编辑 2:由于人们有时会通过电子邮件向我索要标准副本,遗憾的是我没有可以分享的.我只有一个链接到出售标准的 ISO 页面.

I am using iso 19794-2 fingerprint data format. All the data are in the iso 19794-2 format. I have more than hundred thousand fingerprints. I wish to make efficient search to identify the match. Is it possible to construct a binary tree like structure to perform an efficient(fastest) search for match? or suggest me a better way to find the match. and also suggest me an open source api for java to do fingerprint matching. Help me. Thanks.

解决方案

Do you have a background in fingerprint matching? It is not a simple problem and you'll need a bit of theory to tackle such a problem. Have a look at this introduction to fingerprint matching by Bologna University's BioLab (a leading research lab in this field).

Let's now answer to your question, that is how to make the search more efficient.

Fingerprints can be classified into 5 main classes, according to the type of macro-singularity that they exhibit.

There are three types of macro-singularities:

  • whorl (a sort of circle)
  • loop (a U inversion)
  • delta (a sort of three-way crossing)

According to the position of those macro-singularities, you can classify the fingerprint in those classes:

  • arch
  • tented arch
  • right loop
  • left loop
  • whorl

Once you have narrowed the search to the correct class, you can perform your matches. From your question it looks like you have to do an identification task, so I'm afraid that you'll have to do all the comparisons, or else add some layers of pre-processing (like the classification I wrote about) to further narrow the search field.

You can find lots of information about fingerprint matching in the book Handbook of Fingerprint Recognition, by Maltoni, Maio, Jain and Prabhakar - leading researchers in this field.

In order to read ISO 19794-2 format, you could use some utilities developed by NIST called BiomDI, Software Tools supporting Standard Biometric Data Interchange Formats. You could try to interface it with open source matching algorithms like the one found in this biometrics SDK. It would however need a lot of work, including the conversion from one format to another and the fine-tuning of algorithms.

My opinion (as a Ph.D. student working in biometrics) is that in this field you can easily write code that does the 60% of what you need in no time, but the remaining 40% will be:

  • hard to write (20%); and
  • really hard to write without money and time (20%).

Hope that helps!

Edit: added info about NIST BiomDI

Edit 2: since people sometimes email me asking for a copy of the standard, I unfortunately don't have one to share. All I have is a link to the ISO page that sells the standard.

这篇关于iso 19794-2 指纹格式的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆