多笔画联机手写字符识别的动态时间规正算法(英文)  

A Dynamic Time Warping Algorithm for Recognition of Multi-Stroke On-Line Handwritten Characters

作　　者：Harold Mouchere 李锦鹏 Christian Viard-Gaudin 陈肇欣[1,2] 

机构地区：[1]IRCCyN Laboratory, LUNAM Universite, Universite de Nantes, Nantes 44300, France [2]华南理工大学电子与信息学院,广东广州510640

出　　处：《华南理工大学学报（自然科学版）》2013年第7期107-113,共7页Journal of South China University of Technology(Natural Science Edition)

摘　　要：在单笔画符号(或字符)联机手写识别中,动态时间规正(DTW)算法遵循时间次序约束和边界约束,并具有较高的识别率.为了将此算法应用于多笔画符号识别,常用而简单的方法是按照人们的手写顺序连接多笔画符号为单笔画符号.但此方法存在一个问题:人们常使用不同的笔画顺序和笔画方向书写同一个符号,用朴素(Brute Force)方法寻找所有笔画可能性非常耗时.为了降低计算复杂度,文中提出了DTW A*算法.在部分笔画匹配时,此算法保留着次序约束,并用A*算法降低计算复杂度.文中还通过流程图数据库多笔画符号识别实验对比了DTW A*算法、DTW算法、改良Hausdorff距离3种算法的性能,结果表明DTW A*算法具有最高的识别率和最好的稳定性.Dynamic time warping （DTW） is a famous algorithm to compare two mono-stroke symbols online. It obeys boundary and continuity constraints and possesses high recognition rate. The extension of DTW to multi- stroke symbols raises specific problems. A naive solution is to convert the multi-stroke symbol into a single one via a direct concatenation in the handwriting order. However, people may write a symbol in different stroke di- rections and orders. The application of a brute force method by searching all the possible directions and orders leads to prohibitive calculation times. To reduce the searching complexity, DTW A ＊ algorithm, which keeps the continuity constraint during each partial matching and reduces the searching complexity by using the A ＊ al- gorithm, is proposed and is then tested on a flowchart dataset containing multi-stroke symbols. The results indi- cate that DTW A ＊ algorithm helps to achieve the highest recognition rate and stability, as compared with such two other algorithms as DTW and modified Hausdorff distance.

关 键 词：模式识别 手写识别 动态时间规正 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]