By Topic

The Pattern Recognition of Chinese Characters by Markov Chain Procedure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yung-Lung Ma ; Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan, Republic of China.

The recognition and learning of Chinese characters are much more difficult than that of a check due to their complexity in the construction of features and lack of interrelationship and overall rules. The same words, written in different styles and habits by two persons, might be taken to be different words in the eyes of the scribes. It is important not only that the Chinese character be recognized, but also that it be recognized quickly and correctly by a simple program. An advanced procedure for recognition by use of the Markov chain procedure is presented.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-4 ,  Issue: 2 )