Computing visual correspondence with occlusions using graph cuts

Proceedings of the IEEE International Conference on Computer Vision

Volumn 2, Issue , 2001, Pages 508-515

  Kolmogorov, V ^a   Zabih, R ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER VISION; IMAGE PROCESSING; OPTIMIZATION;

GRAPH CUTS; VISUAL CORRESPONDENCE;

IMAGE ANALYSIS;

EID: 0034857389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. A Bayesian treatment of the stereo correspondence problem using half-occluded regions
2. A pixel dissimilarity measure that is insensitive to image sampling
3. Large occlusion stereo
4. Spatiotemporal consistency checking of passive range data
5. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
6. Markov random fields with efficient approximations
7. Fast approximate energy minimization via graph cuts
8. Occlusions and binocular stereo
9. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
10. Exact maximum a posteriori estimation for binary images
11. Occlusions, discontinuities, and epipolar lines in stereo
12. Computational vision and regularization theory
13. Some generalized order-disorder transformation
14. Stereo without epipolar lines: A maximum flow formulation
15. An experimental comparison of stereo algorithms
16. Efficient graph-based energy minimization methods in computer vision
17. A cooperative algorithm for stereo matching and occlusion detection