期刊文献+

基于滑动窗口的动态手写签名局部相关性研究

Study on Local Correlation of On-line Handwriting Signature Based on Sliding Window
下载PDF
导出
摘要 为了解决直接序列匹配中签名序列存在随机波动和时间轴方向非均匀伸缩,导致相关分析给出的匹配度不高的问题,提出了采用滑动窗口对真实签名进行局部相关性分析的方法.将手写签名按压力划分成若干笔段,研究笔段匹配算法;对分段后的数据序列用滑动窗口算法进行局部相关分析.算例显示,对不同的签名个体而言,总有一些笔段的相关性极高,最小相关系数都达到0.8甚至0.9以上,这些笔段,正是签名者的稳定的签名特征,无论是相关分析法还是特征矢量分类法,滑动窗口局部相关分析都是一种有效的算法. In direct signature matching verification, data fluctuating at random and time wrapping nonlinearly will depress verification veracity of correlation analysis. Based on sliding window local correlation analysis of on-line handwriting signature is presented. Handwriting signature data sequence is segmented according to signature press; then the segments matching algorithm is studied. The process of the local correlation of signature based on sliding window is introduced. Examples reveal that there are always some 'segments that have very high correlation coefficient, minimum value up to 0.8 to 0.9, in one's signatures and those are just the steady signature characters of him. Based on sliding window local correlation analysis is an effective method for handwritten signature verification not only for correlation analysis verification but also for feature vector verification.
出处 《三峡大学学报(自然科学版)》 CAS 2006年第2期157-160,共4页 Journal of China Three Gorges University:Natural Sciences
关键词 在线手写签名 认证 滑动窗口 相关分析 on-line handwriting signature verification sliding window correlation analysis
  • 相关文献

参考文献9

二级参考文献33

  • 1张葵,金先级,裴先登.签名动态特征的特殊点抽取方法[J].计算机工程与应用,1997,33(6):38-41. 被引量:7
  • 2S Guha, N Koudas. Approximating a data stream for querying and estimation: Algorithms and performance evaluation. The 18th Int'l Conf on Data Engineering (ICDE), San Jose, California,2002
  • 3S Acharya, P B Gibbons, V Poosala, et al. Join synopses for approximate query answering. The 1999 ACM SIGMOD Int'l Conf on Management of Data, Philadelphia, Pennsylvania, 1999
  • 4S Chaudhuri, R Motwani, V Narasayya. On random sampling over joins. The 1999 ACM SIGMOD Int'l Conf on Management of Data, Philadelphia, Pennsylvania, 1999
  • 5N Alon, Y Matias, M Szegedy. The space complexity of approximating the frequency moments. The 28th Annual ACM Symp on Theory of Computing, Philadelphia, Pennsylvania, 1996
  • 6P Flajolet, G Martin. Probabilistic counting. The 24th Annual IEEE Symp on Foundations of Computer Science, Tucson,Arizona, 1983
  • 7Brian Babcock, Shivnath Babu, Mayur Datar. Models and issues in data stream system. ACM SIGMOD/PODS 2002 Conf,Madison, Winsconsin, 2002
  • 8J Kang, J Naughton, S Viglas. Evaluating window joins over unbounded stream. The 19th Int'l Conf on Data Engineering,Bangalore, India, 2003
  • 9Lukasz Golab, M Tamer Ozsu. Processing sliding window multijoins in continuous queries over data streams. Waterloo University, Tech Rep: CS-2003-01, 2003
  • 10Y Zhu, D Shasha. StatStream: Statistical monitoring of thousands of data streams in real time. The 28th Int' l Conf on Very Large Data Bases, Hong Kong, 2002

共引文献45

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部