Two-layer assignment method for online Chinese character recognition

Author

Liu, J.Z. ; Ma, K. ; Cham, W.K. ; Chang, M.M.Y.

Author_Institution

Sch. of Mech. & Production Eng., Nanyang Technol. Inst., Singapore

Volume

147

Issue

1

fYear

2000

fDate

2/1/2000 12:00:00 AM

Firstpage

47

Lastpage

54

Abstract

A method of stroke order and number-free online recognition of Chinese characters is proposed. Both input characters and model characters are represented with complete relational graphs (CRGs). Classification of an input character can be implemented by matching its CRG against every CRG of the model base. However, efficient algorithms for graph matching are not available. Therefore, the graph-matching problem is transformed into a two-layer assignment problem and is solved with the Hungarian method. Two complexity reduction schemes are presented to save computational time. Tests demonstrate the efficiency of the proposed method

Keywords

computational complexity; graph theory; handwritten character recognition; image classification; Hungarian method; classification; complete relational graphs; complexity reduction schemes; computational time; efficiency; efficient algorithms; graph matching; input characters; model characters; number-free online recognition; online Chinese character recognition; stroke order; two-layer assignment method;

fLanguage

English

Journal_Title

Vision, Image and Signal Processing, IEE Proceedings -

Publisher

iet

ISSN

1350-245X

Type

jour

DOI

10.1049/ip-vis:20000103

Filename

842717