Constant Time Stereo Matching

Abstract

Typically, local methods for stereo matching are fast but have relatively low degree of accuracy while global ones, though costly, achieve a higher degree of accuracy in retrieving disparity information. Recently, however, some local methods such as those based on segmentation or adaptive weights are suggested to possibly achieve more accuracy than global ones in retrieving disparity information. The problem for these newly suggested local methods is that they cannot be easily adopted since they may require more computational costs which increase in proportion to the window size they use. To reduce the computational costs, therefore, we propose in this paper the stereo matching method that use domain weight and range weight similar to those in the bilateral filter. Our proposed method shows constant time O(1) for the stereo matching. Our experiments spend constant time for computation regardless of the window size but our experimental results show that the accuracy of generated depth map is as good as the ones suggested by recent methods.