摘要
详细阐述针对规则纵切的碎纸片的一种恢复方法。该算法先将图像转码为对应的像素矩阵,并且将矩阵二值化处理。接着根据文字笔画的连续性计算碎纸边缘信息的匹配度矩阵,再根据文本间的连续性,计算出碎纸片之间的相似度矩阵。最后结合匹配度矩阵与相似度矩阵的信息,当以某张进行匹配时,其相应的下一张是既高度符合匹配度矩阵又高度符合相似度矩阵的,从而实现对碎纸的拼接复原。经过碎纸拼接试验验证,效果良好,方法准确便捷,是可行的。
This article elaborates on a method of recovery for torn slivers of rules. The algorithm first transforms the image into the corresponding pixel matrix, and the matrix is processed by two vales. Next, according to the continuity of text strokes, the matching matrix of edge information is calculated, and then the similarity matrix between fragments is calculated according to the continuity between texts. Finally, combining the information of matching degree matrix and similarity matrix, when matching a certain piece, the corresponding next one is highly consistent with the matching degree matrix as well as the similarity matrix, so as to achieve the splicing and restoration of broken paper. The verification of experimental shredding stitching shows that the effect is good, the method is accurate and convenient. It is feasible.
作者
刘威
王军民
刘克勤
LIU Wei;WANG Jun-min;LIU Ke-qin(College of Geophysics and Petroleum Resources, Yangtze University, Wuhan 430100, China)
出处
《计算机与现代化》
2019年第2期55-59,共5页
Computer and Modernization
基金
国家自然科学基金资助项目(41674107)
关键词
碎纸拼接
边缘匹配
二值化
shredded paper stitching
edge matching
binaryzation
