摘要
利用碎片像素灰度值构成的矩阵二范数最小的原则,研究了传统碎片拼接复原算法的不足,提出改进的碎片拼接复原配对算法.对碎纸机规则切割的碎片进行两两配对,找到复原后第一张图片,通过编程得到碎片的正确拼接顺序.利用MATLAB软件进行计算机仿真,验证方法的有效性.
By using pixel gray value matrix fragments to constitute the minimum number of principles two-norm, inadequate restoration of traditional stitching algorithm debris was investigated, and improved fragments splicing restoration matching algorithm two were put forward. Pairwise matching was done on shredded paper, then the first picture restored was found, and correct splicing sequences fragments were derived by programming. At last, MATLAB software was used to simulate the whole algorithm, and the simulation results demonstrate the validity of this method.
出处
《南阳师范学院学报》
CAS
2014年第3期22-24,共3页
Journal of Nanyang Normal University
关键词
二范数
碎片拼接复原
配对算法
two-norm
fragments stitching recovery
MATLAB
matching algorithm
