Multi-view Reconstruction of Unknown Objects within a Known Environment
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Shape from incomplete silhouettes based on the reprojection error
Image and Vision Computing
Modularity for large virtual reality applications
Presence: Teleoperators and Virtual Environments
From silhouettes to 3D points to mesh: towards free viewpoint video
Proceedings of the 1st international workshop on 3D video processing
Fast computation of a visual hull
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part IV
High quality visual hull reconstruction by delaunay refinement
Transactions on computational science IX
High quality visual hull reconstruction by delaunay refinement
Transactions on computational science IX
Camera Image Synchronisation in Multiple Camera Real-Time 3D Reconstruction of Moving Humans
DS-RT '11 Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications
Shape from Silhouette Consensus
Pattern Recognition
Novel-View Synthesis of Outdoor Sport Events Using an Adaptive View-Dependent Geometry
Computer Graphics Forum
Generalised relaxed Radon transform (GR2T) for robust inference
Pattern Recognition
Bayesian shape from silhouettes
MUSCLE'11 Proceedings of the 2011 international conference on Computational Intelligence for Multimedia Understanding
A hybrid image-based modelling algorithm
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
Bayesian 3D shape from silhouettes
Digital Signal Processing
| Hi-index | 0.14 |
Modeling from silhouettes is a popular and useful topic in computer vision. Many methods exist to compute the surface of the visual hull from silhouettes, but few address the problem of ensuring sane topological properties of the surface, such as manifoldness. This article provides an efficient algorithm to compute such a surface in the form of a polyhedral mesh. It relies on a small number of geometric operations to compute a visual hull polyhedron in a single pass. Such simplicity enables the algorithm to combine the advantages of being fast, producing pixel-exact surfaces, and repeatably yield manifold and watertight polyhedra in general experimental conditions with real data, as verified with all datasets tested. The algorithm is fully described, its complexity analyzed and modeling results given.