...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Optical Engineering >Study on the center of rotation method based on minimum spanning tree matching algorithm for fingerprint recognition
【24h】

Study on the center of rotation method based on minimum spanning tree matching algorithm for fingerprint recognition

机译：Study on the center of rotation method based on minimum spanning tree matching algorithm for fingerprint recognition

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

The minimum spanning tree (MST) matching algorithm has been used for searching the partial matching points extracted from fingerprint images. The method, however, has some limitations. To obtain the relationship between the enrolled fingerprints and the input fingerprints the MST is used to generate the tree graph that represents the unique graph for the given minutiae. From the graph, the matching points are estimated. However, the shape of the graph highly depends on the positions of the minutiae. If there are some pseudo minutiae caused by noise, the shape of the graph will be totally different. To overcome the limitations of the MST, we propose the center of rotation method (CRM) that finds true partial matching points. The proposed method is based on the assumption that the input fingerprint minutiae are rigid body. In addition, we employ the polygon wrapping the minutiae for fast matching speed and reliable matching results. In conclusion we have been able to confirm fast performance and high identification ratio by using CRM.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号