About
169
Publications
22,105
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
3,895
Citations
Introduction
Skills and Expertise
Current institution
Additional affiliations
July 2011 - present
July 2007 - July 2011
January 2003 - June 2007
Education
July 2007 - June 2011
Institute for Data Analysis and Visualization, UC Davis
Field of study
- Scientific Visualization
February 2003 - October 2007
Publications
Publications (169)
In this paper, we present a novel heuristic algorithm for the stable but NP-complete deformation-based edit distance on merge trees. Our key contribution is the introduction of a user-controlled look-ahead parameter that allows to trade off accuracy and computational cost. We achieve a fixed parameter tractable running time that is polynomial in th...
Proton computed tomography (pCT) aims to facilitate precise dose planning for hadron therapy, a promising and effective method for cancer treatment. Hadron therapy utilizes protons and heavy ions to deliver well-focused doses of radiation, leveraging the Bragg peak phenomenon to target tumors while sparing healthy tissues. The Bergen pCT Collaborat...
Objective. Monolithic active pixel sensors are used for charged particle tracking in many applications, from medical physics to astrophysics. The Bergen pCT collaboration designed a sampling calorimeter for proton computed tomography, based entirely on the ALICE PIxel DEtector (ALPIDE). The same telescope can be used for in-situ range verification...
Proton computed tomography (pCT) aims to facilitate precise dose planning for hadron therapy, a promising and effective method for cancer treatment. Hadron therapy utilizes protons and heavy ions to deliver well focused doses of radiation, leveraging the Bragg peak phenomenon to target tumors while sparing healthy tissues. The Bergen pCT Collaborat...
In this paper, we present a novel heuristic algorithm for the stable but NP-complete deformation-based edit distance on merge trees. Our key contribution is the introduction of a user-controlled look-ahead parameter that allows to trade off accuracy and computational cost. We achieve a fixed parameter tractable running time that is polynomial in th...
In many disciplines, the findable, accessible, interoperable, and reusable (FAIR) principles are a gold standard for data management and handling. While these disciplines often require FAIR principles to be at least partially implemented in their scientific work to avoid desk rejects, the visualization community is still working on a proper way to...
Scientists working with uncertain data, such as climate simulations, medical images, or ensembles of physical simulations, regularly confront the problem of comparing observations, e.g., to identify similarities, differences, or patterns. Current approaches in comparative visualization of uncertain scalar fields mainly rely on juxtaposition of both...
This paper describes the adaptation of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression to a distributed computational setting. Additionally, we extend the algorithm to efficiently compute connected components in distributed structured and unstructured grids, based either on the connectivity of the...
Visualization, from simple line plots to complex high-dimensional visual analysis systems, has established itself throughout numerous domains to explore, analyze, and evaluate data. Applying such visualizations in the context of simulation science where High-Performance Computing (HPC) produces ever-growing amounts of data that is more complex, pot...
This system paper documents the technical foundations for the extension of the
Topology ToolKit
(TTK) to distributed-memory parallelism with the
Message Passing Interface
(MPI). While several recent papers introduced topology-based approaches for distributed-memory environments, these were reporting experiments obtained with tailored, mono-algo...
In this work, we propose a visual analytics system to analyze deep reinforcement learning (deepRL) models working on the track reconstruction of charged particles in the field of particle physics. The data of these charged particles are in the form of point clouds with high-dimensional features. We use one of the existing post hoc saliency methods...
In this work, we provide an overview of the XAI (Explainable Artificial Intelligence) works related to explaining the methods working on point cloud (PC) data. The recent decade has seen a surge in artificial intelligence (AI) and machine learning (ML) algorithms finding applications in various fields dealing with a wide variety of data types such...
Objective. Gradient-based optimization using algorithmic derivatives can be a useful technique to improve engineering designs with respect to a computer-implemented objective function. Likewise, uncertainty quantification through computer simulations can be carried out by means of derivatives of the computer simulation. However, the effectiveness o...
Comparative visualization of scalar fields is often facilitated using similarity measures such as edit distances. In this paper, we describe a novel approach for similarity analysis of scalar fields that combines two recently introduced techniques: Wasserstein geodesics/barycenters as well as path mappings, a branch decomposition-independent edit d...
Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. This paper describes the ExTreeM-Algorithm: a scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTreeM is to first derive the extremum graph
$\mathc...
In modern reproducible, hypothesis‐driven plant research, scientists are increasingly relying on research data management (RDM) services and infrastructures to streamline the processes of collecting, processing, sharing, and archiving research data. FAIR (i.e., findable, accessible, interoperable, and reusable) research data play a pivotal role in...
Objective. Proton therapy is highly sensitive to range uncertainties due to the nature of the dose deposition of charged particles. To ensure treatment quality, range verification methods can be used to verify that the individual spots in a pencil beam scanning treatment fraction match the treatment plan. This study introduces a novel metric for pr...
Feature tracking is a common task in visualization applications, where methods based on topological data analysis (TDA) have successfully been applied in the past for feature definition as well as tracking. In this work, we focus on tracking extrema of temporal scalar fields. A family of TDA approaches address this task by establishing one-to-one c...
Comparative analysis of scalar fields in scientific visualization often involves distance functions on topological abstractions. This paper focuses on the merge tree abstraction (representing the nesting of sub- or superlevel sets) and proposes the application of the unconstrained deformation-based edit distance. Previous approaches on merge trees...
Comparative visualization of scalar fields is often facilitated using similarity measures such as edit distances. In this paper, we describe a novel approach for similarity analysis of scalar fields that combines two recently introduced techniques: Wasserstein geodesics/barycenters as well as path mappings, a branch decomposition-independent edit d...
The computational work to perform particle advection‐based flow visualization techniques varies based on many factors, including number of particles, duration, and mesh type. In many cases, the total work is significant, and total execution time (“performance”) is a critical issue. This state‐of‐the‐art report considers existing optimizations for p...
This paper presents a well-scaling parallel algorithm for the computation of Morse-Smale (MS) segmentations, including the region separators and region boundaries. The segmentation of the domain into ascending and descending manifolds, solely defined on the vertices, improves the computational time using path compression and fully segments the bord...
This paper presents a well-scaling parallel algorithm for the computation of Morse-Smale (MS) segmentations, including the region separators and region boundaries. The segmentation of the domain into ascending and descending manifolds, solely defined on the vertices, improves the computational time using path compression and fully segments the bord...
The Bergen proton Computed Tomography (pCT) is a prototype detector under construction. It aims to have the capability to track and measure ions’ energy deposition to minimize uncertainty in proton treatment planning. It is a high granularity digital tracking calorimeter, where the first two layers will act as tracking layers to obtain positional i...
We present PREVIS, a visual analytics tool, enhancing machine learning performance analysis in engineering applications. The presented toolchain allows for a direct comparison of regression models. In addition, we provide a methodology to visualize the impact of regression errors on the underlying field of interest in the original domain, the part...
Machine learning algorithms are widely applied to create powerful prediction models. With increasingly complex models, humans' ability to understand the decision function (that maps from a high‐dimensional input space) is quickly exceeded. To explain a model's decisions, black‐box methods have been proposed that provide either non‐linear maps of th...
In scientific visualization, scalar fields are often compared through edit distances between their merge trees. Typical tasks include ensemble analysis, feature tracking and symmetry or periodicity detection. Tree edit distances represent how one tree can be transformed into another through a sequence of simple edit operations: relabeling, insertio...
Edit distances between merge trees of scalar fields have many applications in scientific visualization, such as ensemble analysis, feature tracking or symmetry detection. In this paper, we propose branch mappings, a novel approach to the construction of edit mappings for merge trees. Classic edit mappings match nodes or edges of two trees onto each...
Edit distances between merge trees of scalar fields have many applications in scientific visualization, such as ensemble analysis, feature tracking or symmetry detection. In this paper, we propose branch mappings, a novel approach to the construction of edit mappings for merge trees. Classic edit mappings match nodes or edges of two trees onto each...
Algorithmic derivatives can be useful to quantify uncertainties and optimize parameters using computer simulations. Whether they actually are, depends on how "well-linearizable" the program is. Proton computed tomography (pCT) is a medical imaging technology with the potential to increase the spatial accuracy of the dose delivered in proton-beam ra...
We present PREVIS, a visual analytics tool, enhancing machine learning performance analysis in engineering applications. The presented toolchain allows for a direct comparison of regression models. In addition, we provide a methodology to visualize the impact of regression errors on the underlying field of interest in the original domain, the part...
The performance of particle advection-based flow visualization techniques is complex, since computational work can vary based on many factors, including number of particles, duration, and mesh type. Further, while many approaches have been introduced to optimize performance, the efficacy of a given approach can be similarly complex. In this work, w...
This chapter complements the Preface to this book. For more discussion on how to read this book, as well as information on the book itself, its purpose, and topics covered, we refer the reader to the Preface. Instead, this chapter provides background and an overview of foundational topics for in situ visualization for computational science. Section...
We present Knowledge Rocks, an implementation strategy and guideline for augmenting visualization systems to knowledge-assisted visualization systems, as defined by the KAVA model. Visualization systems become more and more sophisticated. Hence, it is increasingly important to support users with an integrated knowledge base in making constructive c...
We present a holistic, topology-based visualization technique for spatial time series data based on an adaptation of Fuzzy Contour Trees. Common analysis approaches for time dependent scalar fields identify and track specific features. To give a more general overview of the data, we extend Fuzzy Contour Trees, from the visualization and simultaneou...
We present Knowledge Rocks, an implementation strategy and guideline for augmenting visualization systems to knowledge-assisted visualization systems, as defined by the KAVA model. Visualization systems become more and more sophisticated. Hence, it is increasingly important to support users with an integrated knowledge base in making constructive c...
We provide an evaluation of the applicability of video compression techniques for compressing visualization image databases that are often used for in situ visualization. Considering relevant practical implementation aspects, we identify relevant compression parameters, and evaluate video compression for several test cases, involving several data s...
This paper describes a localized algorithm for the topological simplification of scalar data, an essential pre-processing step of topological data analysis (TDA). Given a scalar field f and a selection of extrema to preserve, the proposed localized topological simplification (LTS) derives a function g that is close to f and only exhibits the select...
This paper presents a framework that fully leverages the advantages of a deferred rendering approach for the interactive visualization of large-scale datasets. Geometry buffers (G-Buffers) are generated and stored in situ, and shading is performed post hoc in an interactive image-based rendering front end. This decoupled framework has two major adv...
This paper describes a localized algorithm for the topological simplification of scalar data, an essential pre-processing step of topological data analysis (TDA). Given a scalar field f and a selection of extrema to preserve, the proposed localized topological simplification (LTS) derives a function g that is close to f and only exhibits the select...
The term “in situ processing” has evolved over the last decade to mean both a specific strategy for visualizing and analyzing data and an umbrella term for a processing paradigm. The resulting confusion makes it difficult for visualization and analysis scientists to communicate with each other and with their stakeholders. To address this problem, a...
Mathematical concepts and tools have shaped the field of visualization in fundamental ways and played a key role in the development of a large variety of visualization techniques. In this chapter, we sample the visualization literature to provide a taxonomy of the usage of mathematics in visualization and to identify a fundamental set of mathematic...
We describe a novel technique for the simultaneous visualization of multiple scalar fields, e.g. representing the members of an ensemble, based on their contour trees. Using tree alignments, a graph‐theoretic concept similar to edit distance mappings, we identify commonalities across multiple contour trees and leverage these to obtain a layout that...
We present a state‐of‐the‐art report on time‐dependent flow topology. We survey representative papers in visualization and provide a taxonomy of existing approaches that generalize flow topology from time‐independent to time‐dependent settings. The approaches are classified based upon four categories: tracking of steady topology, reference frame ad...
Streamlines are an extensively utilized flow visualization technique for understanding, verifying, and exploring computational fluid dynamics simulations. One of the major challenges associated with the technique is selecting which streamlines to display. Using a large number of streamlines results in dense, cluttered visualizations, often containi...
We introduce and evaluate a new algorithm for the in situ extraction of Lagrangian flow maps, which we call Boundary Termination Optimization (BTO). Our approach is a communication-free model, requiring no message passing or synchronization between processes, improving scalability, thereby reducing overall execution time and alleviating the encumbr...
We introduce an innovative ensemble analysis framework for organizing, searching, and comparing results produced by hundreds of physical simulations. Our web-based approach is built on standard technologies, utilizes a scalable and modular design, and is suitable for displaying the results of in situ analysis and extreme-scale simulations.
Operation technology networks, i.e. hard- and software used for monitoring and controlling physical/industrial processes, have been considered immune to cyber attacks for a long time. A recent increase of attacks in these networks proves this assumption wrong. Several technical constraints lead to approaches to detect attacks on industrial processe...
Operation technology networks, i.e. hard- and software used for monitoring and controlling physical/industrial processes, have been considered immune to cyber attacks for a long time. A recent increase of attacks in these networks proves this assumption wrong. Several technical constraints lead to approaches to detect attacks on industrial processe...
In situ visualization is an increasingly important approach for computational science, as it can address limitations on leading edge high-performance computers and also can provide an increased spatio-temporal resolution. However, there are many open research issues with effective in situ processing. This article describes the challenges identified...
This work describes an approach for the interactive visual analysis of large-scale simulations, where numerous superlevel set components and their evolution are of primary interest. The approach first derives, at simulation runtime, a specialized Cinema database that consists of images of component groups, and topological abstractions. This databas...
The investigation of transient reactive bubbly flow simulation data offers a variety of data mining challenges due to the interaction of mass transfer, hydrodynamic and local concentration. Modern visualization techniques for Euler–Euler based multiphase simulations are used to study the hydrodynamic influence on the reactive mass transfer in a cyl...
Data reduction is increasingly being applied to scientific data for numerical simulations, scientific visualizations and data analyses. It is most often used to lower I/O and storage costs, and sometimes to lower in‐memory data size as well. With this paper, we consider five categories of data reduction techniques based on their information loss: (...
With Eulerian Method of Moment (MoM) solvers for the CFD simulation of multi-phase fluid flow, the positions of bubbles or droplets are not modeled explicitly, but through scalar fields of moments. These fields can be interpreted as probability density functions describing the distribution of bubble locations. To enable intuitive visualization that...
For the scientific visualization and analysis of univariate (scalar) fields several topological approaches like contour trees and Reeb graphs were studied and compared to each other some time ago. In recent years, some of those approaches were generalized to multivariate fields. Among others, data structures like the joint contour net (JCN) and the...
Tracking graphs are a well established tool in topological analysis to visualize the evolution of components and their properties over time, i.e., when components appear, disappear, merge, and split. However, tracking graphs are limited to a single level threshold and the graphs may vary substantially even under small changes to the threshold. To e...
Eulerian Method of Moment (MoM) solvers are gaining popularity for multi‐phase CFD simulation involving bubbles or droplets in process engineering. Because the actual positions of bubbles are uncertain, the spatial distribution of bubbles is described by scalar fields of moments, which can be interpreted as probability density functions. Visualizin...
de Durch die Implementierung verschiedener Populationsbilanzmodelle wird das Euler‐Euler Mehrphasenmodell multiphaseEulerFoam erweitert, um die Veränderung einer dispersen Phase bezogen auf die Partikelgröße zu erfassen. Die verwendeten Modelle werden untereinander sowie mit experimentellen Daten verglichen. Zur Visualisierung wird ein neuer Ansatz...
This paper presents the state of the art in the area of topology-based visualization. It describes the process and results of an extensive annotation for generating a definition and terminology for the field. The terminology enabled a typology for topological models which is used to organize research results and the state of the art. Our report dis...
Analysis of spatio-temporal event data is of central importance in many domains of science and policy making. Current visualization methods rely on animation, small multiples, and space-time cubes to enable spatio-temporal data exploration. These methods require the user to remember state spaces or deal with layout occlusions when exploring their d...
Topological analysis of multifields is an approaches to find meaningful, intrinsic structures in complex data. Methods introduced in previous years were usually evaluated separately or rather informally. However, to aid the decision which method is best suited for a particular kind of data, it is important to compare and put them into context with...
Poincaré maps supply vital descriptions of dynamical behavior in spacecraft trajectory analysis, but the puncture plot, the standard display method for maps, typically requires significant external effort to extract topology. This investigation presents adaptations of topology-based methods to compute map structures in multi-body dynamical environm...
In car manufacturing, quality management and control are important parts of the series process. In series production, many parts are controlled in various ways in some or all stages of assembly. While tactile measurements are mostly restricted to the points on an inspection plan, this restriction does not apply to optical measurements. We propose a...
The increasing amount of data generated by Location Based Social Networks (LBSN) such as Twitter, Flickr, or Foursquare, is currently drawing the attention of urban planners, as it is a new source of data that contains valuable information about the behavior of the inhabitants of a city. Making this data accessible to the urban planning domain can...
Where the computation of particle trajectories in classic vector field representations includes computationally involved numerical integration, a Lagrangian representation in the form of a flow map opens up new alternative ways of trajectory extraction through interpolation. In our paper, we present a novel re-organization of the Lagrangian represe...
Fluid mechanics considers two frames of reference for an observer watching a flow field: Eulerian and Lagrangian. The former is the frame of reference traditionally used for flow analysis, and involves extracting particle trajectories based on a vector field. With this work, we explore the opportunities that arise when considering these trajectorie...
High-fidelity simulation models on large-scale parallel computer systems can produce data at high computational throughput, but modern architectural trade-offs make full persistent storage to the slow I/O subsystem prohibitively costly with respect to time. We demonstrate the feasibility and potential of combining in situ topological contour tree a...
Topological and structural analysis of multivariate data is aimed at improving the understanding and usage of such data through identification of intrinsic features and structural relationships among multiple variables. We present two novel methods for simplifying so-called Pareto sets that describe such structural relationships. Such simplificatio...
Flow visualization is a classic sub-field of scientific visualization. The task of flow visualization algorithms is to depict vector data, i.e., data with magnitude and direction. An important category of flow visualization techniques makes use of textures in order to con-vey the properties of a vector field. Recently, several research ad-vances ha...
In this chapter, we provide a brief overview of the visualization of large vector fields on parallel architectures using integration-based methods. After briefly providing background, we describe the state of the art in corresponding research, focusing on parallel integral curve computation strategies. We analyze the relative benefits of two fundam...
Uncertain field visualization is currently a hot topic as can be seen by the overview in this book. This article discusses a mathematical foundation for this research. To this purpose, we define uncertain fields as stochastic processes. Since uncertain field data is usually given in the form of value distributions on a finite set of positions in th...
Mitochondrial ribosomes of baker’s yeast contain at least 78 protein subunits. All but one of these proteins are nuclear-encoded, synthesized on cytosolic ribosomes, and imported into the matrix for biogenesis. The import of matrix proteins typically relies on N-terminal mitochondrial targeting sequences that form positively charged amphipathic hel...
In this paper we present an interactive system that integrates the visual analysis of nerve fiber pathway approximations from diffusion tensor imaging (DTI) with electroencephalography (EEG) data. The technique uses source reconstructions from EEG data to define certain regions of interest in the brain. These regions, in turn, are used to selective...
Sets of simulation runs based on parameter and model variation, so-called ensembles, are increasingly used to model physical behaviors whose parameter space is too large or complex to be explored automatically. Visualization plays a key role in conveying important properties in ensembles, such as the degree to which members of the ensemble agree or...
Multifluid simulations often create volume fraction data, representing fluid volumes per region or cell of a fluid data set. Accurate and visually realistic extraction of fluid boundaries is a challenging and essential task for efficient analysis of multifluid data. In this work, we present a new material interface reconstruction method for such vo...
Particle advection is an important vector field visualization technique that is difficult to apply to very large data sets in a distributed setting due to scalability limitations in existing algorithms. In this paper, we report on several experiments using work requesting dynamic scheduling which achieves balanced work distribution on arbitrary pro...
Characterizing the interplay between the vortices and forces acting on a wind turbine's blades in a qualitative and quantitative way holds the potential for significantly improving large wind turbine design. This paper introduces an integrated pipeline for highly effective wind and force field analysis and visualization. We extract vortices induced...
How can the notion of topological structures for single scalar fields be extended to multifields? In this paper we propose a definition for such structures using the concepts of Pareto optimality and Pareto dominance. Given a set of piecewise-linear, scalar functions over a common simplical complex of any dimension, our method finds regions of “con...
Analysis of chemical constituents from mass spectrometry of aerosols involves non-negative matrix factorization, an approximation of high-dimensional data in lower-dimensional space. The associated optimization problem is non-convex, resulting in crude approximation errors that are not accessible to scientists. To address this shortcoming, we intro...