摘要
讨论了彩色图像的精确拼接问题,针对拼接时重叠区域和拼接线附近出现的模糊、错位、穿越等问题,提出了根据待拼接图像重叠区域像素点邻域内的颜色和纹理作为特征的能量计算公式,并提出树形搜索方向的动态寻找最优拼接线算法。实验部分将提出的算法与其他方法进行了对比,结果表明,该方法不仅可以很好地克服掉上述"鬼影"问题,解决寻找拼接线时出现的穿越现象,也可以最大限度地实现拼接线两侧图像间的过渡连续。
This paper discusses the image stitching. Due to the problems that overlapping area becomes fuzzy or dislocated when stitching the images, a new energy calculation formula whose characteristics is based on pixel’s color and texture which belongs to the neighborhood pixels in image overlap area is put forward. And an algorithm of dynamically searching the direction to find the optimal stitching line is put forward. The experiment section includes comparisons between this method and others. The result demonstrates that this method can not only overcome the problem of“ghosting”, but also achieve the transition between both sides of the stitching line naturally.
作者
孙培双
韩其睿
SUN Peishuang;HAN Qirui(School of Computer Science & Software Engineering, Tianjin Polytechnic University, Tianjin 300387, China)
出处
《计算机工程与应用》
CSCD
北大核心
2016年第21期218-221,234,共5页
Computer Engineering and Applications
基金
国家自然科学基金(No.51378350)
关键词
图像拼接
能量计算
最优拼接线
动态规划
image stitching
energy calculation
best stitching line
dynamic programming