抄録
H-053
Recovering Drawing Order from Static Handwritten Images Using Probabilistic Tabu Search
○名古屋孝幸（鳥取環境大）・藤岡寛之（福岡工大）
This paper considers the problem of recovering a drawing order from static handwriting images with single stroke. The problem is analyzed and solved by employing the so-called graph theoretic approach. The central issue is to obtain the smoothest path of stroke from a graph model of input handwriting image. We first introduce an index on double-traced lines. Then, it is shown that the graph is transformed to a semi-Eulerian graph. Thus, the restoration problem reduces to maximum weight matching problem. Such a problem is solved by a probabilistic tabu search.