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 [1], 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 forward seeking implementation is more efficient, offering significantly reduced processing complexity as well as slightly improved verification performance. © IFIP International Federation for Information Processing 2005.
Cite
CITATION STYLE
Cho, D. U., Bae, Y. L. J., & Ko, I. S. (2005). The modified DTW method for On-line automatic signature verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3779 LNCS, pp. 335–342). Springer Verlag. https://doi.org/10.1007/11577188_48
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
