Obtaining depth map from segment-based stereo matching using graph cuts

Abstract

In the paper, the algorithm of segment-based stereo matching using graph cuts is developed for extracting depth information from the stereo image pairs. The first step of the algorithm employs the mean-shift algorithm to segment the reference image, which ensures our method to correctly estimate in large untextured regions and precisely localize depth boundaries, followed by the use of Adaptive Support Weighted Self-Adaptation dissimilarity algorithm (ASW-SelfAd) for the estimation of initial disparity. This is followed by application of Singular Value Decomposition (SVD) in solving the robust disparity plane fitting. In order to ensure reliable pixel sets for the segment, we filter out outliers which contain occlusion region through three main rules, namely; cross-checking, judging reliable area and disparity distance measurement. Lastly, we apply improved clustering algorithm to merge the neighboring segments. The geometrical relationship of adjacent planes such as parallelism and intersection is employed for determination of whether two planes shall be merged. A new energy function is subsequently formulated with the use of graph cuts for the refinement of the disparity map. Finally, the depth information is extracted from the final disparity map. Experimental results on the Middlebury dataset demonstrate that our approach is effective in improving the state of the art. © 2011 Elsevier Inc. All rights reserved.