Recovering Drawing Order of Single-Stroke Handwritten Images Using Probabilistic Tabu Search
Recovering Drawing Order of Single-Stroke Handwritten Images Using Probabilistic Tabu Search
复制标题
DOI：
10.4304/jmm.8.2.73-81
复制
发表时间：
2012-06
期刊：
影响因子：
--
通讯作者：
Takayuki Nagoya;H. Fujioka
中科院分区：
文献类型：
--
作者：
Takayuki Nagoya;H. Fujioka
研究了单笔静态手写体图像的绘制顺序恢复问题。这样的笔画可以包括所谓的双描线（D线）。利用图论方法对该问题进行了分析和求解。然后，从输入的手写图像的图模型中获得最平滑的笔画路径。首先，通过图像处理技术从输入图像构造图模型。然后，我们局部地分析了图的结构。特别地，通过引入“D线指数”的思想，提出了识别D线的方法。该方法使我们能够将任何具有D-线的图转换为半欧拉图。然后，恢复问题归结为全局计算完美匹配的最大权重集合的问题。为了解决这样的问题，我们提出了一种方法，使用概率禁忌搜索算法。通过实验研究验证了该方法的有效性和实用性。
This paper considers the problem for recovering a drawing order of static handwritten images with single stroke. Such a stroke may include the so-called double-traced lines (D-lines). The problem is analyzed and solved by employing the graph theoretic approach. Then the central issue is to obtain the smoothest path of stroke from a graph model of input handwritten images. First, the graph model is constructed from an input images by image processing techniques. Then, we locally analyze the structure of graph. In particular, the method to identify D-lines is developed by introducing the idea of 'D-line index'. The method enables us to transform any graphs with D-lines to semi-Eulerian graphs. Then, the restoration problem reduces to the problem of globally computing the maximum weight collection of perfect matchings. For solving such a problem, we propose a method using a probabilistic tabu search algorithm. The effectiveness and usefulness of the proposed method are examined by some experimental studies.