Comparative performance analysis of stroke correspondence search methods for stroke-order free online multi-stroke character recognition

作     者：Wenjie CA1 Seiichi UCHIDA Hiroaki SAKOE 

作者机构：Department of Advanced Information Technology Kyushu University Fukuoka-shi 819-0395 Japan 

出 版 物：《Frontiers of Computer Science》 (中国计算机科学前沿（英文版）)

年 卷 期：2014年第8卷第5期

页      面：773-784页

核心收录：

学科分类：1305[艺术学-设计学（可授艺术学、工学学位）] 0810[工学-信息与通信工程] 13[艺术学] 0808[工学-电气工程] 08[工学] 081104[工学-模式识别与智能系统] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081101[工学-控制理论与控制工程] 0701[理学-数学] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：cube search bipartite weighted matching indi-vidual correspondence decision stable marriage deviation-expansion model 

摘      要：For stroke-order free online multi-stroke charac- ter recognition, stroke-to-stroke correspondence search be- tween an input pattern and a reference pattern plays an im- portant role to deal with the stroke-order variation. Although various methods of stroke correspondence have been pro- posed, no comparative study for clarifying the relative su- periority of those methods has been done before. In this pa- per, we firstly review the approaches for solving the stroke- order variation problem. Then, five representative methods of stroke correspondence proposed by different groups, includ- ing cube search （CS）, bipartite weighted matching （BWM）, individual correspondence decision （ICD）, stable marriage （SM）, and deviation-expansion model （DE）, are experimen- tally compared, mainly in regard of recognition accuracy and efficiency. The experimental results on an online Kanji char- acter dataset, showed that 99.17%, 99.17%, 96.37%, 98.54%, and 96.59% were attained by CS, BWM, ICD, SM, and DE, respectively as their recognition rates. Extensive discussions are made on their relative superiorities and practicalities.