Computing Visual Correspondence with Occlusions via Graph Cuts
Computing Visual Correspondence with Occlusions via Graph Cuts
Computing Visual Correspondence with Occlusions via Graph Cuts
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
[15] S.B. Kang, R. Szeliski, and J. Chai. Handling occlusions in dense multi-<br />
view stereo. In IEEE Conference on Computer Vision and Pattern<br />
Recognition, 2001. Expanded version available as MSR-TR-2001-80.<br />
[16] Vladimir Kolmogorov and Ramin Zabih. <strong>Computing</strong> visual correspon-<br />
dence <strong>with</strong> occlusions <strong>via</strong> graph cuts. Technical report CUCS-TR2001-<br />
1838, Cornell Computer Science Department, November 2001.<br />
[17] Vladimir Kolmogorov and Ramin Zabih. <strong>Visual</strong> correspondence <strong>with</strong><br />
occlusions using graph cuts. In International Conference on Computer<br />
Vision, pages 508–515, 2001.<br />
[18] Vladimir Kolmogorov and Ramin Zabih. What energy functions can be<br />
minimized <strong>via</strong> graph cuts? In European Conference on Computer Vi-<br />
sion, volume 3, pages 65–81, 2002. Also available as Cornell CS technical<br />
report CUCS-TR2001-1857.<br />
[19] Tomaso Poggio, Vincent Torre, and Christof Koch. Computational vi-<br />
sion and regularization theory. Nature, 317:314–319, 1985.<br />
[20] R. Potts. Some generalized order-disorder transformations. Proceedings<br />
of the Cambridge Philosophical Society, 48:106–109, 1952.<br />
[21] S. Roy. Stereo <strong>with</strong>out epipolar lines: A maximum flow formulation.<br />
International Journal of Computer Vision, 1(2):1–15, 1999.<br />
[22] Daniel Scharstein and Richard Szeliski. A taxonomy and evaluation of<br />
dense two-frame stereo correspondence algorithms. International Jour-<br />
nal of Computer Vision, 47:7–42, April 2002.<br />
32
Change language