作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (01): 193-194. doi: 10.3969/j.issn.1000-3428.2007.01.067

• 人工智能及识别技术 • 上一篇    下一篇

基于图割理论和极几何约束的图像匹配算法

鲍文霞1,2,梁 栋1,2,王 年1,2,童 强1,2   

  1. (1. 安徽大学计算机智能与信号处理教育部重点实验室,合肥230039;
    2. 安徽大学电子科学与技术学院,合肥230039)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-01-05 发布日期:2007-01-05

Algorithm for Images Matching Based on Graph Cut and Epipolar Geometric Constraint

BAO Wenxia1,2, LIANG Dong1,2, WANG Nian1,2, TONG Qiang1,2   

  1. (1. Key Lab of Ministry of Education of IC&SP, Anhui University, Hefei 230039;
    2. School of Electronic Science and Technology, Anhui University, Hefei 230039)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-01-05 Published:2007-01-05

摘要: 提出了一种基于图割理论和极几何约束的图像匹配算法。利用极几何约束对两幅待匹配图像进行矫正,使得它们的极线处在同一扫描线上,从而将二维匹配简化成一维匹配;利用基于图割的一维匹配算法获取视差数据,此时匹配中能量函数的标号是一维的,大大减少了搜索范围,并且提高了匹配的速度。

关键词: 图割, 极几何约束, 标号, 视差

Abstract: An algorithm for images matching based on graph cut and epipolar geometric constraint is proposed. The two original images are rectified by epipolar geometric constraint to make their epipolar lines parallel to the scan-lines. So the 2D matching of images is simplified to that of 1D. Then the matching disparities can be gained by the 1D matching algorithm based on graph cut. The label is 1D in the energy function. Therefore, the searching range is greatly decreased, and the rate of matching is improved.

Key words: Graph cut, Epipolar geometric constraint, Label, Disparity