首页 | 本学科首页   官方微博 | 高级检索  
     

基于折线切分路径的粘连搭接字符切分算法的研究
引用本文:刘阳兴. 基于折线切分路径的粘连搭接字符切分算法的研究[J]. 计算机应用研究, 2011, 28(10): 3998-4000. DOI: 10.3969/j.issn.1001-3695.2011.10.110
作者姓名:刘阳兴
作者单位:南开大学微电子学研究所,天津,300457
摘    要:针对粘连和搭接字符切分算法的不足,提出一种基于折线切分路径的字符切分算法。该算法利用投影法将粘连搭接字符与非粘连搭接字符分离开,而后结合粘连搭接字符独有的外形特征,通过引入惩罚权重的路径搜索算法快速而准确地得到粘连搭接字符间的折线切分路径;为了避免一些字符在以上的切分过程中被误切碎,利用识别反馈信息对一些字符子图像进行合并。实验结果表明,该算法对印刷体日英混排字符切分有很强的适应性,取得了较理想的切分效果。

关 键 词:字符切分;字符识别;粘连搭接字符;折线切分路径

Non-linear partitioning path based approach for touching and kerned character segmentation
LIU Yang-xing. Non-linear partitioning path based approach for touching and kerned character segmentation[J]. Application Research of Computers, 2011, 28(10): 3998-4000. DOI: 10.3969/j.issn.1001-3695.2011.10.110
Authors:LIU Yang-xing
Affiliation:LIU Yang-xing(Institute of Microelectronics,Nankai University,Tianjin 300457,China)
Abstract:Segmentation of touching and kerned characters has been the most difficult problem in character segmentation.This paper presented a novel approach based on exploiting non-linear partitioning paths to segment touching and kerned characters.Firstly,employed character projection to isolate touching and kerned characters with other characters.Then in order to find the correct non-linear segmentation path of touching and kerned characters,used a heuristic method seeking minimal-penalty curved cut to determine ca...
Keywords:character segmentation   character recognition   touching and kerned characters   curve-based partitioning path
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号