检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]安徽师范大学数学计算机科学学院,安徽芜湖241000
出 处:《计算机应用》2014年第A02期269-270,290,共3页journal of Computer Applications
基 金:安徽省自然科学基金资助项目(11040606M137)
摘 要:针对一页规则的既纵切又横切的中文文件碎片和一页规则的双面打印的英文文件碎片,分别提出了一种基于行列图像的碎片匹配算法和二维图像成片连接匹配算法。首先将碎片边缘像素点转化成灰度值,然后对各碎片的灰度值进行匹配度研究,且将匹配度作为碎片之间拼接的依据,最后使用相应的算法计算机按碎片拼接顺序输出碎片号。通过实验分析表明,该算法能够更快地获得碎片拼接结果,大大提高拼接复原效率。Regarding one regular page of both longitudinal and transversal fragmentation of Chinese file fragments and one page of duplex printing document in English, this paper proposed a matching algorithm based on the fragment matching of the ranks and the piece connection for two-dimensional image. Firstly, this paper transformed pixels of the debris edge into the gray values, which were used as the basis of the matching degree of each fragments. And fragments matching depended on the matching degree. Finally, using the different matching algorithms, the computer output spliced sequence number. Through the experimental analysis, evidence shows that this model can get the result of fragments matching faster and greatly improve recovery efficiency.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42