Reconstructing the correct writing sequence from a set of chinese character strokes

  • Authors:
  • Kai-Tai Tang;Howard Leung

  • Affiliations:
  • Department of Computer Science, City University of Hong Kong, Hong Kong;Department of Computer Science, City University of Hong Kong, Hong Kong

  • Venue:
  • ICCPOL'06 Proceedings of the 21st international conference on Computer Processing of Oriental Languages: beyond the orient: the research challenges ahead
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A Chinese character is composed of several strokes ordered in a particular sequence. The stroke sequence contains useful online information for handwriting recognition and handwriting education. Although there exist some general heuristic stroke sequence rules, sometimes these rules can be inconsistent making it difficult to apply them to determine the standard writing sequence given a set of strokes. In this paper, we proposed a method to estimate the standard writing sequence given the strokes of a Chinese character. The strokes are modeled as discrete states with the state transition costs determined by the result of the classification into forward/backward order of each stroke pair using the positional features. Candidate sequences are found by shortest path algorithm and the final decision of the stroke sequence is made according to the total handwriting energy in case there is more than one candidate sequence. Experiments show that our results provide better performance than existing approaches.