This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Utilization of Hierarchical, Stochastic Relationship Modeling for Hangul Character Recognition
September 2004 (vol. 26 no. 9)
pp. 1185-1196
In structural character recognition, a character is usually viewed as a set of strokes and the spatial relationships between them. Therefore, strokes and their relationships should be properly modeled for effective character representation. For this purpose, we propose a modeling scheme by which strokes as well as relationships are stochastically represented by utilizing the hierarchical characteristics of target characters. A character is defined by a multivariate random variable over the components and its probability distribution is learned from a training data set. To overcome difficulties of the learning due to the high order of the probability distribution (a problem of curse of dimensionality), the probability distribution is factorized and approximated by a set of lower-order probability distributions by applying the idea of relationship decomposition recursively to components and subcomponents. Based on the proposed method, a handwritten Hangul (Korean) character recognition system is developed. Recognition experiments conducted on a public database show the effectiveness of the proposed relationship modeling. The recognition accuracy increased by 5.5 percent in comparison to the most successful system ever reported.

[1] R. Plamondon and S.N. Srihari, On-Line and Off-Line Handwriting Recognition: A Comprehensive Survey IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 1, pp. 63-84, Jan. 2000.
[2] J.T. Favata and G. Srikantan, A Multiple Feature/Resolution Approach to Handprinted Digit and Character Recognition Int'l J. Imaging Systems and Technology, vol. 7, pp. 304-311, 1996.
[3] J. Park, V. Govindaraju, and S.N. Srihari, OCR in a Hierarchical Feature Space IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 4, pp. 400-407, Apr. 2000.
[4] W.J. Christmas, J. Kittler, and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749–764, Aug. 1995.
[5] W.H. Tsai and K.S. Fu, Attributed Grammar: A Tool for Combining Syntactic and Statistical Approaches to Pattern Recognition IEEE Trans. Systems, Man and Cybernetics, vol. 10, no. 12, pp. 873-885, 1980.
[6] H. Nishida, Shape Recognition by Integrating Structural Descriptions and Geometrical/Statistical Transforms Computer Vision and Image Understanding, vol. 64, no. 2, pp. 248-262, 1996.
[7] H.Y. Kim and J.H. Kim, Hierarchical Random Graph Representation of Handwritten Characters and Its Application to Hangul Recognition Pattern Recognition, vol. 34, no. 2, pp. 187-201, 2001.
[8] P. Foggia, C. Sansone, F. Tortorella, and M. Vento, Combining Statistical and Structural Approaches for Handwritten Character Description Image and Vision Computing, vol. 17, no. 9, pp. 701-711, 1999.
[9] F.H. Cheng, Multi-Stroke Relaxation Matching Method for Handwritten Chinese Character Recognition Pattern Recognition, vol. 31, no. 4, pp. 401-410, 1998.
[10] H.J. Lee and B. Chen, Recognition of Handwritten Chinese Characters via Short Line Segments Pattern Recognition, vol. 25, no. 5, pp. 543-552, 1992.
[11] X. Zhang and Y. Xia, The Automatic Recognition of Handprinted Chinese Characters A Method of Extracting an Order Sequence of Strokes Pattern Recognition Letters, vol. 1, no. 4, pp. 259-265, 1983.
[12] C.L. Liu, I.-J. Kim, and J.H. Kim, Model-Based Stroke Extraction and Matching for Handwritten Chinese Character Recognition Pattern Recognition, vol. 34, no. 12, pp. 2339-2352, 2001.
[13] Q. Wang, Z. Chi, D.D. Feng, and R. Zhao, Hidden Markov Random Field Based Approach for Off-Line Handwritten Chinese Character Recognition Proc. 15th Int'l Conf. Pattern Recognition, vol. 2, pp. 347-350, 2000.
[14] I.-J. Kim and J.H. Kim, Statistical Utilization of Structural Neighborhood Information for Oriental Character Recognition Proc. Fourth Int'l Workshop Document Analysis Systems, pp. 303-312, 2000.
[15] S.-J. Cho and J.H. Kim, Bayesian Network Modeling of Strokes and Their Relationships for On-Line Handwriting Recognition Proc. Sixth Int'l Conf. Document Analysis and Recognition, pp. 86-90, 2001.
[16] K.-S. Fu, Y.T. Chien, and G.P. Cardillo, A Dynamic Programming Approach to Sequential Pattern Recognition IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 3, pp. 313-326, 1986.
[17] J. Pearl, Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference. Morgan Kaufmann, 1988.
[18] P.J. Krause, Learning Probabilistic Networks Knowledge Eng. Rev., vol. 13, no. 4, pp. 321-351, 1998.
[19] C.K. Chow and C.N. Liu,"Approximating discrete probability distributions with dependence trees," IEEE Trans. Information Theory, vol. 14, no. 3, pp. 462-467, May 1968.
[20] H.-J. Kang, K. Kim, and J.H. Kim, A Framework for Probabilistic Combination of Multiple Classifiers at an Abstract Level Eng. Applications of Artificial Intelligence, vol. 10, no. 4, pp. 379-385, 1997.
[21] K.P. Murphy, Inference and Learning in Hybrid Bayesian Networks Technical Report CSD-98-990, Dept. of Computer Science, Univ. of California Berkeley, 1998.
[22] L.-H. Chen and J.-R. Lieh, Handwritten Character Recognition Using a 2-Layer Random Graph Model by Relaxation Matching Pattern Recognition, vol. 23, no. 11, pp. 1189-1205, 1990.
[23] S.W. Lu, Y. Ren, and C.Y. Suen, Hierarchical Attributed Graph Representation and Recognition of Handwritten Chinese Characters Pattern Recognition, vol. 24, no. 7, pp. 617-632, 1991.
[24] K.-W. Kang, J.-W. Suh, and J.H. Kim, Skeletonization of Grayscale Character Images Using Pixel Superiority Index Proc. Third Int'l Workshop Document Analysis Systems, pp. 326-335, 1998.
[25] D.-I. Kim and S.-W. Lee, Automatic Evaluation of Handwriting Qualities of Handwritten Hangul Image Database, KU-1 Proc. Sixth Int'l Workshop Frontiers in Handwriting Recognition, pp. 455-464, 1998.
[26] T.K. Moon, The Expectation-Maximization Algorithm in Signal Processing IEEE Signal Processing Magazine, vol. 13, no. 6, pp. 47-60, 1996.
[27] H.-S. Park and S.-W. Lee, Off-Line Recognition of Large-Set Handwritten Characters with Multiple Hidden Markov Models Pattern Recognition, vol. 29, no. 2, pp. 231-244, 1996.
[28] S.H. Kim, Recognition of Korean Address Strings by Tight-Coupling of Minimum Distance Classification and Dictionary-Based Post-Processing Int'l J. Computer Processing of Oriental Languages, vol. 12, no. 2, pp. 207-221, 1998.

Index Terms:
Pattern recognition, handwritten character recognition, stochastic relationship modeling, hierarchical character representation, Hangul character recognition.
Citation:
Kyung-Won Kang, Jin H. Kim, "Utilization of Hierarchical, Stochastic Relationship Modeling for Hangul Character Recognition," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1185-1196, Sept. 2004, doi:10.1109/TPAMI.2004.74
Usage of this product signifies your acceptance of the Terms of Use.