Dynamic Character Model Generation for Document Keyword Spotting

  • Beom-Joon Cho
  • Bong-Kee Sin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3138)


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


Hide Markov Model Character Model Markov Random Field Document Image Optical Character Recognition 
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.


  1. 1.
    Lang, K., Waibel, A., Hinton, G.: A time delay neural network architecture for isolated word recognition. Neural Networks 3, 23–44 (1990)CrossRefGoogle Scholar
  2. 2.
    Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77, 257–286 (1989)CrossRefGoogle Scholar
  3. 3.
    Levin, E., Pieraccini, R.: Dynamic planar warping for optical character recognition. In: Proc. ICASSP, San Fransisco, CA, vol. 3, pp. 149–152 (1992)Google Scholar
  4. 4.
    Chellapa, R., Chatterjee, S.: Classification of textures using Gaussian Markov random fields. IEEE Trans. ASSP 33, 959–963 (1985)CrossRefGoogle Scholar
  5. 5.
    Agazzi, O.E., Kuo, S.: Hidden Markov model based optical character recognition in the presence of deterministic transformations. Pattern Recognition 26, 1813–1826 (1993)CrossRefGoogle Scholar
  6. 6.
    Xu, Y., Nagy, G.: Prototype extraction and adaptive OCR. IEEE Trans. PAMI 21, 1280–1296 (1999)Google Scholar
  7. 7.
    Lee, H.-K., Kim, J.H.: An HMM-based threshold model approach for gesture recognition. IEEE Trans. PAMI 21, 961–973 (1999)Google Scholar
  8. 8.
    Meyers, C.S., Rabiner, L.R.: A level building dynamic time warping algorithm for connected word recognition. IEEE Trans. ASSP 29, 284–297 (1981)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Beom-Joon Cho
    • 1
  • Bong-Kee Sin
    • 2
  1. 1.Department of Computer EngineeringChosun UniversityDong-ku, GwangjuKorea
  2. 2.Department of Computer MultimediaPukyong National UniversityBusanKorea

Personalised recommendations