Segmentation of discrete vector fields

In this paper, we propose an approach for 2D discrete vector field segmentation based on the Green function and normalized cut. The method is inspired by discrete Hodge decomposition such that a discrete vector field can be broken down into three simpler components, namely, curl-free, divergence-free, and harmonic components. We show that the Green function method (GFM) can be used to approximate the curl-free and the divergence-free components to achieve our goal of the vector field segmentation. The final segmentation curves that represent the boundaries of the influence region of singularities are obtained from the optimal vector field segmentations. These curves are composed of piecewise smooth contours or streamlines. Our method is applicable to both linear and nonlinear discrete vector fields. Experiments show that the segmentations obtained using our approach essentially agree with human perceptual judgement

[1]  Wilfrid Lefer,et al.  Creating Evenly-Spaced Streamlines of Arbitrary Density , 1997, Visualization in Scientific Computing.

[2]  Hans Hagen,et al.  A topology simplification method for 2D vector fields , 2000 .

[3]  Alexandru Telea,et al.  Simplified representation of vector fields , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[4]  Hans Hagen,et al.  Continuous topology simplification of planar vector fields , 2001, Proceedings Visualization, 2001. VIS '01..

[5]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  Konrad Polthier,et al.  Identifying Vector Field Singularities Using a Discrete Hodge Decomposition , 2002, VisMath.

[7]  Jiann-Liang Chen,et al.  Normalized-cut algorithm for hierarchical vector field data segmentation , 2003, IS&T/SPIE Electronic Imaging.

[8]  Harald Garcke,et al.  A Phase Field Model for Continuous Clustering on Vector Fields , 2001, IEEE Trans. Vis. Comput. Graph..

[9]  Santiago V. Lombeyda,et al.  Discrete multiscale vector field decomposition , 2003, ACM Trans. Graph..

[10]  Bernd Hamann,et al.  Construction of vector field hierarchies , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[11]  Lambertus Hesselink,et al.  Representation and display of vector field topology in fluid flow data sets , 1989, Computer.

[12]  Michael T. Heath,et al.  Scientific Computing , 2018 .

[13]  TongYiying,et al.  Discrete multiscale vector field decomposition , 2003 .

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

[15]  Jos Stam,et al.  Stable fluids , 1999, SIGGRAPH.

[16]  Ronald Fedkiw,et al.  Visual simulation of smoke , 2001, SIGGRAPH.

[17]  Harald Garcke,et al.  A continuous clustering method for vector fields , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[18]  Bernd Hamann,et al.  Cluster-Based Generation of Hierarchical Surface Models , 1997, Scientific Visualization Conference (dagstuhl '97).

[19]  W. D. Leeuw,et al.  Visualization of Global Flow Structures Using Multiple Levels of Topology , 1999 .

[20]  K. Polthier,et al.  Variational Approach to Vector Field Decomposition , 2000 .

[21]  Robert van Liere,et al.  Collapsing flow topology using area metrics , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[22]  Michael T. Heath,et al.  Scientific Computing: An Introductory Survey , 1996 .