Abstract
This paper considers the unsupervised classification of handwritten character strokes in regards to speed, since handwritten strokes prove challenging with their high and variable dimensions for classification problems. Our approach employs a robust feature detection method for brief classification. The dimension is reduced by selecting feature points among all the points within strokes, and thus the need to compare stroke signals between two different dimensions is eliminated. Although there are some remaining problems with misclassification, we safely classify strokes according to handwriting styles through a refinement procedure. This paper illustrates that the equalization problem, the severe difference in small parts between two strokes, can be ignored by summing all of the differences via our method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bahlmann, C., Burkhardt, H.: The Writer Independent Online Handwriting Recognition System Frog on Hand and Cluster Generative Statistical Dynamic Time Warping. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(3), 299–310 (2004)
Brault, J.J., Plamondon, R.: Segmenting Handwritten Signatures at Their Perceptually Important Points. IEEE Transactions on Pattern Analysis and Machine Intelligence archive 9, 953–957 (1993)
Hu, J., Ray, B., Han, L.: An Interweaved HMM/DTW Approach to Robust Time Series Clustering. In: Proceedings of the 18th International Conference on Pattern Recognition, vol. 3, pp. 145–148 (2006)
Kim, B.-H., Koo, K.-M., Park, Y.-M., Cha, E.-Y.: ‘A Study on Quantization Method Using ART2 for Contents-Based Image Retrieval’ (in Korean), in proceedings 22nd Conf. of Korea Information Processing Society, vol. 11(2) (2004)
Oates, T., Firoiu, L., Cohen, P.R.: Clustering Time Series with Hidden Markov Models and Dynamic Time Warping. In: Proceedings of the IJCAI 1999 Workshop on Neural, Symbolic and Reinforcement Learning Methods for Sequence Learning, pp. 17–21 (1999)
Perrone, M.P., Connell, S.D.: K-means clustering for Hidden Markov Models. In: Proceedings of the Seventh International Workshop on Frontiers in Handwriting Recognition, pp. 229–238 (2000)
Sakoe, H.: A Generalized Two-Level DP-Matching Algorithm for Continuous Speech Recognition. IEICE Transactions E65-E(11), 649–656 (1982)
Shin, J.: On-line Cursive Hangul Recognition that Uses DP Matching to Detect Key Segmentation Points. Pattern Recognition 37(11), 2101–2112 (2004)
Vuori, V., Oja, E.: Analysis of Different Writing Styles with the Self-Organizing Map. In: Proceedings of the 7th International Conference on Neural Information Processing, vol. 2, pp. 1243–1247 (2000)
Vuori, V., Laaksonen, J.: ‘A Comparison of Techniques for Automatic Clustering of Handwritten Characters’. In: The proceedings of the 16th International Conference on Pattern Recognition, pp. 168–171 (2002)
Vuurpijl, L., Schomaker, L.: Finding Structure in Diversity: a Hierarchical Clustering Method for The Categorization of Allographs in Handwriting. In: Proceedings of the 4th International Conference on Document Analysis and Recognition, pp. 387–393 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, WD., Shin, J. (2009). Fast Unsupervised Classification for Handwritten Stroke Analysis. In: Filipe, J., Cordeiro, J. (eds) Enterprise Information Systems. ICEIS 2009. Lecture Notes in Business Information Processing, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01347-8_76
Download citation
DOI: https://doi.org/10.1007/978-3-642-01347-8_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01346-1
Online ISBN: 978-3-642-01347-8
eBook Packages: Computer ScienceComputer Science (R0)