一种基于灰度的碎纸片拼接算法  

Algorithm Design on Scraps of Paper Splicing Based on Grey Level

作　　者：刘秋菊[1] 余建熙[2] 王仲英[2] 

机构地区：[1]中州大学信息工程学院,河南郑州450000 [2]河南经贸职业学院技术科学系,河南郑州450018

出　　处：《实验室研究与探索》2016年第7期16-19,共4页Research and Exploration In Laboratory

基　　金：国家自然科学基金项目(11001075)

摘　　要：提出了一种解决碎纸片拼接复原的方法。首先对相邻碎纸片的文字行特征进行筛选,把每块碎纸片作为图的一个节点,建立了基于文字行特征的网格图模型。考虑两面碎片的行线匹配情况来缩小可匹配碎纸片集合,将正反两面相似度函数值相加作为碎纸片的相似度,当相似度函数值达到最小时说明两碎纸片字迹断线的灰度值之差最小。引入模拟退火机制对可匹配碎纸片集合最佳拼接方案进行优化处理。研究结果表明:该方法可以解决复杂的碎纸片拼接问题。In this paper, an approach of recovery of paper scraps was proposed. First of all, adjacent bits of paper text line feature were selected, and each piece of paper was used as a node of the graph. It established a grid graph model based on the line feature of text, and narrowed the set of matching scraps of paper by considering both sides of pieces line the matching. Function values of both positive and negative similarity were added as similarity of scraps of paper, when the similarity function value reached minimum. It shows the difference of gray value of two scraps of paper writing disconnection can reach the minimum. Finally, the simulated annealing mechanism was introduced to optimize the matching process of the set of matching pieces of paper. The results showed that the algorithm can solve the problem of more complex scraps of splicing.

关 键 词：纸片拼接 行特征 相似度函数 灰度值 

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