By Topic

A heuristic algorithm for the recognition of printed Chinese characters

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

2 Author(s)
Chuang, C.-T. ; Dept. of Appl. Math., Nat. Chung-Hsing Univ., Taichung, Taiwan ; Tseng, L.Y.

A heuristic algorithm for the recognition of printed Chinese characters is presented. Preprocessing consists of identifying individual straight line primitive strokes of a Chinese character, and then identifying the sequence of occurrence of these primitive strokes in the course of two orthogonal and one diagonal scans. The results of the three scans are three ordered sets of primitive strokes that can be binary encoded. These three types of codes are called feature codes. The feature codes are used in the training phase and recognition phase by hashing. An experiment that trained on 13053 characters of a single font shows that only six pairs of characters have coincident feature codes. The recognition speed of this experiment is 44.4 milliseconds of 80386 CPU time per character (1,350 characters per minute excluding disk I/O time). The recognition rate is from 97.22% to 98.4%

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:25 ,  Issue: 4 )