Exact Visual Hull From Marching Cubes

The marching cubes algorithm has been widely adopted for extracting a surface mesh from a volumetric description of the visual hull reconstructed from silhouettes. However, typical volumetric descriptions, such as an octree, provide only a binary description about the visual hull. The lack of interpolation information along each voxel edge, which is required by the marching cubes algorithm, usually results in inaccurate and bumpy surface mesh. In this paper, we propose a novel method to efficiently estimate the exact intersections between voxel edges and the visual hull boundary, which replace the missing interpolation information. The method improves both the visual quality and accuracy of the estimated visual hull mesh, while retaining the simplicity and robustness of the volumetric approach. To verify this claim, we present both synthetic and real-world experiments, as well as comparisons with existing volumetric approaches and other approaches targeting at an exact visual hull reconstruction.