ダイナミック・プログラミング・マッチング法による単語書記動作の分析
1993 年 64 巻 5 号 p. 351-359
詳細
1993 年 64 巻 5 号 p. 351-359
We examined the temporal invariance hypothesis in handwriting, using the dynamic programming (DP) matching algorithm. The DP matching algorithm was originally developed for the speech recognition to eliminate fluctuations of time axis caused by different speech rates. This algorithm can determine the optimal point-to-point correspondences (warping function) between the standard velocity pattern and different patterns. We found that this algorithm worked well for various velocity patterns, even when their total writing time was different from the standard pattern. Only 30 to 50 percents of handwriting movements showed temporal invariance. The writing movements which didn't show temporal invariance consisted of several sub-motor units. The borders between the units were not limited near the end of each letter. The results suggest that handwriting of a word does not show the temporal invariance and that it is executed by some discrete sub-motor units.
