---
_id: '3169'
abstract:
- lang: eng
text: 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.
article_processing_charge: No
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
citation:
ama: 'Kolmogorov V, Zabih R. Computing visual correspondence with occlusions using
graph cuts. In: Proceedings of the 8th IEEE International Conference on Computer
Vision. Vol 2. IEEE; 2001:508-515. doi:10.1109/ICCV.2001.937668'
apa: 'Kolmogorov, V., & Zabih, R. (2001). Computing visual correspondence with
occlusions using graph cuts. In Proceedings of the 8th IEEE International Conference
on Computer Vision (Vol. 2, pp. 508–515). Vancouver, Canada: IEEE. https://doi.org/10.1109/ICCV.2001.937668'
chicago: Kolmogorov, Vladimir, and Ramin Zabih. “Computing Visual Correspondence
with Occlusions Using Graph Cuts.” In Proceedings of the 8th IEEE International
Conference on Computer Vision, 2:508–15. IEEE, 2001. https://doi.org/10.1109/ICCV.2001.937668.
ieee: V. Kolmogorov and R. Zabih, “Computing visual correspondence with occlusions
using graph cuts,” in Proceedings of the 8th IEEE International Conference
on Computer Vision, Vancouver, Canada, 2001, vol. 2, pp. 508–515.
ista: 'Kolmogorov V, Zabih R. 2001. Computing visual correspondence with occlusions
using graph cuts. Proceedings of the 8th IEEE International Conference on Computer
Vision. ICCV: International Conference on Computer Vision vol. 2, 508–515.'
mla: Kolmogorov, Vladimir, and Ramin Zabih. “Computing Visual Correspondence with
Occlusions Using Graph Cuts.” Proceedings of the 8th IEEE International Conference
on Computer Vision, vol. 2, IEEE, 2001, pp. 508–15, doi:10.1109/ICCV.2001.937668.
short: V. Kolmogorov, R. Zabih, in:, Proceedings of the 8th IEEE International Conference
on Computer Vision, IEEE, 2001, pp. 508–515.
conference:
end_date: 2001-07-14
location: Vancouver, Canada
name: 'ICCV: International Conference on Computer Vision'
start_date: 2001-07-07
date_created: 2018-12-11T12:01:47Z
date_published: 2001-08-01T00:00:00Z
date_updated: 2023-05-15T14:45:50Z
day: '01'
doi: 10.1109/ICCV.2001.937668
extern: '1'
intvolume: ' 2'
language:
- iso: eng
month: '08'
oa_version: None
page: 508 - 515
publication: Proceedings of the 8th IEEE International Conference on Computer Vision
publication_identifier:
isbn:
- '0769511430'
publication_status: published
publisher: IEEE
publist_id: '3514'
quality_controlled: '1'
status: public
title: Computing visual correspondence with occlusions using graph cuts
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2
year: '2001'
...