This paper argues that the disparity gradient subsumes various constraints for stereo
matching, and can thus be used as the basis of a unified cooperative stereo algorithm …

In this paper we present a new stereo matching algorithm that produces accurate dense
disparity maps and explicitly detects occluded areas. This algorithm extends the original …

A contour-based stereo matching algorithm is presented using the disparity continuity
property along image contours. The basic idea is to first match specific high-information …

Color processing imposes a new constraint on stereo vision algorithms: The assumption of
constant color on object surfaces used to align local correlation windows with object …

Presents a stereo algorithm for obtaining disparity maps with occlusion explicitly detected.
To produce smooth and detailed disparity maps, two assumptions that were originally …

Stereo matching is the process of determining correspondences between entities in related
images. Often, this is treated as two quite independent subprocesses: segmentation …

This paper presents a fast and reliable stereo matching algorithm which produces a dense
disparity map by using fast cross correlation, rectangular subregioning (RSR) and 3D …

This paper presents a new stereo matching algorithm based on inter-regional cooperative
optimization. The proposed algorithm uses regions as matching primitives and defines the …

An accurate segmentation-based algorithm using combinatorial similarity measurement and
adaptive support aggregation strategy is developed for stereo matching. The advantage of …

A method for solving the stereo matching problem in the presence of large occlusion is
presented. A data structure—the disparity space image—is defined to facilitate the …