The Modified DTW Method for on-line Automatic Signature Verification


The KIPS Transactions:PartB , Vol. 10, No. 4, pp. 451-458, Aug. 2003
10.3745/KIPSTB.2003.10.4.451,   PDF Download:

Abstract

Dynamic Programming Matching (DPM) is a mathematical optimization technique for sequentially structured problems, which has, over the years, played a major role in providing primary algorithms in pattern recognition fields. Most practical applications of this method in signature verification have been based on the practical implementational version proposed by Sakoe and Chiba [9], and is usually applied as a case of slope constraint p = 0. We found, in this case, a modified version of DPM by applying a heuristic (forward seeking) implementation is more efficient, offering significantly reduced processing complexity as well as slightly improved verification performance.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. D. Ug and B. Y. Lae, "The Modified DTW Method for on-line Automatic Signature Verification," The KIPS Transactions:PartB , vol. 10, no. 4, pp. 451-458, 2003. DOI: 10.3745/KIPSTB.2003.10.4.451.

[ACM Style]
Jo Dong Ug and Bae Yeong Lae. 2003. The Modified DTW Method for on-line Automatic Signature Verification. The KIPS Transactions:PartB , 10, 4, (2003), 451-458. DOI: 10.3745/KIPSTB.2003.10.4.451.