Multi-View Stereo via Volumetric Graph-Cuts
2005
Abstract
This paper presents a novel formulation for the multi-view scene reconstruction problem. While this formulation benefits from a volumetric scene representation, it is amenable to a computationally tractable global optimisation using Graph-cuts. The algorithm proposed uses the visual hull of the scene to infer occlusions and as a constraint on the topology of the scene. A photo consistency-based surface cost functional is defined and discretised with a weighted graph. The optimal surface under this discretised functional is obtained as the minimum cut solution of the weighted graph. Our method provides a viewpoint independent surface regularisation, approximate handling of occlusions and a tractable optimisation scheme. Promising experimental results on real scenes as well as a quantitative evaluation on a synthetic scene are presented.
Citation
George Vogiatzis, Philip H. S. Torr and Roberto Cipolla. “Multi-View Stereo via Volumetric Graph-Cuts.” 2005.
BibTeX
@inproceedings{vogiatzis2005,
title = {Multi-View Stereo via Volumetric Graph-Cuts},
author = {George Vogiatzis and Philip H. S. Torr and Roberto Cipolla},
volume = {2},
pages = {391--398},
year = {2005},
doi = {10.1109/cvpr.2005.238},
}