期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Comparative performance analysis of stroke correspondence search methods for stroke-order free online multi-stroke character recognition 被引量:2
1
作者 Wenjie CA1 Seiichi UCHIDA Hiroaki SAKOE 《Frontiers of Computer Science》 SCIE EI CSCD 2014年第5期773-784,共12页
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 vari... 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. 展开更多
关键词 cube search bipartite weighted matching indi-vidual correspondence decision stable marriage deviation-expansion model
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部