Skip to main content

Stroke Correspondence Based on Graph Matching for Detecting Stroke Production Errors in Chinese Character Handwriting

  • Conference paper
Book cover Advances in Multimedia Information Processing – PCM 2007 (PCM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4810))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Law, N., Ki, W.W., Chung, A.L.S., Ko, P.Y., Lam, H.C.: Children’s stroke sequence errors in writing Chinese characters. Reading and Writing: An Interdisciplinary Journal, 267–292 (1998)

    Google Scholar 

  2. Tappert, C.C., Suen, C.Y., Wakahara, T.: The States of Art in One–Line Handwriting Recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 12, 787–808 (1990)

    Article  Google Scholar 

  3. Jianguo, L., Xiaozhen, Z.: The design and implementation of multimedia intelligent tutoring system for Chinese characters. In: IEEE Proc. of the 1st Intl. Conf. on Multi-Media Engineering Education, pp. 459–463 (1994)

    Google Scholar 

  4. Tzeng, C.-H., Hsu, L., Chen, C.-P., Uema, C.: A multimedia project in teaching Chinese and Japanese at Ball State University. In: IEEE Intl. Conf. on Multi Media Engineering Education, pp. 445–452 (1996)

    Google Scholar 

  5. Tang, K.–T., Leung, H.: A Web-based Chinese Handwriting Education System with Automatic Feedback and Analysis. In: ICWL. Intl. Conf. on Web-based Learning (2006)

    Google Scholar 

  6. Tan, C.K.: An algorithm for online strokes verification of Chinese characters using discrete features. In: 8th Intl. Workshop on Frontiers in Handwriting Recognition, pp. 339–344 (2002)

    Google Scholar 

  7. Teo, C.L., Burdet, E., Lim, H.P.: A robotic teacher of Chinese handwriting. HAPTICS, 335–341 (2002)

    Google Scholar 

  8. Coit, C.: Peer review in an online college writing course. In: IEEE Intl. Conf. on Advanced Learning Technologies, pp. 902–903 (2004)

    Google Scholar 

  9. Llados, J., Marti, E., Villanueva, J.J.: Symbol Recognition by Error–Tolerant Subgraph Matching between Region Adjacency Graphs. IEEE Trans. Pattern Analysis and Machine Intelligence 23, 1137–1143 (2001)

    Article  Google Scholar 

  10. Bunke, H.: Error Correcting Graph Matching: On the Influence of the Underlying Cost Function. IEEE Trans. Pattern Analysis and Machine Intelligence 21, 917–922 (1999)

    Article  Google Scholar 

  11. Messmer, B.T., Bunke, H.: A New Algorithm for Error–Tolerant Subgraph Isomorphism Detection. IEEE Trans. Pattern Analysis and Machine Intelligence 20, 493–504 (1998)

    Article  Google Scholar 

  12. Liao, S.X., Lu, Q.: A Study of Moment Function and Its Use in Chinese Character Recognition. In: ICDAR. Fourth International Conference Document Analysis and Recognition, pp. 572–575 (1997)

    Google Scholar 

  13. Tzouveli, P.K., Ntalianis, K.S., Kollias, S.D.: Human Video Object Watermarking Based on HU Moments. Signal Processing Systems Design and Implementation, 104–109 (2005)

    Google Scholar 

  14. Hu, M.K.: Visual Pattern Recognition by moment invariants. IEEE Trans. Inform. Theory 8, 179–187 (1962)

    Google Scholar 

  15. Ambauen, R., Fischer, S., Bunke, H.: Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification. In: IAPR Workshop (GbRPR), pp. 95–106 (2003)

    Google Scholar 

  16. Tsay, Y.T., Tsai, W.H.: Attributed String Matching by Split-and-Merge for On-line Chinese Character Recognition. IEEE Trans. PAMI 5, 180–185 (1993)

    Google Scholar 

  17. Tonouchi, Y., Kawamura, A.: An On-Line Japanese Character Recognition Method Using Length-Based Stroke Correspondence Algorithm. In: Proceedings of the Fourth Intl. Conf. on Analysis and Recognition, vol. 2, pp. 633–636 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Horace H.-S. Ip Oscar C. Au Howard Leung Ming-Ting Sun Wei-Ying Ma Shi-Min Hu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, Z., Leung, H., Xu, Y. (2007). Stroke Correspondence Based on Graph Matching for Detecting Stroke Production Errors in Chinese Character Handwriting. In: Ip, H.HS., Au, O.C., Leung, H., Sun, MT., Ma, WY., Hu, SM. (eds) Advances in Multimedia Information Processing – PCM 2007. PCM 2007. Lecture Notes in Computer Science, vol 4810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77255-2_89

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77255-2_89

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77254-5

  • Online ISBN: 978-3-540-77255-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics