The Community for Technology Leaders
2017 IEEE Pacific Visualization Symposium (PacificVis) (2017)
Seoul, South Korea
April 18, 2017 to April 21, 2017
ISSN: 2165-8773
ISBN: 978-1-5090-5739-9
pp: 121-130
Tzu-Hsuan Wei , The Ohio State University, United States of America
Chun-Ming Chen , The Ohio State University, United States of America
Jonathan Woodring , Los Alamos National Laboratory, United States of America
HuiJie Zhang , Northeast Normal University, China
Han-Wei Shen , The Ohio State University, United States of America
ABSTRACT
Local distribution search is used in query-driven visualization for identifying salient features. Due to the high computational and storage costs, local distribution search in multi-field datasets is challenging. In this paper, we introduce two high performance, memory efficient algorithms for searching for local distributions that are characterized by marginal and joint features in multi-field datasets. They leverage bitmap indexing and local voting to efficiently extract regions that match a target distribution, by first approximating search results and refining to generate the final result. The first algorithm, merged-bin-comparison (MBC), reduces the computation of histogram dissimilarity measures by clustering bins. The second algorithm, sampled-active voxels (SAV), adopts stratified sampling to reduce the workload for searching local distributions with large spatial neighborhoods. The efficiency and efficacy of our algorithms are demonstrated in multiple experiments.
INDEX TERMS
Histograms, Indexing, Data visualization, Approximation algorithms, Electronic mail, Feature extraction, Clustering algorithms
CITATION
Tzu-Hsuan Wei, Chun-Ming Chen, Jonathan Woodring, HuiJie Zhang, Han-Wei Shen, "Efficient distribution-based feature search in multi-field datasets", 2017 IEEE Pacific Visualization Symposium (PacificVis), vol. 00, no. , pp. 121-130, 2017, doi:10.1109/PACIFICVIS.2017.8031586
80 ms
(Ver 3.3 (11022016))