Computing Visual Correspondence with Occlusions via Graph Cuts

More documents

Recommendations

Info

[15] S.B. Kang, R. Szeliski, and J. Chai. Handling occlusions in dense multi- view stereo. In IEEE Conference on Computer Vision and Pattern Recognition, 2001. Expanded version available as MSR-TR-2001-80. [16] Vladimir Kolmogorov and Ramin Zabih. Computing visual correspondence with occlusions via graph cuts. Technical report CUCS-TR2001- 1838, Cornell Computer Science Department, November 2001. [17] Vladimir Kolmogorov and Ramin Zabih. Visual correspondence with occlusions using graph cuts. In International Conference on Computer Vision, pages 508–515, 2001. [18] Vladimir Kolmogorov and Ramin Zabih. What energy functions can be minimized via graph cuts? In European Conference on Computer Vi- sion, volume 3, pages 65–81, 2002. Also available as Cornell CS technical report CUCS-TR2001-1857. [19] Tomaso Poggio, Vincent Torre, and Christof Koch. Computational vision and regularization theory. Nature, 317:314–319, 1985. [20] R. Potts. Some generalized order-disorder transformations. Proceedings of the Cambridge Philosophical Society, 48:106–109, 1952. [21] S. Roy. Stereo without epipolar lines: A maximum flow formulation. International Journal of Computer Vision, 1(2):1–15, 1999. [22] Daniel Scharstein and Richard Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Jour- nal of Computer Vision, 47:7–42, April 2002. 32
[23] Rick Szeliski and Ramin Zabih. An experimental comparison of stereo algorithms. In IEEE Workshop on Vision Algorithms, September 1999. To appear in LNCS. [24] Olga Veksler. Efficient Graph-based Energy Minimization Methods in Computer Vision. PhD thesis, Cornell University, August 1999. Avail- able as technical report CUCS-TR-2000-1787. [25] C. Lawrence Zitnick and Takeo Kanade. A cooperative algorithm for stereo matching and occlusion detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(7):675–684, July 2000. Earlier version appears as technical report CMU-RI-TR-98-30. 33
Page 1 and 2: Computing Visual Correspondence wit
Page 3 and 4: The new algorithms proposed in this
Page 5 and 6: in the right image. Furthermore, th
Page 7 and 8: • a smoothness term Esmooth, whic
Page 9 and 10: not permit occlusions to be natural
Page 11 and 12: The most closely related work consi
Page 13 and 14: Figure 3: The graph corresponding t
Page 15 and 16: • the last edge that we add is (v
Page 17 and 18: 2. Occlusion term. ˜Eocc(x) = Cp
Page 19 and 20: The corresponding graph is shown in
Page 21 and 22: First image Second image Horizontal
Page 23 and 24: Left image Right image Horizontal m
Page 25 and 26: distance. Occlusions were computed
Page 27 and 28: 7 Conclusions We have presented an
Page 29 and 30: negative function D : S×V↦→
Page 31: [7] Yuri Boykov, Olga Veksler, and

Computing Visual Correspondence with Occlusions via Graph Cuts

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?