张令涛, 曲道奎, 徐方. 一种基于图割的改进立体匹配算法[J]. 机器人, 2010, 32(1): 104-108.
引用本文: 张令涛, 曲道奎, 徐方. 一种基于图割的改进立体匹配算法[J]. 机器人, 2010, 32(1): 104-108.
ZHANG Lingtao, QU Daokui, XU Fang. An Improved Stereo Matching Algorithm Based on Graph Cuts[J]. ROBOT, 2010, 32(1): 104-108.
Citation: ZHANG Lingtao, QU Daokui, XU Fang. An Improved Stereo Matching Algorithm Based on Graph Cuts[J]. ROBOT, 2010, 32(1): 104-108.

一种基于图割的改进立体匹配算法

An Improved Stereo Matching Algorithm Based on Graph Cuts

  • 摘要: 针对基于图割法的立体匹配算法耗时太长的问题,提出了一种基于简化网格图的立体匹配算法.算法通过区域匹配算法得到每个像素的初始视差值,然后只保留完整网格图的部分可能的视差值,去除其余大部分的节点和边缘,建立简化的网格图.该方法大大缩减了网格图的容量,缩短匹配所用时间,并且能够选用更大的视差范围.实验证明,该算法能够得到比较理想的视差图,而且大大缩短立体匹配所用时间.

     

    Abstract: For the problem that stereo matching methods based on graph cuts are time consuming,this paper puts forward an improved stereo matching algorithm based on reduced graphs.First,the initial disparity for each pixel can be calculated by using local matching method.Then,we keep only some potential disparity values in the complete graph,and the reduced graph will contain a reduced number of vertices and edges.Therefore the graph capacity and execution time are decreased,and a wider disparity range is obtained.At last,it is proved by experiments that this algorithm can achieve a relatively ideal disparity map and save much time in stereo matching.

     

/

返回文章
返回