Abstract
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are visible from all cameras. In the last few years, two promising approaches have been developed 11,12 that formulate the scene reconstruction problem in terms of energy minimization, and minimize the energy using graph cuts. These energy minimization approaches treat the input images symmetrically, handle visibility constraints correctly, and allow spatial smoothness to be enforced. However, these algorithm propose different problem formulations, and handle a limited class of smoothness terms. One algorithm 11 uses a problem formulation that is restricted to two-camera stereo, and imposes smoothness between a pair of cameras. The other algorithm 12 can handle an arbitrary number of cameras, but imposes smoothness only with respect to a single camera. In this paper we give a more general energy minimization formulation for the problem, which allows a larger class of spatial smoothness constraints. We show that our formulation includes both of the previous approaches as special cases, as well as permitting new energy functions. Experimental results on real data with ground truth are also included.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
Barnard, S.: Stochastic stereo matching over scale. International Journal of Computer Vision 3(1), 17–32 (1989)
Boykov, Y., Kolmogorov, V.: An experimental comparison of mincut/ max-flow algorithms for energy minimization in computer vision. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol. 2134, pp. 359–374. Springer, Heidelberg (2001)
Boykov, Y., Veksler, O., Zabih, R.: Markov Random Fields with efficient approximations. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 648–655 (1998)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)
Cipolla, R., Blake, A.: Surface shape from the deformation of apparent contours. International Journal of Computer Vision 9(2), 83–112 (1992)
Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)
Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 721–741 (1984)
Ishikawa, H., Geiger, D.: Occlusions, discontinuities, and epipolar lines in stereo. In: European Conference on Computer Vision, pp. 232–248 (1998)
Kang, S.B., Szeliski, R., Chai, J.: Handling occlusions in dense multi-view stereo. In: IEEE Conference on Computer Vision and Pattern Recognition (2001)
Kolmogorov, V., Zabih, R.: Visual correspondence with occlusions using graph cuts. In: International Conference on Computer Vision, pp. 508–515 (2001)
Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: European Conference on Computer Vision, vol. 3, pp. 82–96 (2002)
Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? In: European Conference on Computer Vision, vol. 3, pp. 65–81 (2002); Revised version to appear in IEEE Transactions on Pattern Analysis and Machine Intelligence.
Kutulakos, K.N., Seitz, S.M.: A theory of shape by space carving. International Journal of Computer Vision 38(3), 197–216 (2000)
Laurentini, A.: The visual hull concept for silhouette-based image understanding. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(2), 150–162 (1994)
Martin, W.N., Aggarwal, J.K.: Volumetric descriptions of objects from multiple views. IEEE Transactions on Pattern Analysis and Machine Intelligence 5(2), 150–158 (1983)
Roy, S., Cox, I.: A maximum-flow formulation of the n-camera stereo correspondence problem. In: International Conference on Computer Vision (1998)
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision 47, 7–42 (2002)
Seitz, S.M., Dyer, C.R.: Photorealistic scene reconstruction by voxel coloring. International Journal of Computer Vision 35(2), 1–23 (1999)
Snow, D., Viola, P., Zabih, R.: Exact voxel occupancy with graph cuts. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 345–352 (2000)
Szeliski, R.: Rapid octree construction from image sequences. Computer Vision, Graphics and Image Processing 58(1), 23–32 (1993)
Szeliski, R., Zabih, R.: An experimental comparison of stereo algorithms. In: Triggs, B., Zisserman, A., Szeliski, R. (eds.) ICCV-WS 1999. LNCS, vol. 1883, pp. 1–19. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolmogorov, V., Zabih, R., Gortler, S. (2003). Generalized Multi-camera Scene Reconstruction Using Graph Cuts. In: Rangarajan, A., Figueiredo, M., Zerubia, J. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 2003. Lecture Notes in Computer Science, vol 2683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45063-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-45063-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40498-9
Online ISBN: 978-3-540-45063-4
eBook Packages: Springer Book Archive