一种基于图割的快速立体匹配方法

A Fast Stereo Matching Method Based on Graph Cuts

针对图割算法中引入辅助节点,算法复杂度过高的问题,提出了一种无需引入辅助节点的图构造方法来解决立体匹配问题.由于无需引入辅助节点,所构造出的图所需空间较小,同时可以更快地找到能量函数的最小值.实验结果表明,该方法可以快速有效地得到立体匹配的结果.

In this paper,a new algorithm based on graph cuts to solve stereo matching problem is proposed.In the algorithm,the constructed graph for minimizing the energy function does not use any auxiliary nodes,therefore smaller graph can be constructed efficiently and the minimum cut can be computed faster.Experimental results demonstrated that satisfactory results can be computed efficiently by the proposed method.