Extremal feature extraction from 3-D vector and noisy scalar fields

We are interested in feature extraction from volume data in terms of coherent surfaces and 3D space curves. The input can be an inaccurate scalar or vector field, sampled densely or sparsely on a regular 3D grid, in which poor resolution and the presence of spurious noisy samples make traditional iso-surface techniques inappropriate. In this paper, we present a general-purpose methodology to extract surfaces or curves from a digital 3D potential vector field {(s,v~)}, in which each voxel holds a scalar s designating the strength and a vector v~ indicating the direction. For scalar, sparse or low-resolution data, we "vectorize" and "densify" the volume by tensor voting to produce dense vector fields that are suitable as input to our algorithms, the extremal surface and curve algorithms. Both algorithms extract, with sub-voxel precision, coherent features representing local extrema in the given vector field. These coherent features are a hole-free triangulation mesh (in the surface case), and a set of connected, oriented and non-intersecting polyline segments (in the curve case). We demonstrate the general usefulness of both extremal algorithms on a variety of real data by properly extracting their inherent extremal properties, such as (a) shock waves induced by abrupt velocity or direction changes in a flow field, (b) interacting vortex cores and vorticity lines in a velocity field, (c) crest-lines and ridges implicit in a digital terrain map, and (d) grooves, anatomical lines and complex surfaces from noisy dental data.

[1]  Bernd Hamann,et al.  The asymptotic decider: resolving the ambiguity in marching cubes , 1991, Proceeding Visualization '91.

[2]  Richard M. Lueptow,et al.  Spatio-temporal character of non-wavy and wavy Taylor–Couette flow , 1998, Journal of Fluid Mechanics.

[3]  Hans-Georg Pagendarm,et al.  Feature detection from vector quantities in a numerically simulated hypersonic flow field in combination with experimental flow visualization , 1994, Proceedings Visualization '94.

[4]  Lambertus Hesselink,et al.  Visualizing vector field topology in fluid flows , 1991, IEEE Computer Graphics and Applications.

[5]  Gabor T. Herman,et al.  On topology as applied to image analysis , 1990, Comput. Vis. Graph. Image Process..

[6]  Mi-Suen Lee,et al.  Inferring segmented surface description from stereo data , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[7]  David C. Banks,et al.  Vortex tubes in turbulent flows: identification, representation, reconstruction , 1994, Proceedings Visualization '94.

[8]  Kwan-Liu Ma,et al.  3D shock wave visualization on unstructured grids , 1996, Proceedings of 1996 Symposium on Volume Visualization.

[9]  Gérard G. Medioni,et al.  Inference of Surfaces, 3D Curves, and Junctions From Sparse, Noisy, 3D Data , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  P. Buning,et al.  Simulation of blunt-fin-induced shock wave and turbulent boundary-layer interaction , 1984 .

[11]  Kwan-Liu Ma,et al.  3D visualization of unsteady 2D airplane wake vortices , 1994, Proceedings Visualization '94.

[12]  Brian Cabral,et al.  Imaging vector fields using line integral convolution , 1993, SIGGRAPH.

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

[14]  Koji Koyamada,et al.  Automatic Isosurface Propagation Using an Extrema Graph and Sorted Boundary Cell Lists , 1995, IEEE Trans. Vis. Comput. Graph..

[15]  Gérard G. Medioni,et al.  Integrated surface, curve and junction inference from sparse 3-D data sets , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[16]  Han-Wei Shen,et al.  A Near Optimal Isosurface Extraction Algorithm Using the Span Space , 1996, IEEE Trans. Vis. Comput. Graph..