Decomposition and Simplification of Multivariate Data using Pareto Sets

Topological and structural analysis of multivariate data is aimed at improving the understanding and usage of such data through identification of intrinsic features and structural relationships among multiple variables. We present two novel methods for simplifying so-called Pareto sets that describe such structural relationships. Such simplification is a precondition for meaningful visualization of structurally rich or noisy data. As a framework for simplification operations, we introduce a decomposition of the data domain into regions of equivalent structural behavior and the reachability graph that describes global connectivity of Pareto extrema. Simplification is then performed as a sequence of edge collapses in this graph; to determine a suitable sequence of such operations, we describe and utilize a comparison measure that reflects the changes to the data that each operation represents. We demonstrate and evaluate our methods on synthetic and real-world examples.

[1]  Günter Rote,et al.  Simple and optimal output-sensitive construction of contour trees using monotone paths , 2005, Comput. Geom..

[2]  H. Whitney On Singularities of Mappings of Euclidean Spaces. I. Mappings of the Plane Into the Plane , 1955 .

[3]  Vijay Natarajan,et al.  Parallel Computation of 2D Morse-Smale Complexes , 2012, IEEE Transactions on Visualization and Computer Graphics.

[4]  Herbert Edelsbrunner,et al.  Reeb spaces of piecewise linear mappings , 2008, SCG '08.

[5]  Vijay Natarajan,et al.  Simplification of Jacobi Sets , 2011, Topological Methods in Data Analysis and Visualization.

[6]  Jianlong Zhou,et al.  Automatic Transfer Function Generation Using Contour Tree Controlled Residue Flow Model and Color Harmonics , 2009, IEEE Transactions on Visualization and Computer Graphics.

[7]  Valerio Pascucci,et al.  Generalized Topological Simplification of Scalar Fields on Surfaces , 2012, IEEE Transactions on Visualization and Computer Graphics.

[8]  Peter F. Stadler,et al.  Barrier Trees on Poset-Valued Landscapes , 2003, Genetic Programming and Evolvable Machines.

[9]  Gerik Scheuermann,et al.  Towards Multifield Scalar Topology Based on Pareto Optimality , 2013, Comput. Graph. Forum.

[10]  Jinhee Jeong,et al.  On the identification of a vortex , 1995, Journal of Fluid Mechanics.

[11]  Andrzej Szymczak Stable Morse Decompositions for Piecewise Constant Vector Fields on Surfaces , 2011, Comput. Graph. Forum.

[12]  Valerio Pascucci,et al.  Efficient computation of the topology of level sets , 2002, IEEE Visualization, 2002. VIS 2002..

[13]  Valerio Pascucci,et al.  Robust on-line computation of Reeb graphs: simplicity and speed , 2007, ACM Trans. Graph..

[14]  Bernd Hamann,et al.  A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality , 2008, IEEE Transactions on Visualization and Computer Graphics.

[15]  Vijay Natarajan,et al.  Computing Reeb Graphs as a Union of Contour Trees , 2013, IEEE Transactions on Visualization and Computer Graphics.

[16]  David J. Duke,et al.  Joint Contour Nets , 2014, IEEE Transactions on Visualization and Computer Graphics.

[17]  Hans Hagen,et al.  A topology simplification method for 2D vector fields , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[18]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[19]  Bernd Hamann,et al.  Topology-based simplification for feature extraction from 3D scalar fields , 2005, VIS 05. IEEE Visualization, 2005..

[20]  Hassler Whitney,et al.  Singularities of Mappings of Euclidean Spaces , 1992 .

[21]  Gerik Scheuermann,et al.  Interactive comparison of multifield scalar data based on largest contours , 2013, Comput. Aided Geom. Des..

[22]  Jack Snoeyink,et al.  Computing contour trees in all dimensions , 2000, SODA '00.