中文摘要：

目的针对图像拼接过程中，缝合线通过运动物体或配准不准确区域等情况导致融合图像出现鬼影、重影的问题，提出了一种基于差异图像加权的改进最佳缝合线算法，采用基于多分辨率和加权平均的分区图像融合算法解决了拼接线问题。方法首先将两幅图像的重叠区域划分为缝合线区域和过渡区域；在缝合线区域内，使用差异图像加权的最佳缝合线搜索准则构建准则值图像，基于动态规划思想来搜索得到最佳缝合线；基于缝合线生成掩码图像，并对重叠区域图像进行扩展，采用多分辨率融合算法实现了非严格重叠区域的融合；在过渡区域采用加权平均算法来消除拼接线。结果采用含有大量运动物体的图像序列对算法进行测试，实验结果表明，基于差分图像加权的最佳缝合线有效避开了大部分运动物体，当缝合线难以绕开运动物体时，能够尽量少地穿过运动物体；通过多分辨率和加权平均融合算法消除了拼缝等问题。结论提出的最佳缝合线算法能够有效地避免缝合线通过运动物体、配准不准确的区域，将多分辨率图像融合算法应用于非严格重叠图像融合，能够合成高质量的全景图像。

英文摘要：

Objective Image stitching can synthesize a panoramic image from multiple successive images and can be applied in many military and civil applications. The ghost problem exists in the overlap areas between two images being stitched when moving objects exist or a registration error occurs during image stitching. The issues of stitching line, color inconsist- ency, and so on occur when the camera exposure time and illumination change during imaging. These factors may affect the panoramic image if the images are simply fused. The improved image fusion technique, which is one of the key technologies in image stitching, can be used to solve these problems. Considering that the optimal seam algorithm is an effective meth- od, an improved optimal seam algorithm based on differential image weighting is proposed to solve the ghost problem （ seams pass through moving objects or inaccurate registration areas） in the classical optimal seam algorithm. A partition fusion algorithm based on multi-resolution fusion and weighted average fusion is presented to solve the stitching line problem caused by the change in exposure time and illumination. Method First, the images being stitched are mapped to a cylindri- cal surface after registration. The Harris comer is used to find correspondences between images. Second, the overlap areas between the image being stitched and the fused image are calculated and partitioned into three areas, namely, an optimal seam search area and two transition regions. The optimal seam search area is set to occupy three-fifth of the space, and the two transition regions occupy one-fifth each. Third, a differential image-weighted optimal seam algorithm is proposed to search for the optimal seam in the seam search regions. Aside from considering the difference in color and structure, the metric of computing the optimal seam for each pixel is also weighted by image difference. The weighting coefficient is set to infinity if this difference is above a certain threshold. Therefore, the moving-object region