期刊
PATTERN RECOGNITION
卷 40, 期 3, 页码 981-992出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2006.06.007
关键词
on-line signatures; biometric recognition; template matching; vector quantization; dynamic time warping
This paper studies some pattern recognition algorithms for on-line signature recognition: vector quantization (VQ), nearest neighbor (NN), dynamic time warping (DTW) and hidden Markov models (HMM). We have used a database of 330 users which includes 25 skilled forgeries performed by five different impostors. This database is larger than the typical ones found in the literature. Experimental results reveal that our first proposed combination of VQ and DTW (by means of score fusion) outperforms the other algorithms (DTW, HMM) and achieves a minimum detection cost function (DCF) value equal to 1.37% for random forgeries and 5.42% for skilled forgeries. In addition, we present another combined DTW-VQ scheme which enables improvement of privacy for remote authentication systems, avoiding the submission of the whole original dynamical signature information (using codewords, instead of feature vectors). This system achieves similar performance than DTW. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据