By Topic

Two-layer assignment method for online Chinese character recognition

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
$33 $33
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

4 Author(s)
J. Z. Liu ; Sch. of Mech. & Production Eng., Nanyang Technol. Inst., Singapore ; K. Ma ; W. K. Cham ; M. M. Y. Chang

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

Published in:

IEE Proceedings - Vision, Image and Signal Processing  (Volume:147 ,  Issue: 1 )