基于最大梯度和灰度相关的两步全景图拼接算法  

Two-Pass Mosaic Algorithm of Panoramic Image Using Maximum Grads and Intensity Correlation

作　　者：薛峰[1] 张佑生[1] 江巨浪[1] 偶春生[1] 

机构地区：[1]合肥工业大学计算机与信息学院,合肥230009

出　　处：《系统仿真学报》2005年第12期2965-2968,共4页Journal of System Simulation

基　　金：国家自然科学基金项目(50379003);安徽省教育厅自然科学基金(2005kj216)。

摘　　要：提出一种基于最大梯度和灰度相关的两步全景图拼接算法。该算法综合了基于灰度相关和特征相关算法的优点,首先通过匹配梯度最大值点位置的梯度值缩小搜索范围,再利用最大灰度相关匹配两幅待拼接图像。实验表明,算法原理简单、拼接速度快,同时消除了对有重复纹理特征图像的伪拼接现象,对图像亮度差异具有很强的抗干扰能力,鲁棒性好。A two-pass mosaic algorithm of panoramic image using maximum grads and intensity correlation was proposed. The algorithm synthesized methods of intensity matching and feature matching image mosaic methods. First, by matching maximum grads of two images, a search range for successive intensity correlation matching process could be remarkably shrunken which made the whole matching process more speedy. Then intensity correlation matching algorithm was used to search the optimal matching position of two images. These two processes ensure the algorithm simple, fast, robust, and false matching can be avoid. Some experiments demonstrate the simplicity, speediness, and efficiency of the algorithm.

关 键 词：全景图 拼接 梯度 灰度相关 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]