规则碎片拼接算法  

An Algorithm for Regular Fragments Reassembling

作　　者：李猛[1] 刘家保[2] 

机构地区：[1]合肥市统计局,合肥230071 [2]安徽新华学院公共课教学部,合肥230088

出　　处：《重庆工商大学学报（自然科学版）》2015年第8期43-48,共6页Journal of Chongqing Technology and Business University:Natural Science Edition

摘　　要：针对通过纵向切割、纵横交错切割等方法得到的碎纸片模型进行拼接复原,以碎片图形边缘像素点的匹配程度为判断依据,提出一种有效的算法,很好地解决了纵横切割所得到的规则碎片模型的拼接问题;在误差调整方面,提出了以计算机辅助人工进行较正取代单纯的人工较正,并给出了辅助算法;对非纵横切所得规则图片的拼接也从理论上提出了相应的算法。Only aiming at the paper fragment models based on the longitudinal cut method or the cnsscrosseocut method, according to the matching degree of the pixels on the edge of the graphics, this paper proposed anefficient fragments reassembling algorithm, which solves the problem of regular fragments reassembling bycrisscrossed cut. In the aspect of error regulation, a way of using the computer-aid manual work instead of the onlymanual adjustment and the auxiliary algorithm are proposed. Meanwhile, the corresponding algorithm for the regularfragments reassembling resulting from non-crisscrossed cut is theoretically put forward as well.

关 键 词：匹配率 碎片行分组 行匹配率 贪心法 

分 类 号：O157.5[理学—数学]