Two-layer assignment method for online Chinese character recognition

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.