𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Surface Approximation of a Cloud of 3D Points

✍ Scribed by C.W. Liao; G. Medioni


Book ID
102966592
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
787 KB
Volume
57
Category
Article
ISSN
1077-3169

No coin nor oath required. For personal study only.

✦ Synopsis


We present an implementation of deformable models to approximate a 3-D surface given by a cloud of 3D points. It is an extension of our previous work on "B-snakes" (S. Menet, P. Saint-Marc, and G. Medioni, in Proceedings of Image Understanding Workshop, Pittsburgh, 1990, pp. 720-726; and C. W. Liao and G. Medioni, in Proceedings of International Conference on Pattern Recognition, Hague, Netherlands, 1992, pp. 745-748), which approximates curves and surfaces using B-splines. The user (or the system itself) provides an initial simple surface, such as closed cylinder, which is subject to internal forces (describing implicit continuity properties such as smoothness) and external forces which attract it toward the data points. The problem is cast in terms of energy minimization. We solve this nonconvex optimization problem by using the well-known Powell algorithm which guarantees convergence and does not require gradient information. The variables are the positions of the control points. The number of control points processed by Powell at one time is controlled. This methodology leads to a reasonable complexity, robustness, and good numerical stability. We keep the time and space complexities in check through a coarseto-fine approach and a partitioning scheme. We handle closed surfaces by decomposing an object into two caps and an open cylinder, smoothly connected. The process is controlled by two parameters only, which are constant for all our experiments. We show results on real range images to illustrate the applicability of our approach. The advantages of this approach are that it provides a compact representation of the approximated data and lends itself to applications such as nonrigid motion tracking and object recognition. Currently, our algorithm gives only a (C^{0}) continuous analytical description of the data, but because the output of our algorithm is in rectangular mesh format, a (C^{1}) or (C^{2}) surface can be constructed easily by existing algorithms (F. J. M. Schmitt, B. A. Barsky, and W.-H. Du, in ACM SIGGRAPH 86, pp. 179-1988). 01995 Academic Press, Inc.


πŸ“œ SIMILAR VOLUMES