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.