Abstract
This paper introduces a new multi-view reconstruction problem called approximate N-view stereo. The goal of this problem is to recover a one-parameter family of volumes that are increasingly tighter supersets of an unknown, arbitrarily-shaped 3D scene. By studying 3D shapes that reproduce the input photographs up to a special image transformation called a shuffle transformation, we prove that (1) these shapes can be organized hierarchically into nested supersets of the scene, and (2) they can be computed using a simple algorithm called Approximate Space Carving that is provably-correct for arbitrary discrete scenes (i.e., for unknown, arbitrarily-shaped Lambertian scenes that are defined by a finite set of voxels and are viewed from N arbitrarily-distributed viewpoints inside or around them). The approach is specifically designed to attack practical reconstruction problems, including (1) recovering shape from images with inaccurate calibration information, and (2) building coarse scene models from multiple views.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. J. Narayanan, P. W. Rander, and T. Kanade, “Constructing virtual worlds using dense stereo,” in Proc. Int. Conf. on Computer Vision, pp. 3–10, 1998.
S. B. Kang and R. Szeliski, “3-D scene data recovery using omnidirectional multibaseline stereo,” in Proc. Computer Vision and Pattern Recognition Conf., pp. 364–370, 1996.
R. Szeliski and P. Golland, “Stereo matching with transparency and matting,” in Proc. 6th Int. Conf. on Computer Vision, pp. 517–524, 1998.
S. Roy and I. J. Cox, “A maximum-flow formulation of the N-camera stereo correspondence problem,” in Proc. 6th Int. Conf. on Computer Vision, pp. 492–499, 1998.
O. Faugeras and R. Keriven, “Complete dense stereovision using level set methods,” in Proc. 5th European Conf. on Computer Vision, pp. 379–393, 1998.
K. N. Kutulakos and S. M. Seitz, “A theory of shape by space carving,” in Proc. 7th Int. Conf. Computer Vision, pp. 307–314, 1999.
R. T. Collins, “A space-sweep approach to true multi-image matching,” in Proc. Computer Vision and Pattern Recognition Conf., pp. 358–363, 1996.
S. M. Seitz and C. R. Dyer, “Photorealistic scene reconstruction by voxel coloring,” in Proc. Computer Vision and Pattern Recognition Conf., pp. 1067–1073, 1997.
P. Fua and Y. G. Leclerc, “Object-centered surface reconstruction: Combining multi-image stereo and shading,” Int. J. Computer Vision, vol. 16, pp. 35–56, 1995.
G. Baratoff and Y. Aloimonos, “Changes in surface convexity and topology caused by distortions of stereoscopic visual space,” in Proc. 5th European Conf. on Computer Vision, pp. 226–240, 1998.
P. Fua and Y. G. Leclerc, “Registration without correspondences,” in Proc. Computer Vision and Pattern Recognition Conf., pp. 121–128, 1994.
A. C. Prock and C. R. Dyer, “Towards real-time voxel coloring,” in Proc. Image Understanding Workshop, pp. 315–321, 1998.
R. Szeliski, “Rapid octree construction from image sequences,” CVGIP: Image Understanding, vol. 58, no. 1, pp. 23–32, 1993.
T. Lindeberg, Scale-Space Theory in Computer Vision. Kluwer Academic Publishers, 1994.
J. Popovic and H. Hoppe, “Progressive simplicial complexes,” in Proc. SIGGRAPH’97, pp. 189–198, 1997.
E. J. Stollnitz, T. D. DeRose, and D. H. Salesin, Wavelets for Computer Graphics. Morgan Kaufmann Publishers, 1996.
H. Samet, The design and analysis of spatial data structures. Reading, MA: Addison-Wesley, 1990.
J. J. Koenderink, Solid Shape.MIT Press, 1990.
P. Fua, “From multiple stereo views to multiple 3-d surfaces,” Int. J. Computer Vision, vol. 24, no. 1, pp. 19–35, 1997.
R. Szeliski and H.-Y Shum, “Motion estimation with quadtree splines,” IEEE Trans. Pattern Anal. Machine Intell., vol. 18, no. 12, pp. 1199–1210, 1996.
M. A. Armstrong, Basic Topology. Springer-Verlag, 1983.
J.L. Mundy and A. Zisserman, eds., Geometric Invariance in Computer Vision. MIT Press, 1992.
D. N. Bhat and S. K. Nayar, “Ordinal measures for visual correspondence,” in Proc. Computer Vision and Pattern Recognition Conf., pp. 351–357, 1996.
J. Huang, S. R. Kumar, M. Mitra, W.-J. Zhu, and R. Zabih, “Image indexing using color correlograms,” in Proc. Computer Vision and Pattern Recognition Conf., pp. 762–768, 1997.
R. Zabih and J. Woodfill, “Non-parametric local transforms for computing visual correspondence,” in Proc. 3rd European Conf. on Computer Vision, pp. 151–158, 1994.
P. Meer, D. Mintz, A. Rosenfeld, and D. Y Kin, “Robust regression methods for computer vision: A review,” Int. J. Computer Vision, vol. 6, no. 1, pp. 59–70, 1991.
S. J. Maybank and O. D. Faugeras, “A theory of self-calibration of a moving camera,” Int. J. Computer Vision, vol. 8, pp. 123–152, 1992.
S. Birchfield and C. Tomasi, “A pixel dissimilarity measure that is insensitive to image sampling,” IEEE Trans. Pattern Anal. Machine Intell., vol. 20, no. 4, pp. 401–106, 1998.
H. Cramér, Mathematical Methods of Statistics. Princeton University Press, 1946.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutulakos, K.N. (2000). Approximate N-View Stereo. In: Computer Vision - ECCV 2000. ECCV 2000. Lecture Notes in Computer Science, vol 1842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45054-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-45054-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67685-0
Online ISBN: 978-3-540-45054-2
eBook Packages: Springer Book Archive