Graph-Cut and Belief-Propagation Stereo

Abstract

This paper deals with stereo correspondence search, using graph cuts and belief propagation, for estimating depth maps. The results following different preprocessing steps are evaluated, using the quality of the disparity map. Running times are also investigated. For evaluation purposes, different kinds of images have been used: reference images from the Middlebury Stereo website, synthetic driving scenes, and real-world stereo sequences, either provided by Daimler AG or self-recorded with the research vehicle of the .enpeda.. project at Auckland University.