Demo Data from EDBT 2026 / reviewers in the wild / expert
Jonathan J. Helmus
dblp:179/3790
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2
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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 77% Environmental and earth informatics · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational science and engineering › scientific visualization
flow visualization |
0.2 | 1 | 2016 | Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady Flows · IEEE Trans. Vis. Comput. Graph. 2016 |
Environmental and earth informatics
atmospheric modeling |
0.1 | 1 | 2016 | Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady Flows · IEEE Trans. Vis. Comput. Graph. 2016 |
Methods — techniques the papers use, named apart from their topics
stochastic ridge finding · 0.2monte carlo · 0.2density estimation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Range likelihood tree: A compact and effective representation for visual exploration of uncertain data setsabstractUncertain data visualization plays a fundamental role in many applications such as weather forecast and analysis of fluid flows. Exploring scalar uncertain data modeled as probability distribution fields is a challenging task because the underlying features are often more complex, and the data associated with each grid point are high dimensional. In this work, we present a compact and effective representation, called range likelihood tree, to summarize and explore probability distribution fields. The key idea is to decompose and summarize each complex probability distribution over a few representative subranges by cumulative probabilities, and allow users to consider the roles that different subranges play in understanding the probability distributions. In our method, the value domain is first partitioned into subranges, then the distribution at each grid point is transformed according to the cumulative probabilities of the point's distribution in those subranges. Organizing the subranges into a hierarchical structure based on how these cumulative probabilities are spatially distributed in the grid points, the new range likelihood tree representation allows effective classification and identification of features through user query and exploration. We present an exploration framework with multiple interactive views to explore probability distribution fields, and provide guidelines for visual exploration using our framework. We demonstrate the effectiveness and usefulness of our approach in exploratory analysis using several representative uncertain data sets. Han-Wei Shen, Scott M. Collis, Jonathan J. Helmus |
PacificVis | 5 |
| 2016 | Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady FlowsabstractThe objective of this paper is to understand transport behavior in uncertain time-varying flow fields by redefining the finite-time Lyapunov exponent (FTLE) and Lagrangian coherent structure (LCS) as stochastic counterparts of their traditional deterministic definitions. Three new concepts are introduced: the distribution of the FTLE (D-FTLE), the FTLE of distributions (FTLE-D), and uncertain LCS (U-LCS). The D-FTLE is the probability density function of FTLE values for every spatiotemporal location, which can be visualized with different statistical measurements. The FTLE-D extends the deterministic FTLE by measuring the divergence of particle distributions. It gives a statistical overview of how transport behaviors vary in neighborhood locations. The U-LCS, the probabilities of finding LCSs over the domain, can be extracted with stochastic ridge finding and density estimation algorithms. We show that our approach produces better results than existing variance-based methods do. Our experiments also show that the combination of D-FTLE, FTLE-D, and U-LCS can help users understand transport behaviors and find separatrices in ensemble simulations of atmospheric processes. Hanqi Guo 0001, Tom Peterka, Han-Wei Shen, Scott M. Collis, Jonathan J. Helmus |
IEEE Trans. Vis. Comput. Graph. | 6 |