GPU-based parallel construction of compact visual hull meshes

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

3

초록

Building a visual hull model from multiple two-dimensional images provides an effective way of understanding the three-dimensional geometries inherent in the images. In this paper, we present a GPU accelerated algorithm for volumetric visual hull reconstruction that aims to harness the full compute power of the many-core processor. From a set of binary silhouette images with respective camera parameters, our parallel algorithm directly outputs the triangular mesh of the resulting visual hull in the indexed face set format for a compact mesh representation. Unlike previous approaches, the presented method extracts a smooth silhouette contour on the fly from each binary image, which markedly reduces the bumpy artifacts on the visual hull surface due to a simple binary in/out classification. In addition, it applies several optimization techniques that allow an efficient CUDA implementation. We also demonstrate that the compact mesh construction scheme can easily be modified for also producing a time- and space-efficient GPU implementation of the marching cubes algorithm.

키워드

Visual hullVolumetric approachCompact meshGPU algorithmCUDA implementationMarching cubes algorithm
제목
GPU-based parallel construction of compact visual hull meshes
저자
Chang, ByungjoonWoo, SangkyuIhm, Insung
DOI
10.1007/s00371-013-0796-2
발행일
2014-02
유형
Article
저널명
Visual Computer
30
2
페이지
201 ~ 211