计算机应用 ›› 2011, Vol. 31 ›› Issue (01): 175-178.

• 图形图像处理 • 上一篇    下一篇

基于图像分割的立体匹配算法

颜轲1,万国伟2,李思昆3   

  1. 1. 湖南省长沙市国防科技大学计算机学院学员五队
    2.
    3. 国防科技大学计算机学院
  • 收稿日期:2010-07-21 修回日期:2010-08-10 发布日期:2011-01-12 出版日期:2011-01-01
  • 通讯作者: 颜轲
  • 基金资助:
    国家973重点基础研究发展规划项目

Stereo matching algorithm based on image segmentation

  • Received:2010-07-21 Revised:2010-08-10 Online:2011-01-12 Published:2011-01-01

摘要: 基于马尔可夫随机场(MRF)的立体匹配算法利用MRF模型来对匹配取值进行连续性约束。然而,MRF模型是产生式模型,图像自身特征难以得到准确描述。提出了一种基于图像分割的立体匹配算法SGC。SGC算法预先对图像进行分割,基于图像分割信息建立立体匹配的MRF模型,从而连续性(平滑)约束可以保留视差图中分割的边缘信息;并针对图像的深度连续性约束,定义了一个反映图像自身特征的新能量函数,应用于图割算法,提高了视差计算精度。实验结果表明,与以往算法相比,SGC算法更准确地反映了图像中深度信息,避免了平滑约束所引入的误差,有效提高了视差计算精度。

关键词: 马尔科夫随机场, 图割算法, 立体匹配, 图像分割, 视差图

Abstract: The stereo matching algorithm based on MRF restricts the continuity of the disparity by the MRF model, but it can not describe the image feature exactly due to the generative property of the model. This paper presents a stereo matching algorithm of SGC based on image segmentation. The SGC algorithm builds the MRF model using the result of image segmentation, thereby the edge information of the disparity map can be kept in the continuity (smoothness) constraints. Moreover, to improve the disparity accuracy, a novel energy function is well designed to restrict the depth-continuity of an image and applied to the Graph Cut algorithm to describe the image feature. The experiments show that our SGC algorithm can reflect the depth information more exactly than the existing algorithm and achieve a high-precision disparity by avoiding the error arisen from the continuity constraints.

Key words: Markov Random Field(MRF), Graph Cut Algorithm, Stereo Match, Image Segmentation, disparity map