计算机应用 ›› 2012, Vol. 32 ›› Issue (02): 499-503.DOI: 10.3724/SP.J.1087.2012.00499

• 图形图像技术 • 上一篇    下一篇

一种鲁棒的序列图像自动拼接方法

吴庆双1,2,3,付仲良3   

  1. 1. 安徽师范大学 国土资源与旅游学院,安徽 芜湖 241000
    2. 安徽自然灾害过程与防控研究省级实验室,安徽 芜湖 241000
    3. 武汉大学 遥感信息工程学院,武汉 430079
  • 收稿日期:2011-03-28 修回日期:2011-09-26 发布日期:2012-02-23 出版日期:2012-02-01
  • 通讯作者: 吴庆双
  • 作者简介:吴庆双(1980-),男,湖南永州人,讲师,博士研究生,主要研究方向:数字摄影测量、地理信息系统;
    付仲良(1965-),男,湖北麻城人,教授,博士,主要研究方向:图像分析与处理、地理信息系统。
  • 基金资助:
    国家自然科学基金资助项目(41171144);安徽省高等学校省级自然科学研究项目(KJ2010B349);安徽省自然地理和人文地理省级重点学科资助项目(Asdg1103);安徽师范大学创新基金资助项目(2010cxjj18)

Robust image sequence auto-mosaic method

WU Qing-shuang1,2,3,FU Zhong-liang3   

  1. 1. Anhui Key Laboratory of Natural Disaster Process and Prevention, Wuhu Anhui 241000, China
    2. College of Territorial Resources and Tourism, Anhui Normal University, Wuhu Anhui 241000, China
    3. School of Remote Sensing and Information Engineering, Wuhan University, Wuhan Hubei 430079, China
  • Received:2011-03-28 Revised:2011-09-26 Online:2012-02-23 Published:2012-02-01
  • Contact: WU Qing-shuang

摘要: 针对传统图像拼接方法中鲁棒性差、计算量大及自动化程度低等问题,提出一种鲁棒性高的序列图像自动拼接方法。该方法首先采用Harris角点检测算子对经Wallis滤波后的序列图像进行特征点提取,并结合Forstner算子对特征点进行精确定位。然后基于所提取的特征点,采用邻域灰度互相关法进行序列图像的特征点匹配,得到粗匹配点集,并运用RANSAC算法对粗匹配点集处理得到精匹配点集,由精匹配点集求出较高精度的基础矩阵及极线,并由极线约束引导匹配得到高精度的匹配点对,再运用双向松弛整体匹配算法进一步剔除少数位于极线上的误匹配点。最后利用所得的高精度匹配点对,求解序列图像间的仿射变换关系,并进行图像的坐标变换和融合,从而实现序列图像的自动拼接。实验结果表明,该方法拼接效果理想,鲁棒性高,整个拼接过程全自动,不需要人工干预,具有较高的实用价值。

关键词: Harris角点, 图像匹配, RANSAC算法, 极线约束, 双向松弛整体匹配, 序列图像拼接

Abstract: Considering the low robustness, large computation and low automation in the traditional image mosaic method, a robust automatic image sequence mosaic method was proposed. First, the method used Harris operator and Forstner operator to extract the image character points after using Wallis filter to enhance the images. Then the gray cross correlation of the certain domain of the character points was utilized to obtain the rough matching points, and the RANSAC algorithm was used to get accurate image matching points. After that, the matching points were used to calculate the foundation matrix and epipolar lines, and the epipolar constraint was used to induct the image matching and get the final high precise matching points. Hence, bidirectional relaxation whole matching algorithm was used to eliminate the error matching points located on the epipolar line. Finally, the accurate matching points were utilized to calculate the affine transform relations of the image sequence and thus completed the image sequence auto-mosaic. The experimental results show that the proposed method is effective in image sequence mosaic, and the process is automatic with high practical value.

Key words: Harris corner, image matching, RANSAC algorithm, epipolar constraint, bidirectional relaxation whole mathing algorithm, image sequence mosaic

中图分类号: