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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
The structures and stroke sequence rules of Hanzi, The Commercial Press (HK) Ltd. (in Chinese), http://www.cp-edu.com/TW/CIKU/free_html/fl_hzjglx.asp
Liu, C.-L., Jaegerm, S., Nakagawa, M.: Online Recognition of Chinese Characters: The State-of-the-Art. IEEE Trans. Pattern Analysis and Machine Intelligence 26(2), 198–213 (2004)
Nakai, M., Akira, N., Shimodaira, H., Sagayama, S.: Substroke Approach to HMM-based On-line Kanji Handwriting Recognition. In: 6th Intl. Conf. on Document Analysis and Recognition, September 2001, pp. 491–495 (2001)
Artières, T., Gallinari, P.: Stroke level HMMs for on-line handwriting recognition. In: 8th Intl. Workshop on Frontiers in Handwriting Recognition, Niagara, August 2002, pp. 227–232 (2002)
Chen, Z., Lee, C.-W., Cheng, R.-H.: Handwritten Chinese character analysis and preclassification using stroke structural sequence. In: Proc. of 13th Intl. Conf. on Pattern Recognition, vol. 3, pp. 89–93 (1996)
Liu, Y.-J., Zhang, L.-Q., Tai, J.-W.: A new approach to on-line handwritten Chinese character recognition. In: Proc. of the 2nd Intl. Conf. on Document Analysis and Recognition, pp. 192–195 (1993)
Hung, K.-W., Leung, W.-N., Lai, Y.-C.: Boxing code for stroke-order free handprinted Chinese character recognition. In: IEEE Intl. Conf. on Systems, Man, and Cybernetics, October 8-11, vol. 4, pp. 2721–2724 (2000)
Lin, F., Tang, X.: Dynamic stroke information analysis for video-based handwritten Chinese character recognition. In: Proceedings of the 9th IEEE Intl. Conf. on Computer Vision, vol. 1, pp. 695–700 (2003)
Tappert, C.C., Suen, C.Y., Wakahara, T.: The state of the art in on-line handwriting recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 12, 787–808 (1990)
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)
Tsang, K., Leung, H.: Teaching Stroke Order for Chinese Characters by Using Minimal Feedback, In: Intl. Conf. on Web-based Learning (ICWL 2005), Hong Kong (August 2005)
Tang, K.-T., Li, K.-K., Leung, H.: A Web-Based Chinese Handwriting Education System with Automatic Feedback and Analysis. In: Liu, W., Li, Q., Lau, R.W.H. (eds.) ICWL 2006. LNCS, vol. 4181, pp. 176–188. Springer, Heidelberg (2006)
Shimomura, T.: Informatics: input and output: Science of the stroke sequence of Kanji. In: 8th Intl. Conf. on Computational Linguistics, pp. 270–273 (1980)
Lau, K.-K., Yuen, P.-C., Tang, Y.Y.: Stroke extraction and stroke sequence estimation on signatures. In: 16th Intl. Conf. on Pattern Recognition, August 2002, vol. 3, pp. 119–122 (2002)
Lau, K.-K., Yuen, P.-C., Tang, Y.-Y.: Universal Writing Model for Recovery of Writing Sequence of Static Handwriting Images. Intl. Journal of Pattern Recognition and Artificial Intelligence 19(5), 1–27 (2005)
Joe, M.-J., Lee, H.-J.: A combined method on the handwritten character recognition. In: Proc. of the 3rd Intl. Conf. on Document Analysis and Recognition, August 1995, vol. 1, pp. 112–115 (1995)
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley Interscience, Chichester (2000)
Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215–310. John Wiley and Sons Ltd., Chichester (1997)
Grefenstette, J., Gopal, R., Rosmaita, R., Gucht, D.: Genetic algorithms for the traveling salesman problem. In: Proceedings of the 2nd Intl. Conf. on Genetic Algorithms. Lawrence Eribaum Associates, Mahwah (1985)
Kardi, T.: Similarity Measurement, http://people.revoledu.com/kardi/tutorial/Similarity/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, KT., Leung, H. (2006). Reconstructing the Correct Writing Sequence from a Set of Chinese Character Strokes. In: Matsumoto, Y., Sproat, R.W., Wong, KF., Zhang, M. (eds) Computer Processing of Oriental Languages. Beyond the Orient: The Research Challenges Ahead. ICCPOL 2006. Lecture Notes in Computer Science(), vol 4285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940098_34
Download citation
DOI: https://doi.org/10.1007/11940098_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49667-0
Online ISBN: 978-3-540-49668-7
eBook Packages: Computer ScienceComputer Science (R0)