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

单页单面汉字纵横切碎片拼接复原算法
引用本文:杨雯雯,陶佳琪,郑路通,孙国伟,买阿丽.单页单面汉字纵横切碎片拼接复原算法[J].运城学院学报,2013(5):16-20.
作者姓名:杨雯雯  陶佳琪  郑路通  孙国伟  买阿丽
作者单位:运城学院应用数学系,山西运城044000
基金项目:山西省教学改革研究项目(J2012098);运城学院科研基金项目(FZ-2012005,YQ-2012020,JY-2011030,JG-201204)
摘    要:对于纵切汉字碎片依汉字的方正特征进行复原,对于纵横切汉字的碎片根据空行和汉字位置对碎片进行分组,并建立边界像素点匹配度进行组内碎片拼接,最后利用边界汉字宽度进行组间拼接。并对两个实际例子进行了拼接试验,试验结果表明该算法是有效的。

关 键 词:0-1化  边界宽度匹配  边界像素点匹配  边界截断位置匹配

Algorithm for Reassembly of Longitudinally and Transversely Cutting Chinese Character Fragments on a Single-sided Paper
Institution:YANG Wen - wen, TAO Jia - qi, ZHENG Lu - tong, SUN Guo - wei, MAI A - li ( Department of Applied Mathematics, Yuncheng University, Yuncheng 044000, China)
Abstract:For the Longitudinally cutting Chinese characteristics of Chinese characters. For longitudinally character fragments, we reconstructed them by Founder and transversely cutting Chinese character fragments, we group them by the blank lines and the position of Chinese characters. And establish the boundary pixels matc-hing to reassemble fragments in every group. Finally, we reassemble these fragments between groups by using the width of Chinese characters on the boundary. This algorithm is applied in two stitching experiments for frag-ments. The result shows that the algorithm is efficient.
Keywords:Boundary width matching  Boundary pixels matching  Upper boundary truncation matching  
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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