摘要
提出了一种度量波形相似度的新算法，并用于中文签名真伪识别．该算法将波形切割成一串相关联的峰一谷一峰（Ｖ－Ｐ－Ｖ）子元，通过插入、删除和替代三种操作的代价来计算两串的距离，由此得到两波形的相似度．算法的时间复杂性为Ｏ（ｎ×ｍ），ｎ与ｍ分别为两波形串的子元数目．文中给出的Ｖ－Ｐ－Ｖ算法已用于中文签名真伪识别系统，并获得了满意的结果．
new algorithm to measure the mismatch between two waveforms used for the Chinese signature verification is proposed. The algorithm represents a waveform with a string of V-P-V(valley-peak-valley)unit and calculates the distance between two strings by the penalty of three operations:insertion,deletion and substitution. The algorithm is implemented with dynamic programming(DP) and its time complexity is O(n ×m), where n and m are the numbers of the two strings respectively. The result of using V-P-V for Chinese signature verification is presented.
出处
《复旦学报（自然科学版）》
CAS
CSCD
北大核心
1996年第5期496-502,共7页
Journal of Fudan University：Natural Science
基金
国家自然科学基金
