Dynamical scaling in on-line hand-written characters´ matching

On-line signature verification and/or recognition of handwritten characters are becoming more and more important in the network society. When these problems are considered, one fundamental method will be to find the corresponding points between the test one and the template. For this purpose, we proposed a matching method using DP (dynamic programming) matching and dynamical scaling parameters. This paper supplements the scaling aspect and the numerical examples that will support the validity of this method.