Fast 3D boundary computation from occluding contour motion

Presents a fast method for computing a bounding volume within which an observed object must lie from the observed motion of the occluding contour during a straight-line motion of the camera. The bounding volume is represented as a set of planar cross sections each consisting of multiple convex polygons within which the object lies. The algorithm's worst-case runtime performance is O(nmk) operations, where n is the number of viewpoints used, m is the number of polygons created during the execution of the algorithm, and k is a parameter dependent on the geometric complexity of the object being viewed. Experimental examples are demonstrated; bounding polygon computation from sampled contours in 20 images required less than one second on a 50 MHz i486 CPU.

[1]  Jean Ponce,et al.  Automatic model construction, pose estimation, and object recognition from photographs using triangular splines , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[2]  Olivier D. Faugeras,et al.  Using Extremal Boundaries for 3-D Object Modeling , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Roger Mohr,et al.  Relative 3D Regularized B-spline Surface Reconstruction Through Image Sequences , 1994, ECCV.

[4]  Susan Hackwood,et al.  Computational geometric methods in volumetric intersection for 3D reconstruction , 1990, Pattern Recognit..

[5]  Jiang Yu Zheng,et al.  Acquiring 3-D Models from Sequences of Contours , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Gregory D. Hager,et al.  X Vision: A Portable Substrate for Real-Time Vision Applications , 1998, Comput. Vis. Image Underst..

[7]  Susan Hackwood,et al.  Computational geometric methods in volumetric intersection for 3D reconstruction , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[8]  Richard S. Weiss,et al.  Reconstruction of Surfaces from Profiles , 1987, ICCV 1987.