Geometrically deformed models: a method for extracting closed geometric models form volume data

We propose a new approach to the problem of generating a simple topologically-closed geometric model from a point-sampled volume data set. We call such a model a Geometrically Deformed Model or GDM. A GDM is created by placing a 'seed' model in the volume data set. The model is then deformed by a relaxation process that minimizes a set of constraints that provides a measure of how well the model fits the features in the data. Constraints are associated with each vertex in the model that control local deformation, interaction between the model and the data set, and the shape and topology of the model. Once generated, a GDM can be used for visualization, shape recognition, geometric measurements, or subjected to a series of geometric operations. This technique is of special importance because of the advent of nondestructive sensing equipment (CT, MRI) that generates point samples of true three-dimensional objects.

[1]  Pat Hanrahan,et al.  Volume Rendering , 2020, Definitions.

[2]  James V. Miller.  On GDM's: Geometrically Deformed Models for the Extraction of Closed Shapes from Volume Data , 1990 .

[3]  Stanley R Sternberg,et al.  Grayscale morphology , 1986 .

[4]  David E. Breen,et al.  Choreographing Goal-Oriented Motion Using Cost Functions , 1989 .

[5]  Andrew P. Witkin,et al.  Energy constraints on parameterized models , 1987, SIGGRAPH.

[6]  J. Canny.  Finding Edges and Lines in Images , 1983 .

[7]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[8]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[9]  Ruzena Bajcsy,et al.  Multiresolution elastic matching , 1989, Comput. Vis. Graph. Image Process..

[10]  James V. Miller,et al.  Extracting geometric models through constraint minimization , 1990, Proceedings of the First IEEE Conference on Visualization: Visualization `90.

[11]  Daniel Thalmann,et al.  State-of-the-art in Computer Animation , 1989, Springer Japan.

[12]  W. Lorensen,et al.  Two algorithms for the three-dimensional reconstruction of tomograms. , 1988, Medical physics.

[13]  Gabor T. Herman,et al.  The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm , 1980, SIGGRAPH '80.

[14]  Wei-Chung Lin,et al.  A new surface interpolation technique for reconstructing 3-D objects from serial cross sections , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[15]  Chin-Tu Chen,et al.  A new surface interpolation technique for reconstructing 3D objects from serial cross-sections , 1989, Comput. Vis. Graph. Image Process..

[16]  Paul Wintz,et al.  Digital image processing (2nd ed.) , 1987 .

[17]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[18]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, SIGGRAPH.