Stereo Matching using Reduced-Graph Cuts

Some recent stereo matching algorithms are based on graph cuts. They transform the matching problem to a minimisation of a global energy function. The minimisation can be done by finding out an optimal cut in a special graph. Different methods were proposed to construct the graph. But all of them, consider for each pixel, all possible disparities between minimum and maximum values. In this article, a new method is proposed: only some potential values in the disparity range are selected for each pixel. These values can be found using a local analysis of stereo matching. This method allows us to make wider the disparity range, and at the same time to limit the volume of the graph, and therefore to reduce the computation time.