Minimizing spatial deformation method for online signature matching

Authors:
Bin Li;Kuanquan Wang;David Zhang
Affiliations:
Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, China;Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, China;Department of Computing, The Hong Kong Polytechnic University, Kowloon, Hong Kong, SAR
Venue:
ICB'07 Proceedings of the 2007 international conference on Advances in Biometrics
Year:
2007

Citing 1
Cited 2

Online signature verification using a new extreme points warping technique

Pattern Recognition Letters

An efficient low cost approach for on-line signature recognition based on length normalization and fractional distances

Pattern Recognition
Feature Selection in a Low Cost Signature Recognition System Based on Normalized Signatures and Fractional Distances

ICB '09 Proceedings of the Third International Conference on Advances in Biometrics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Elastic matching is an important algorithm for online signature verification. Most of elastic matching algorithms are based on dynamic time warping(DTW). In this paper, we propose a new points matching algorithm for online signature verification. After resampling a signature with equidistant spacing, we describe the resampling point by its (3+1) demesional((3+1)D) information: 3D spatial information (x-axis, y-axis, time) and a feature vector. A soft-assign matrix and two special restrictions are introduced for recording the correspondence between two signatures. With a deterministic annealing framework, the mapping between two sets of (3+1)D signature points is achieved by minimizing the warping energy of the thin-plate spline(TPS). Experimental results demonstrate that the proposed algorithm outperforms the DTW-based matching algorithms.