Stroke correspondence based on graph matching for detecting stroke production errors in Chinese character handwriting

  • Authors:
  • Zhihui Hu;Howard Leung;Yun Xu

  • Affiliations:
  • Dept. of Comp. Sci. and Techn., Univ. of Sci. & Techn. of China, Hefei, China and Joint Res. Lab of Excellence, CityU-USTC Advanced Research Inst., Suzhou, China and Dept. of Computer Science, Cit ...;Joint Research Lab of Excellence, CityU-USTC Advanced Research Institute, Suzhou, China and Department of Computer Science, City University of Hong Kong, Hong Kong, China;Department of Computer Science and Technology, University of Science & Technology of China, Hefei, China and Joint Research Lab of Excellence, CityU-USTC Advanced Research Institute, Suzhou, China

  • Venue:
  • PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

People may make mistakes in writing a Chinese character. In this paper, we apply error-tolerant graph matching to find the stroke production errors in people's handwriting of Chinese characters. A set of edit operations to transform one graph into another are defined for achieving this purpose. The matching procedure is denoted as a search problem of finding the minimum edit distance. The A* algorithm is used to perform the searching. Experiments show that the proposed method outperforms existing algorithms in identifying stroke production errors. The proposed method can help in Chinese handwriting education by providing feedback to correct users who have stroke production errors in writing a Chinese character.