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.

No abstract

No abstract

No abstract