CAJ | 학술논문

碎纸拼接是二维碎片拼接的典型问题。本文根据2013年高教杯全国大学生数学建模竞赛B题中提到的“碎纸片拼接问题”，针对碎纸片自动拼接，利用数学规划建模方法，建立碎纸片自动拼接的通用模型，以全局的匹配度为目标函数建立0-1规划拼接优化模型，建立了以所有碎片上下左右四边匹配的通用模型，同时利用信号处理-波谱原理分析的方法来扫描每一张图片，构建出基于最短距离聚类分析的贪婪算法寻求最优拼接方案，并通过实际运算验证了本文所提出改进型算法的有效性。
쇄지병접시이유쇄편병접적전형문제。본문근거2013년고교배전국대학생수학건모경새B제중제도적“쇄지편병접문제”，침대쇄지편자동병접，이용수학규화건모방법，건립쇄지편자동병접적통용모형，이전국적필배도위목표함수건립0-1규화병접우화모형，건립료이소유쇄편상하좌우사변필배적통용모형，동시이용신호처리-파보원리분석적방법래소묘매일장도편，구건출기우최단거리취류분석적탐람산법심구최우병접방안，병통과실제운산험증료본문소제출개진형산법적유효성。
Fragment reassembly is a typical problem of 2D fragments.In this paper,according to the 2013 Higher Education Cup National Undergraduate Mathematical Contest in modeling B title is mentioned in the"scraps of paper splicing problem",the scraps of paper automatic splicing,use planning mathematical model method,the general model of scraps of paper automatic splicing,the global matching degree as the objective function to establish 0-1 planning joint optimization model,and establish a general model to all the debris around the upper and lower edges matching,and using the method of treatment,principle of spectroscopy analysis of signal to scan each picture,construct the shortest distance greedy algorithm clustering analysis based on seeking the optimal stitching scheme,and through the actual operation shows that the effectiveness of the proposed algorithm.