Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Martin Imre

dblp:206/0448 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
multivariate data visualization
0.412019
Exploring Time-Varying Multivariate Volume Data Using Matrix of Isosurface Similarity Maps · IEEE Trans. Vis. Comput. Graph. 2019
Visualization and visual analytics
volume visualization
0.412019
Exploring Time-Varying Multivariate Volume Data Using Matrix of Isosurface Similarity Maps · IEEE Trans. Vis. Comput. Graph. 2019
Data mining
clustering
0.112019
Exploring Time-Varying Multivariate Volume Data Using Matrix of Isosurface Similarity Maps · IEEE Trans. Vis. Comput. Graph. 2019
Data mining › clustering
temporal clustering
0.112019
Exploring Time-Varying Multivariate Volume Data Using Matrix of Isosurface Similarity Maps · IEEE Trans. Vis. Comput. Graph. 2019

Methods — techniques the papers use, named apart from their topics

similarity map · 0.8silhouette-based rendering · 0.8path recommendation · 0.8
YearPublicationVenuePosition
2020 Spectrum-preserving sparsification for visualization of big graphs
Martin Imre, Jun Tao 0002, Yongyu Wang, Chaoli Wang 0001
Comput. Graph.1
2019 Exploring Time-Varying Multivariate Volume Data Using Matrix of Isosurface Similarity Maps
abstract
We present a novel visual representation and interface named the matrix of isosurface similarity maps (MISM) for effective exploration of large time-varying multivariate volumetric data sets. MISM synthesizes three types of similarity maps (i.e., self, temporal, and variable similarity maps) to capture the essential relationships among isosurfaces of different variables and time steps. Additionally, it serves as the main visual mapping and navigation tool for examining the vast number of isosurfaces and exploring the underlying time-varying multivariate data set. We present temporal clustering, variable grouping, and interactive filtering to reduce the huge exploration space of MISM. In conjunction with the isovalue and isosurface views, MISM allows users to identify important isosurfaces or isosurface pairs and compare them over space, time, and value range. More importantly, we introduce path recommendation that suggests, animates, and compares traversal paths for effectively exploring MISM under varied criteria and at different levels-of-detail. A silhouette-based method is applied to render multiple surfaces of interest in a visually succinct manner. We demonstrate the effectiveness of our approach with case studies of several time-varying multivariate data sets and an ensemble data set, and evaluate our work with two domain experts.
Jun Tao 0002, Martin Imre, Chaoli Wang 0001, Nitesh V. Chawla, Hanqi Guo 0001, Gokhan Sever
IEEE Trans. Vis. Comput. Graph.2
2018 Identifying nearly equally spaced isosurfaces for volumetric data sets
Martin Imre, Jun Tao 0002, Chaoli Wang 0001
Comput. Graph.1
2017 Efficient GPU-accelerated computation of isosurface similarity maps
abstract
We present an efficient GPU-based solution to compute isosurface similarity maps for scientific volume data sets. Our approach first replaces exact isosurface extraction with a binary volume indicating whether each voxel intersects the surface or not. We then employ bounding volume hierarchy (BVH)-trees to speed up the distance field computation. Finally, a self-similarity map is generated from which we identify representative isosurfaces. We apply our approach to compute isosurface similarity maps from different volume data sets of varying sizes and characteristics. The results demonstrate significant speed gain with acceptable loss of accuracy, showing the potential of our solution for handling large-scale time-varying multivariate data sets.
Martin Imre, Jun Tao 0002, Chaoli Wang 0001
PacificVis1