Algebraic solution for the visual hull

We introduce an algebraic dual-space method for reconstructing the visual hull of a three-dimensional object from occluding contours observed in 2D images. The method exploits the differential structure of the manifold rather than parallax geometry, and therefore requires no correspondences. We begin by observing that the set of 2D contour tangents determines a surface in a dual space where each point represents a tangent plane to the original surface. The primal and dual surfaces have a symmetric algebra: A point on one is orthogonal to its dual point and tangent basis on the other. Thus the primal surface can be reconstructed if the local dual tangent basis can be estimated. Typically this is impossible because the dual surface is noisy and riddled with tangent singularities due to self-crossings. We identify a directionally-indexed local tangent basis that is well-defined and estimable everywhere on the dual surface. The estimation procedure handles singularities in the dual surface and degeneracies arising from measurement noise. The resulting method has O(N) complexity for N observed contour points and gives asymptotically exact reconstructions of surfaces that are totally observable from occluding contours.

[1]  David B. Cooper,et al.  A unified linear fitting approach for singular and nonsingular 3D quadrics from occluding contours , 2003, First IEEE International Workshop on Higher-Level Knowledge in 3D Modeling and Motion Analysis, 2003. HLK 2003..

[2]  Edmond Boyer,et al.  Exact polyhedral visual hulls , 2003, BMVC.

[3]  Edmond Boyer,et al.  A hybrid approach for computing visual hulls of complex objects , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[4]  Jean Ponce,et al.  On computing exact visual hulls of solids bounded by smooth surfaces , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[5]  Kongbin Kang,et al.  A linear dual-space approach to 3D surface reconstruction from occluding contours using algebraic surfaces , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[6]  Wojciech Matusik,et al.  Polyhedral Visual Hulls for Real-Time Rendering , 2001, Rendering Techniques.

[7]  David J. Kriegman,et al.  Duals, Invariants, and the Recognition of Smooth Objects from their Occlucing Contours , 2000, ECCV.

[8]  Kiriakos N. Kutulakos,et al.  A Theory of Shape by Space Carving , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[9]  Andrew Zisserman,et al.  Quadric reconstruction from dual-space geometry , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[10]  Kiriakos N. Kutulakos Shape from the light field boundary , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

[12]  Matthew Brand,et al.  Charting a Manifold , 2002, NIPS.

[13]  Andrew Zisserman,et al.  Quadric Surface Reconstruction from Dual-Space Geometry. , 1998, ICCV 1998.

[14]  Roberto Cipolla,et al.  The visual motion of curves and surfaces , 1998, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

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