中文

Journal of Applied Sciences ›› 2006, Vol. 24 ›› Issue (2): 187-192.

• Articles • Previous Articles     Next Articles

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

82

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

CLC Number: