The Community for Technology Leaders
Green Image
Issue No. 12 - Dec. (2012 vol. 18)
ISSN: 1077-2626
pp: 2355-2363
J. JaJa , Inst. for Adv. Comput. Studies, Univ. of Maryland, College Park, MD, USA
A. Varshney , Inst. for Adv. Comput. Studies, Univ. of Maryland, College Park, MD, USA
Cheuk Yiu Ip , Inst. for Adv. Comput. Studies, Univ. of Maryland, College Park, MD, USA
Visual exploration of volumetric datasets to discover the embedded features and spatial structures is a challenging and tedious task. In this paper we present a semi-automatic approach to this problem that works by visually segmenting the intensity-gradient 2D histogram of a volumetric dataset into an exploration hierarchy. Our approach mimics user exploration behavior by analyzing the histogram with the normalized-cut multilevel segmentation technique. Unlike previous work in this area, our technique segments the histogram into a reasonable set of intuitive components that are mutually exclusive and collectively exhaustive. We use information-theoretic measures of the volumetric data segments to guide the exploration. This provides a data-driven coarse-to-fine hierarchy for a user to interactively navigate the volume in a meaningful manner.
information theory, data visualisation, gradient methods, image segmentation, data-driven coarse-to-fine hierarchy, hierarchical volume exploration, intensity-gradient histogram, visual exploration, volumetric dataset, visual segmentation, intensity-gradient 2D histogram, exploration hierarchy, user exploration behavior, normalized-cut multilevel segmentation, histogram segmentation, information-theoretic measures, volumetric data segment, Histograms, Image segmentation, Visualization, Entropy, Transfer functions, Shape analysis, Volume measurement, Information-guided exploration, Volume exploration, volume classification, normalized cut
J. JaJa, A. Varshney, Cheuk Yiu Ip, "Hierarchical Exploration of Volumes Using Multilevel Segmentation of the Intensity-Gradient Histograms", IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. , pp. 2355-2363, Dec. 2012, doi:10.1109/TVCG.2012.231
88 ms
(Ver 3.3 (11022016))