摘要
格线删除是计算机自动笔迹鉴定系统预处理过程中的关键步骤。在分析已有的手写汉字文本格线删除算法利弊的基础上,采用Pavlid is提出的块邻接图表示法来进行格线删除,并提出了格线删除后的笔画重构算法。该算法首先采用链表结构将笔迹图像保存为块邻接图;然后根据该邻接图搜索出满足条件的连通子图,这些连通子图就是需要删除的格线;最后再对因格线删除而断开的笔画进行重构。由于块邻接图只需进行一次水平或垂直扫描就能获得,因此格线的搜索和删除非常迅速;同时该算法还考虑了格线删除后的笔画重构,这样既删除了笔迹图像中的干扰信息,又不改变笔迹图像的特征。实验结果显示,该方法具有很强的抗干扰能力,对格线的删除非常有效。
Erasing grid-line is a key in the Chinese handwriting auto-identify system. After analyzing the advantages and disadvantages of the existed grid-line erasing algorithm we present a grid-line erasing algorithm based on the block adjacency graph（BAG） devised by Pavlidis and the stroke reconstruction algorithm in this paper. Firstly, the scanning graph for Chinese handwriting is changed into the BAG by use of the chain structure, and then the proper Connected Sub- graph according to the BAG is searched. These connected sub-graphs are the grid-lines that should be erased. Finally, the strokes, which left by erasing grid-line, are reconstructed. Because it is easy to get the BAG, searching and erasing gridlines will be very fast. At the same time, our algorithm can reconstruct the strokes after erasing grid-line, and it not only avoids the disturbing information but also remains the useful characters of Chinese handwriting. Experimental results show our algorithm has strong ability in anti-disturbance and good effect in erasing grid-lines.
出处
《中国图象图形学报》
CSCD
北大核心
2006年第4期549-554,共6页
Journal of Image and Graphics
基金
国家"973"计划项目(2004CB719404)
关键词
块邻接图
格线删除
连通子图
笔画重构
block adjacency graph（ BAG）, erasing grid-lines, connected sub-graph, stroke reconstruction
