A Computational Geometric Approach to Visual Hulls
Author:
- 1 August 1998
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Geometry & Applications
- Vol. 08 (04) , 407-436
Abstract
Recognizing 3D objects from their 2D silhouettes is a popular topic in computer vision. Object reconstruction can be performed using the volume intersection approach. The visual hull of an object is the best approximation of an object that can be obtained by volume intersection. From the point of view of recognition from silhouettes, the visual hull can not be distinguished from the original object. In this paper, we present efficient algorithms for computing visual hulls. We start with the case of planar figures (polygons and curved objects) and base our approach on an efficient algorithm for computing the visibility graph of planar figures. We present and tackle many topics related to the query of visual hulls and to the recognition of objects equal to their visual hulls. We then move on to the 3-dimensional case and give a flavor of how it may be approached.Keywords
This publication has 10 references indexed in Scilit:
- On the complexity and computation of view graphs of piecewise smooth algebraic surfacesPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1996
- Arrangements of segments that share endpoints: Single face resultsDiscrete & Computational Geometry, 1995
- Recovering shape by purposive viewpoint adjustmentInternational Journal of Computer Vision, 1994
- The visual hull concept for silhouette-based image understandingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1994
- An Output-Sensitive Algorithm for Computing Visibility GraphsSIAM Journal on Computing, 1991
- Efficiently computing and representing aspect graphs of polyhedral objectsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- Visibility, occlusion, and the aspect graphInternational Journal of Computer Vision, 1990
- On some link distance problems in a simple polygonIEEE Transactions on Robotics and Automation, 1990
- Visibility of disjoint polygonsAlgorithmica, 1986
- The internal representation of solid shape with respect to visionBiological Cybernetics, 1979