Noah Snavely
Richard Szeliski
Abstract
When a scene is photographed many times by different people, the viewpoints often cluster along certain paths. These paths are largely specific to the scene being photographed, and follow interesting regions and viewpoints. We seek to discover a range of such paths and turn them into controls for image-based rendering. Our approach takes as input a large set of community or personal photos, reconstructs camera viewpoints, and automatically computes orbits, panoramas, canonical views, and optimal paths between views. The scene can then be interactively browsed in 3D using these controls or with six degree-of-freedom free-viewpoint control. As the user browses the scene, nearby views are continuously selected and transformed, using control-adaptive reprojection techniques.
Supplemental Material
- Aliaga, D. G., and Carlbom, I. 2001. Plenoptic stitching: A scalable method for reconstructing 3D interactive walkthroughs. In SIGGRAPH Conf. Proc., 443--450. Google Scholar
Digital Library
- Bookstein, F. L. 1989. Principal warps: Thin-plate splines and the decomposition of deformations. IEEE Trans. on Pattern Analysis and Machine Intelligence 11, 6, 567--585. Google ScholarDigital Library
- Buehler, C., Bosse, M., McMillan, L., Gortler, S., and Cohen, M. 2001. Unstructured lumigraph rendering. In SIGGRAPH Conf. Proc., 425--432. Google ScholarDigital Library
- Chen, S., and Williams, L. 1993. View interpolation for image synthesis. In SIGGRAPH Conf. Proc., 279--288. Google ScholarDigital Library
- Chen, S. E. 1995. QuickTime VR - an image-based approach to virtual environment navigation. In SIGGRAPH Conf. Proc., 29--38. Google ScholarDigital Library
- Debevec, P. E., Taylor, C. J., and Malik, J. 1996. Modeling and rendering architecture from photographs: a hybrid geometry- and image-based approach. In SIGGRAPH Conf. Proc., 11--20. Google ScholarDigital Library
- Drucker, S. M., and Zeltzer, D. 1994. Intelligent camera control in a virtual environment. In Proc. of Graphics Interface, 190--199.Google Scholar
- Epshtien, B., Ofek, E., Wexler, Y., and Zhang, P. 2007. Hierarchical photo organization using geometric relevance. In ACM Int. Symp. on Advances in Geographic Information Systems. Google ScholarDigital Library
- Fischler, M., and Bolles, R. 1987. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Readings in computer vision: issues, problems, principles, and paradigms, 726--740. Google ScholarDigital Library
- Galyean, T. A. 1995. Guided navigation of virtual environments. In SI3D '95: Proc. Symposium on Interactive 3D Graphics, 103--104. Google ScholarDigital Library
- Goesele, M., Snavely, N., Seitz, S. M., Curless, B., and Hoppe, H. 2007. Multi-view stereo for community photo collections. In Proc. Int. Conf. on Computer Vision.Google Scholar
- Gortler, S. J., Grzeszczuk, R., Szeliski, R., and Cohen, M. F. 1996. The lumigraph. In SIGGRAPH Conf. Proc., 43--54. Google ScholarDigital Library
- Kanade, T., 2001. Carnegie Mellon goes to the Superbowl. http://www.ri.cmu.edu/events/sb35/tksuperbowl.html.Google Scholar
- Kang, S. B., Sloan, P.-P., and Seitz, S. M. 2000. Visual tunnel analysis for visibility prediction and camera planning. In Proc. IEEE Conf. on Computer Vision and Pattern Recognition, 2195--2202.Google Scholar
- Levoy, M., and Hanrahan, P. 1996. Light field rendering. In SIGGRAPH Conf. Proc., 31--42. Google ScholarDigital Library
- Lippman, A. 1980. Movie maps: An application of the optical videodisc to computer graphics. In SIGGRAPH Conf. Proc., 32--43. Google ScholarDigital Library
- Lowe, D. 2004. Distinctive image features from scale-invariant keypoints. Int. J. of Computer Vision 60, 2, 91--110. Google ScholarDigital Library
- McMillan, L., and Bishop, G. 1995. Plenoptic modeling: An image-based rendering system. In SIGGRAPH Conf. Proc., 39--46. Google ScholarDigital Library
- Pollefeys, M., van Gool, L., Vergauwen, M., est, F. V., Cornelis, K., Tops, J., and Koch, R. 2004. Visual modeling with a hand-held camera. Int. J. of Computer Vision 59, 3, 207--232. Google ScholarDigital Library
- Seitz, S. M., and Dyer, C. M. 1996. View morphing. In SIGGRAPH Conf. Proc., 21--30. Google ScholarDigital Library
- Shum, H.-Y., and He, L.-W. 1999. Rendering with concentric mosaics. In SIGGRAPH Conf. Proc., 299--306. Google ScholarDigital Library
- Simon, I., Snavely, N., and Seitz, S. M. 2007. Scene summarization for online image collections. In Proc. Int. Conf. on Computer Vision.Google Scholar
- Snavely, N., Seitz, S. M., and Szeliski, R. 2006. Photo tourism: exploring photo collections in 3D. In SIGGRAPH Conf. Proc., 835--846. Google ScholarDigital Library
- Snavely, N., Seitz, S. M., and Szeliski, R. 2008. Skeletal sets for efficient structure from motion. In Proc. Computer Vision and Pattern Recognition (to appear).Google Scholar
- Sutherland, I. E. 1968. A head-mounted three dimensional display. In Proc. Fall Joint Computer Conf., 757--764.Google ScholarDigital Library
- Tan, D. S., Robertson, G. G., and Czerwinski, M. 2001. Exploring 3d navigation: combining speed-coupled flying with orbiting. In Proc. Conf. on Human Factors in Computing Systems, ACM Press, 418--425. Google ScholarDigital Library
- Taylor, C. J. 2002. VideoPlus: a method for capturing the structure and appearance of immersive environments. IEEE Transactions on Visualization and Computer Graphics 8, 2 (April-June), 171--182. Google ScholarDigital Library
- Uyttendaele, M., Criminisi, A., Kang, S. B., Winder, S., Szeliski, R., and Hartley, R. 2004. Image-based interactive exploration of real-world environments. IEEE Computer Graphics and Applications 24, 3, 52--63. Google ScholarDigital Library
- Ware, C., and Osborne, S. 1990. Exploration and virtual camera control in virtual three dimensional environments. In Proc. Symposium on Interactive 3D Graphics, ACM Press, 175--183. Google ScholarDigital Library
Index Terms
- Finding paths through the world's photos
Recommendations
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
In this paper we introduce a method to compute non-dominated bicriteria shortest pairs, each including two disjoint simple paths. The method is based on an algorithm for ranking pairs of disjoint simple paths by non-decreasing order of cost, that is an ...
Finding next-to-shortest paths in a graph
We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest (u,v)-path is a shortest (u,v)-path amongst (u,v)-paths with length strictly greater than the length of the shortest (u,v)-path. In contrast to the situation in ...
Improved algorithm for finding next-to-shortest paths
We study the problem of finding the next-to-shortest paths in a weighted undirected graph. A next-to-shortest (u, v)-path is a shortest (u, v)-path amongst (u, v)-paths with length strictly greater than the length of the shortest (u, v)-path. The first ...
Comments