In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
In this paper, we propose a visual hull algorithm, which guarantees a correct construction even in the presence of partial occlusion, while “correct” here means that the real ...
—We present a framework to compute the visual hull of a polyhedral scene, in which the vertices of the polyhedra are given with some imprecision. Two kinds of visual event surfac...
This paper introduces a region-of-interest visual hull refinement technique, based on flexible voxel grids for volumetric visual hull reconstructions. Region-of-interest refinemen...
We propose an advanced visual hull technique to compensate for outliers using reliabilities of the silhouettes. The proposed method consists of a foreground extraction technique b...
Hansung Kim, Ryuuki Sakamoto, Itaru Kitahara, Neal...