Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/11552
Title: Minimizing spatial deformation method for online signature matching
Authors: Li, B
Wang, K
Zhang, D 
Keywords: (3+1)D information
Deterministic annealing
Signature verification
Thin-plate spline
Warping energy
Issue Date: 2007
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2007, v. 4642 LNCS, p. 646-652 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
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.
Description: 2007 International Conference on Advances in Biometrics, ICB 2007, Seoul, 27-29 August 2007
URI: http://hdl.handle.net/10397/11552
ISBN: 9783540745488
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Oct 16, 2017

Page view(s)

34
Last Week
2
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.