Issue No. 07 - July (2000 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.865184
<p><b>Abstract</b>—This paper presents a stereo algorithm for obtaining disparity maps with occlusion explicitly detected. To produce smooth and detailed disparity maps, two assumptions that were originally proposed by Marr and Poggio are adopted: uniqueness and continuity. That is, the disparity maps have a unique value per pixel and are continuous almost everywhere. These assumptions are enforced within a three-dimensional array of match values in disparity space. Each match value corresponds to a pixel in an image and a disparity relative to another image. An iterative algorithm updates the match values by diffusing support among neighboring values and inhibiting others along similar lines of sight. By applying the uniqueness assumption, occluded regions can be explicitly identified. To demonstrate the effectiveness of the algorithm, we present the processing results from synthetic and real image pairs, including ones with ground-truth values for quantitative comparison with other methods.</p>
Stereo vision, occlusion detection, 3D vision.
T. Kanade and C. L. Zitnick, "A Cooperative Algorithm for Stereo Matching and Occlusion Detection," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 22, no. , pp. 675-684, 2000.