Recovery of Drawing Order from Single-Stroke Handwriting Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Recovery of Drawing Order from Scanned Images of Multi-Stroke Handwriting
ICDAR '99 Proceedings of the Fifth International Conference on Document Analysis and Recognition
Recovering Writing Traces in Off-Line Handwriting Recognition: Using a Global Optimization Technique
ICPR '96 Proceedings of the International Conference on Pattern Recognition (ICPR '96) Volume III-Volume 7276 - Volume 7276
Digital Image Processing Using MATLAB
Digital Image Processing Using MATLAB
Recovering Dynamic Information from Static Handwritten Images
IWFHR '04 Proceedings of the Ninth International Workshop on Frontiers in Handwriting Recognition
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
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.