English

应用科学学报 ›› 2006, Vol. 24 ›› Issue (2): 187-192.

• 论文 • 上一篇    下一篇

基于串匹配的特殊点匹配和自由伪造签名快速排除法

全中华1,2, 黄德双1, 张广政1,2   

  1. 1. 中科院智能机械研究所, 安徽合肥 230031;
    2. 中国科学技术大学自动化系, 安徽合肥 230031
  • 收稿日期:2004-11-27 修回日期:2005-04-22 出版日期:2006-03-31 发布日期:2006-03-31
  • 作者简介:全中华,博士生,研究方向:模式识别与人工智能,E-mail:quanzhonghua@iim.ac.cn;黄德双,博士,研究员,博导,研究方向:神经网络、进化计算与模式识别,E-mail:dshuang@iim.ac.cn
  • 基金资助:
    国家自然科学基金(60472111;60405002)项目资助

Approximate String Match of Special Points in Signatures and Random Forgery Elimination

QUAN Zhong-hua1,2, HUANG De-shuang1, ZHANG Guang-zheng1,2   

  1. 1. Institute of Intelligent Machine, Chinese Academy of Science, Hefei 230031, China;
    2. Department of Automation, University of Science and Technology of China, Hefei 230031, China
  • Received:2004-11-27 Revised:2005-04-22 Online:2006-03-31 Published:2006-03-31

PDF

68

被引次数

4

摘要： 在手写签名认证中,特殊点的抽取和匹配具有非常重要的意义,因为特殊点不仅可以作为签名的一种特征,还可以作为分段、签名对齐的依据.该文提出一种基于串匹配的方法对签名的特殊点序列进行匹配,提高了特殊点匹配的精度.同时通过计算特殊点类型所组成的字符串的编辑距离,能够很快地发现与真签名差距较大的自由伪造签名,从而提高整个系统的反应速度.

关键词: 串匹配, 签名认证, 动态规划

Abstract: For on-line signature verification, extraction and matching of special points is one of the most important problems.Because the special points can be regarded as features, and used as references in segmentation and alignment. This paper proposed an approach based on approximate string match to match the sequence of special points.By calculating the edit distance between strings consisting of the types of special points, this method can quickly detect random forgeries.This can improve the speed of the system.

Key words: string match, dynamic programming, signature verification

中图分类号: