A heuristic algorithm for the recognition of printed Chinese characters

Author

Chuang, Chen-Tsun ; Tseng, L.Y.

Author_Institution

Dept. of Appl. Math., Nat. Chung-Hsing Univ., Taichung, Taiwan

Volume

25

Issue

4

fYear

1995

fDate

4/1/1995 12:00:00 AM

Firstpage

710

Lastpage

717

Abstract

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%

Keywords

codes; feature extraction; optical character recognition; diagonal scan; feature codes; hashing; heuristic algorithm; orthogonal scan; printed Chinese characters recognition; straight line primitive strokes; Character recognition; Heuristic algorithms; Image recognition; Information processing; Mathematics; Personal communication networks; Printing; Shape; Timing; Writing;

fLanguage

English

Journal_Title

Systems, Man and Cybernetics, IEEE Transactions on

Publisher

ieee

ISSN

0018-9472

Type

jour

DOI

10.1109/21.370205

Filename

370205