3D Surface reconstruction using occluding contours

Wong

Computer Vision – ACCV 2006

et al. 2006

Abstract. In this paper, we design and implement a novel method for constructing a mixed triangle/quadrangle mesh from the 3D space curves (rims) estimated from the profiles of an object in an image sequence without knowing the original 3D topology of the object. To this aim, a contour data structure for representing visual hull, which is different from that for CT/MRI, is introduced. In this paper, we (1) solve the "branching structure" problem by introducing some additional "directed edge", and (2) extract a triangle/quadrangle closed mesh from the contour structure with an algorithm based on dynamic programming. Both theoretical demonstration and real world results show that our proposed method has sufficient robustness with respect to the complex topology of the object, and the extracted mesh is of high quality.

Section: Related Workmentioning

confidence: 99%

“…Various techniques [1][2][3] have been developed for estimating rims from silhouettes . The rims so obtained carry not only 3D positional information of the space curves, but also surface information like the surface normal.…”

Section: Introductionmentioning

confidence: 99%

Extracting Surface Representations from Rim Curves

Wong

Computer Vision – ACCV 2006

et al. 2006

Image and Vision Computing

“…extract the apparent contours of the rotating object using cubic B-spline snakes; initialize l s , l h and the N − 1 angles between the N cameras; while not converged do for each image in the sequence do form the fundamental matrices with the next 2 images; locate epipolar tangents; compute reprojection errors of the epipolar tangents; end for update parameters to minimize the rms reprojection errors using the conjugate gradient method [37]; end while available, a surface model can be obtained by reconstructing the contour generators of a simple surface using differential techniques [7,[11][12][13]. On the other hand, if only sparse, discrete views are available and the object has relatively complex topologies, volume intersection techniques [38,39] can be employed to produce a volumetric model which represents the visual hull [40,41] of the object.…”

Section: Algorithm 1 Motion Estimation From Apparent Contoursmentioning

confidence: 99%

“…In [12], Boyer and Berger derived a depth formulation from a local approximation of the surface up to order two for discrete motion. Their technique allows the local shape to be estimated from 3 consecutive contours by solving a pair of simultaneous equations, and it only requires that the surfaces are at least C 2 and are not locally planar.…”

Section: Surface Approachmentioning

confidence: 99%

See 1 more Smart Citation

Structure and motion estimation from apparent contours under circular motion

Wong

Mendonça

Cipolla

2002

In this paper we address the problem of recovering structure and motion from the apparent contours of a smooth surface. Fixed image features under circular motion and their relationships with the intrinsic parameters of the camera are exploited to provide a simple parameterization of the fundamental matrix relating any pair of views in the sequence. Such a parameterization allows a trivial initialization of the motion parameters, which all bear physical meanings. It also greatly reduces the dimension of the search space for the optimization problem, which can now be solved using only 2 epipolar tangents. In contrast to previous methods, the motion estimation algorithm introduced here can cope with incomplete circular motion and more widely spaced images. Existing techniques for model reconstruction from apparent contours are then reviewed and compared. Experiment on real data has been carried out and the 3D model reconstructed from the estimated motion is presented.

Numerical Meth Engineering

Efficient surface reconstruction from contours based on two‐dimensional Delaunay triangulation

Wang

Hassan

Morgan

et al. 2005

SUMMARYThis paper introduces an efficient method for surface reconstruction from sectional contours. The surface between neighbouring sections is reconstructed based on the consistent utilization of the twodimensional constrained Delaunay triangulation. The triangulation is used to extract the parametric domain and to solve the problems associated with correspondence, tiling and branching in a general framework. Natural distance interpolations are performed in order to complete the mapping of the added intermediate points. Surface smoothing and remeshing are conducted to optimize the initial surface triangulations. Several examples are presented to demonstrate the effectiveness and efficiency of the proposed approach.