Conference Paper

A novel approach to recover writing order from single stroke offline handwritten images

Univ. of Electro-Commun., Tokyo, Japan;
DOI: 10.1109/ICDAR.2005.25 Conference: Document Analysis and Recognition, 2005. Proceedings. Eighth International Conference on
Source: DBLP

ABSTRACT Problem of recovering the writing order from single-stroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel approach is proposed to solve the recovery problem within the framework of the edge contiguous relation (ECR). Firstly, we make local analyses to obtain the possible ECRs at each of the nodes; secondly a global trace is executed to find all of the candidate Euler paths and the smoothest one is selected as a final result. Based on two simple assumptions, we prove a series of theorems to obtain possible ECRs at even node. Double-traced lines are identified by using the weighted matching of general graph. Experiments on the scanned images and offline images converted from the online data of Unipen database have shown that our method achieved 95.2% correct recovery rate.

0 Bookmarks
 · 
89 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Resolution of different types of loops in handwritten script presents a difficult task and is an important step in many classic word recognition systems, writer modeling, and signature verification. When processing a handwritten script, a great deal of ambiguity occurs when strokes overlap, merge, or intersect. This paper presents a novel loop modeling and contour-based handwriting analysis that improves loop investigation. We show excellent results on various loop resolution scenarios, including axial loop understanding and collapsed loop recovery. We demonstrate our approach for loop investigation on several realistic data sets of static binary images and compare with the ground truth of the genuine online signal.
    IEEE Transactions on Pattern Analysis and Machine Intelligence 03/2009; 31(2):193-209. · 4.80 Impact Factor
  • Source
    03/2007: pages 143-164;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Restoration of writing order from a single-stroked handwriting image can be seen as the problem of finding the smoothest path in its graph representation. In this paper, a 3-phase approach to restore a writing order is proposed within the framework of the Edge Continuity Relation (ECR). In the initial, local phase, in order to obtain possible ECRs at an even-degree node, a neural network is used for the node of degree 4 and a theoretical approach is presented for the node of degree higher than 4 by introducing certain reasonable assumptions. In the second phase, we identify double-traced lines by employing maximum weighted matching. This makes it possible to transform the problem of obtaining possible ECRs at odd-degree node to that at even-degree node. In the final, global phase, we find all the candidates of single-stroked paths by depth first search and select the best one by evaluating SLALOM smoothness. Experiments on static images converted from online data in the Unipen database show that our method achieves a restoration rate of 96.0 percent.
    IEEE Transactions on Pattern Analysis and Machine Intelligence 12/2006; 28(11):1724-37. · 4.80 Impact Factor

Full-text

View
6 Downloads
Available from