---
_id: '2921'
abstract:
- lang: eng
text: Most binocular stereo algorithms assume that all scene elements are visible
from both cameras. Scene elements that are visible from only one camera, known
as occlusions, pose an important challenge for stereo. Occlusions are important
for segmentation, because they appear near discontinuities. However, stereo algorithms
tend to ignore occlusions because of their difficulty. One reason is that occlusions
require the input images to be treated symmetrically, which complicates the problem
formulation. Worse, certain depth maps imply physically impossible scene configurations,
and must be excluded from the output. In this chapter we approach the problem
of binocular stereo with occlusions from an energy minimization viewpoint. We
begin by reviewing traditional stereo methods that do not handle occlusions. If
occlusions are ignored, it is easy to formulate the stereo problem as a pixel
labeling problem, which leads to an energy function that is common in early vision.
This kind of energy function can he minimized using graph cuts, which is a combinatorial
optimization technique that has proven to be very effective for low-level vision
problems. Motivated by this, we have designed two graph cut stereo algorithms
that are designed to handle occlusions. These algorithms produce promising experimental
results on real data with ground truth.
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
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. Graph cut algorithms for binocular stereo with occlusions.
In: *Handbook of Mathematical Models in Computer Vision*. Springer; 2006:423-427.
doi:10.1007/0-387-28831-7_26'
apa: Kolmogorov, V., & Zabih, R. (2006). Graph cut algorithms for binocular
stereo with occlusions. In *Handbook of Mathematical Models in Computer Vision*
(pp. 423–427). Springer. https://doi.org/10.1007/0-387-28831-7_26
chicago: Kolmogorov, Vladimir, and Ramin Zabih. “Graph Cut Algorithms for Binocular
Stereo with Occlusions.” In *Handbook of Mathematical Models in Computer Vision*,
423–27. Springer, 2006. https://doi.org/10.1007/0-387-28831-7_26.
ieee: V. Kolmogorov and R. Zabih, “Graph cut algorithms for binocular stereo with
occlusions,” in *Handbook of Mathematical Models in Computer Vision*, Springer,
2006, pp. 423–427.
ista: 'Kolmogorov V, Zabih R. 2006.Graph cut algorithms for binocular stereo with
occlusions. In: Handbook of Mathematical Models in Computer Vision. , 423–427.'
mla: Kolmogorov, Vladimir, and Ramin Zabih. “Graph Cut Algorithms for Binocular
Stereo with Occlusions.” *Handbook of Mathematical Models in Computer Vision*,
Springer, 2006, pp. 423–27, doi:10.1007/0-387-28831-7_26.
short: V. Kolmogorov, R. Zabih, in:, Handbook of Mathematical Models in Computer
Vision, Springer, 2006, pp. 423–427.
date_created: 2018-12-11T12:00:21Z
date_published: 2006-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:42Z
day: '01'
doi: 10.1007/0-387-28831-7_26
extern: 1
month: '01'
page: 423 - 427
publication: Handbook of Mathematical Models in Computer Vision
publication_status: published
publisher: Springer
publist_id: '3816'
quality_controlled: 0
status: public
title: Graph cut algorithms for binocular stereo with occlusions
type: book_chapter
year: '2006'
...