Approximate N-View Stereo (2000)
Cached
Download Links
- [www.cs.rochester.edu]
- [www.cs.toronto.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | in Proc. European Conf. on Computer Vision |
| Citations: | 51 - 4 self |
BibTeX
@INPROCEEDINGS{Kutulakos00approximaten-view,
author = {Kiriakos N. Kutulakos},
title = {Approximate N-View Stereo},
booktitle = {in Proc. European Conf. on Computer Vision},
year = {2000},
pages = {67--83}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper introduces a new multi-view reconstruction problem called approximate N-view stereo. The goal of this problem is to recover a oneparameter 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 ...
