A Computational Geometric Approach to Visual Hulls

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.

[1]  Frédo Durand,et al.  The 3D Visibility Complex: A New Approach to the Problems of Accurate Visibility , 1996, Rendering Techniques.

[2]  Marie-Odile Berger,et al.  3D Surface Reconstruction Using Occluding Contours , 1995, International Journal of Computer Vision.

[3]  David M. Mount,et al.  An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.

[4]  Michel Pocchiola,et al.  The visibility complex , 1993, SCG '93.

[5]  Mark H. Overmars,et al.  New methods for computing visibility graphs , 1988, SCG '88.

[6]  David M. Mount,et al.  An output sensitive algorithm for computing visibility graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[7]  Raimund Seidel,et al.  Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Kiriakos N. Kutulakos,et al.  Recovering shape by purposive viewpoint adjustment , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[9]  Subhash Suri,et al.  On some link distance problems in a simple polygon , 1990, IEEE Trans. Robotics Autom..

[10]  A. Laurentini,et al.  The Visual Hull Concept for Silhouette-Based Image Understanding , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  John F. Canny,et al.  Object Recognition and Localization from Scanning Beam Sensors , 1997, Int. J. Robotics Res..

[12]  J. H. Rieger.  On the complexity and computation of view graphs of piecewise smooth algebraic surfaces , 1996, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[13]  Bruce G. Baumgart,et al.  Geometric modeling for computer vision. , 1974 .

[14]  F. Pointet.  SEPARATION DE SURFACES A L'AIDE DE CONTOURS APPARENTS , 1994 .

[15]  Aldo Laurentini,et al.  How Far 3D Shapes Can Be Understood from 2D Silhouettes , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Michel Pocchiola,et al.  Computing the visibility graph via pseudo-triangulations , 1995, SCG '95.

[17]  Esther M. Arkin,et al.  Arrangements of segments that share endpoints: Single face results , 1995, Discret. Comput. Geom..

[18]  Marco Pellegrini.  On lines missing polyhedral sets in 3-space , 1994, Discret. Comput. Geom..