State-of-the-art stereo vision algorithms utilize color changes as important cues for object
boundaries. Most methods impose heuristic restrictions or priors on disparities, for example …

This work describes a stereo algorithm that takes advantage of image segmentation,
assuming that disparity varies smoothly inside a segment of homogeneous colour and depth …

This paper presents a novel method for cost aggregation and occlusion handling for stereo
matching. In order to estimate optimal cost, given a per-pixel difference image as observed …

This paper describes a dense stereo matching algorithm for epipolar rectified images. The
method applies colour segmentation on the reference image. Our basic assumptions are …

We present a new window-based stereo matching algorithm which focuses on robust outlier
rejection during aggregation. The main difficulty for window-based methods lies in …

Although steady progress has been made in recent stereo algorithms, producing accurate
results in the neighborhood of depth discontinuities remains a challenge. Moreover, among …

Methods Based on Local Interactions. Shashua and Ullman [99] first addressed the issue of
structural saliency and how prominent curves are formed from tokens that are not salient in …

In this paper, we present a novel stereo algorithm that combines the strengths of region-
based stereo and dynamic programming on a tree approaches. Instead of formulating an …

We propose a new stereo algorithm which uses colour segmentation to allow the handling of
large untextured regions and precise localization of depth boundaries. Each segment is …

A novel region-based progressive stereo matching algorithm is presented. It combines the
strengths of previous region-based and progressive approaches. The progressive …