Multi-view stereo via volumetric graph-cuts
Multi-view stereo via volumetric graph-cuts
复制标题
DOI：
10.1109/cvpr.2005.238
复制
发表时间：
2005-06
期刊：
影响因子：
--
通讯作者：
George Vogiatzis;P. Torr;R. Cipolla
中科院分区：
文献类型：
--
作者：
George Vogiatzis;P. Torr;R. Cipolla
本文提出了一种新的多视图场景重建方法。虽然这个公式受益于体积场景表示，但它适用于使用Graph-cuts进行计算上可处理的全局优化。该算法使用场景的视觉外壳来推断遮挡，并作为场景拓扑的约束。定义了基于照片一致性的表面代价函数，并用加权图对其进行离散。得到该离散泛函下的最优曲面作为加权图的最小割解。我们的方法提供了一个视点无关的表面正则化，遮挡的近似处理和一个易于处理的优化方案。给出了在真实场景下有希望的实验结果以及在合成场景下的定量评价。
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.