In recent years, stereo correspondence algorithms based on graph cuts have gained popularity due to the significant improvement in accu ra y over the local methods. Even though there has been a noticeable progr ess in efficient max-flow algorithms, the computational cost for graph cut st ereo is still quite heavy, especially if the disparity search range is large. In this paper, we investigate and compare several ways of limiting the dispar ty search range. We show that the immediately obvious… CONTINUE READING