Dynamic Time Warping is a mathematical optimisation technique for sequentially structured problems, which has, over the years, played a major role in providing primary algorithms for automatic signature verification. As this useful method of non-linear, elastic time alignment, still has a high computational complexity due to the repetitive nature of its operations for the optimisation process, this paper proposes an algorithm using a pipeline paradigm this being chosen with the intention of overcoming possible dead-locks in the highly distributed network. The algorithm was implemented on a transputer network on the Meiko Computing Surface using Occam2, which resulted in a reduction of time complexity by an order of magnitude.
['Y. J. Bae', 'Michael C. Fairhurst']
Parallelism in dynamic time warping for automatic signature verification