Abstract
This paper proposes a novel method of generating statistical Korean Hangul character models in real time. From a set of grapheme average images we compose any character images, and then convert them to P2DHMMs. The nonlinear, 2D composition of letter models in Hangul is not straightforward and has not been tried for machine-print character recognition. It is obvious that the proposed method of character modeling is more advantageous than whole character or word HMMs in regard to the memory requirement as well as the training difficulty. In the proposed method individual character models are synthesized in real-time using the trained grapheme image templates. The proposed method has been applied to key character/word spotting in document images. In a series of preliminary experiments, we observed the performance of 86% and 84% in single and multiple word spotting respectively without language models. This performance, we believe, is adequate and the proposed method is effective for the real time keyword spotting applications
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Lang, K., Waibel, A., Hinton, G.: A time delay neural network architecture for isolated word recognition. Neural Networks 3, 23–44 (1990)
Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77, 257–286 (1989)
Levin, E., Pieraccini, R.: Dynamic planar warping for optical character recognition. In: Proc. ICASSP, San Fransisco, CA, vol. 3, pp. 149–152 (1992)
Chellapa, R., Chatterjee, S.: Classification of textures using Gaussian Markov random fields. IEEE Trans. ASSP 33, 959–963 (1985)
Agazzi, O.E., Kuo, S.: Hidden Markov model based optical character recognition in the presence of deterministic transformations. Pattern Recognition 26, 1813–1826 (1993)
Xu, Y., Nagy, G.: Prototype extraction and adaptive OCR. IEEE Trans. PAMI 21, 1280–1296 (1999)
Lee, H.-K., Kim, J.H.: An HMM-based threshold model approach for gesture recognition. IEEE Trans. PAMI 21, 961–973 (1999)
Meyers, C.S., Rabiner, L.R.: A level building dynamic time warping algorithm for connected word recognition. IEEE Trans. ASSP 29, 284–297 (1981)
Sakoe, H.: Two-level DP-matching - a dynamic programming-based pattern matching algorithm for connected word recognition. IEEE Trans. on ASSP 27, 588–595 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cho, BJ., Sin, BK. (2004). Dynamic Character Model Generation for Document Keyword Spotting. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2004. Lecture Notes in Computer Science, vol 3138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27868-9_123
Download citation
DOI: https://doi.org/10.1007/978-3-540-27868-9_123
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22570-6
Online ISBN: 978-3-540-27868-9
eBook Packages: Springer Book Archive