Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Reconstructing the Correct Writing Sequence from a Set of Chinese Character Strokes
verfasst von : Kai-Tai Tang, Howard Leung
Erschienen in: Computer Processing of Oriental Languages. Beyond the Orient: The Research Challenges Ahead
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.