检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]厦门理工学院应用数学学院,福建厦门361024
出 处:《厦门理工学院学报》2014年第3期103-108,共6页Journal of Xiamen University of Technology
基 金:厦门理工学院科研基金项目(XKJJ201001)
摘 要:引入边缘相似度概念,利用贪婪算法,解决中英文文件纵向切割后的碎纸片拼接还原问题.对于同时发生纵横向切割的中英文碎纸片,先利用着色反转法对碎纸片文字部分进行反转处理,再利用行聚类筛选法对碎纸片按行匹配度进行分类,最后对每一类碎纸片利用贪婪算法并辅之以人工干预,将碎纸片拼接还原.单面英文碎纸片拼接还原结果表明,该方法人工干预次数少,还原效率高、效果好.A new conception of the edge similarity is introduced. When a file with Chinese or English font is cut into scraps in the vertical direction, the Greedy Algorithm is an efficient method to restore the file by the edge similarity. When a file is cut into many scraps in both vertical and horizontal directions, it can be recovered in this process. First, the Reversed Tinting Method ( RTM) is applied to reverse the body-size parts on the scraps. Second, all the scraps is classified into some sets by the Row Clustering and Screening( RCS) . Last, using the Greedy Algorithm and with the help of artificial interventions , the scraps in every set can be edge joined into a well orderd line. It shows that this edge joined method has the advantage of fewer times artificial interventions, more efficiency and better effect.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3