Computing visual correspondence with occlusions using graph cuts

V. Kolmogorov, R. Zabih, in:, IEEE, 2001, pp. 508–515.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
Abstract
Several new algorithms for visual correspondence based on graph cuts [7, 14, 17] have recently been developed. While these methods give very strong results in practice, they do not handle occlusions properly. Specifically, they treat the two input images asymmetrically, and they do not ensure that a pixel corresponds to at most one pixel in the other image. In this paper, we present a new method which properly addresses occlusions, while preserving the advantages of graph cut algorithms. We give experimental results for stereo as well as motion, which demonstrate that our method performs well both at detecting occlusions and computing disparities.
Publishing Year
Date Published
2001-08-01
Volume
2
Page
508 - 515
Conference
ICCV: International Conference on Computer Vision
IST-REx-ID

Cite this

Kolmogorov V, Zabih R. Computing visual correspondence with occlusions using graph cuts. In: Vol 2. IEEE; 2001:508-515. doi:10.1109/ICCV.2001.937668
Kolmogorov, V., & Zabih, R. (2001). Computing visual correspondence with occlusions using graph cuts (Vol. 2, pp. 508–515). Presented at the ICCV: International Conference on Computer Vision, IEEE. https://doi.org/10.1109/ICCV.2001.937668
Kolmogorov, Vladimir, and Ramin Zabih. “Computing Visual Correspondence with Occlusions Using Graph Cuts,” 2:508–15. IEEE, 2001. https://doi.org/10.1109/ICCV.2001.937668.
V. Kolmogorov and R. Zabih, “Computing visual correspondence with occlusions using graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2001, vol. 2, pp. 508–515.
Kolmogorov V, Zabih R. 2001. Computing visual correspondence with occlusions using graph cuts. ICCV: International Conference on Computer Vision vol. 2. 508–515.
Kolmogorov, Vladimir, and Ramin Zabih. Computing Visual Correspondence with Occlusions Using Graph Cuts. Vol. 2, IEEE, 2001, pp. 508–15, doi:10.1109/ICCV.2001.937668.

Link(s) to Main File(s)
Access Level
Restricted Closed Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar