Distance between Extremum Graphs

Narayanan, Vidya and Thomas, Dilip Mathew and Natarajan, Vijay (2015) Distance between Extremum Graphs. In: IEEE Pacific Visualization Symposium (PacificVis), APR 14-17, 2015, Hangzhou, PEOPLES R CHINA, pp. 263-270.

PDF IEEE_Pac_Vis_Sym_263_2015.pdf - Published Version Restricted to Registered users only Download (3MB) | Request a copy

Abstract

Scientific phenomena are often studied through collections of related scalar fields generated from different observations of the same phenomenon. Exploration of such data requires a robust distance measure to compare scalar fields for tasks such as identifying key events and establishing correspondence between features in the data. Towards this goal, we propose a topological data structure called the complete extremum graph and define a distance measure on it for comparing scalar fields in a feature-aware manner. We design an algorithm for computing the distance and show its applications in analysing time varying data.

Item Type:	Conference Proceedings
Series.:	IEEE Pacific Visualization Symposium
Additional Information:	Copy right of this article belongs to the IEEE
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	08 Oct 2016 07:22
Last Modified:	08 Oct 2016 07:22
URI:	http://eprints.iisc.ac.in/id/eprint/54781

Actions (login required)

View Item