Program

Abstract: The exploration of large-scale conflicts, as well as their causes and effects, is an important aspect of socio-political analysis. Since event data related to major conflicts are usually obtained from different sources, researchers developed a semi-automatic matching algorithm to integrate event data of different origins into one comprehensive dataset using hierarchical taxonomies. The validity of the corresponding integration results is not easy to assess since the results depend on user-defined input parameters and the relationships between the original data sources. However, only rudimentary visualization techniques have been used so far to analyze the results, allowing no trustworthy validation or exploration of how the final dataset is composed. To overcome this problem, we developed VEHICLE, a web-based tool to validate and explore the results of the hierarchical integration. For the design, we collaborated with a domain expert to identify the underlying domain problems and derive a task and workflow description. The tool combines both traditional and novel visual analysis techniques, employing statistical and map-based depictions as well as advanced interaction techniques. We showed the usefulness of VEHICLE in two case studies and by conducting an evaluation together with conflict researchers, confirming domain hypotheses and generating new insights.

Presenter: Benedikt Mayer

Abstract: Based on a collaborative visualization design process involving sensitive historical data and historiographical expertise, we investigate the relevance of ethical principles in visualization design. While fundamental ethical norms like truthfulness and accuracy are already well-described and common goals in visualization design, datasets that are accompanied by specific ethical concerns need to be processed and visualized with an additional level of carefulness and thought. There has been little research on adequate visualization design incorporating such considerations. To address this gap we present insights from Topography of Violence, a visualization project with the Jewish Museum Berlin that focuses on a dataset of more than 4,500 acts of violence against Jews in Germany between 1930 and 1938. Drawing from the joint project, we develop an approach to the visualization of sensitive data, which features both conceptual and procedural considerations for visualization design. Our findings provide value for both visualization researchers and practitioners by highlighting challenges and opportunities for ethical data visualization.

Presenter: Fabian Ehmel

Abstract: Communication consists of both meta-information as well as content. Currently, the automated analysis of such data often focuses either on the network aspects via social network analysis or on the content, utilizing methods from text-mining. However, the first category of approaches does not leverage the rich content information, while the latter ignores the conversation environment and the temporal evolution, as evident in the meta-information. In contradiction to communication research, which stresses the importance of a holistic approach, both aspects are rarely applied simultaneously, and consequently, their combination has not yet received enough attention in automated analysis systems. In this work, we aim to address this challenge by discussing the difficulties and design decisions of such a path as well as contribute CommAID, a blueprint for a holistic strategy to communication analysis. It features an integrated visual analytics design to analyze communication networks through dynamics modeling, semantic pattern retrieval, and a user-adaptable and problem-specific machine learning-based retrieval system. An interactive multi-level matrix-based visualization facilitates a focused analysis of both network and content using inline visuals supporting cross-checks and reducing context switches. We evaluate our approach in both a case study and through formative evaluation with eight law enforcement experts using a real-world communication corpus. Results show that our solution surpasses existing techniques in terms of integration level and applicability. With this contribution, we aim to pave the path for a more holistic approach to communication analysis.

Presenter: Max Fischer

Abstract: The global routing network is the backbone of the Internet. However, it is quite vulnerable to attacks that cause major disruptionsor routing manipulations. Prior related works have visualized routing path changes with node link diagrams, but it requiresstrong domain expertise to understand if a routing change between autonomous systems is suspicious. Geographic visualizationhas an advantage over conventional node-link diagrams by helping uncover such suspicious routes as the user can immediatelysee if a path is the shortest path to the target or an unreasonable detour. In this paper, we present ProBGP, a web-basedprogressive approach to visually analyze BGP update routes. We created a novel progressive data processing algorithm forthe geographic approximation of autonomous systems and combined it with a progressively updating visualization. While thenewest log data is continuously loaded, our approach also allows querying the entire log recordings since 1999. We presentthe usefulness of our approach with a real use case of a major route leak from June 2019. We report on multiple interviewswith domain experts throughout the development. Finally, we evaluated our algorithm quantitatively against a public peeringdatabase and qualitatively against AS network maps.

Presenter: Alex Ulmer

Abstract: Color encoding is foundational to visualizing quantitative data. Guidelines for colormap design have traditionally emphasized perceptual principles, such as order and uniformity. However, colors also evoke cognitive and linguistic associations whose role in data interpretation remains underexplored. We study how two linguistic factors, name salience and name variation, affect people’s ability to draw inferences from spatial visualizations. In two experiments, we found that participants are better at interpreting visualizations when viewing colors with more salient names (e.g., prototypical ‘blue’, ‘yellow’, and ‘red’ over ‘teal’, ‘beige’, and ‘maroon’). The effect was robust across four visualization types, but was more pronounced in continuous (e.g., smooth geographical maps) than in similar discrete representations (e.g., choropleths). Participants’ accuracy also improved as the number of nameable colors increased, although the latter had a less robust effect. Our findings suggest that color nameability is an important design consideration for quantitative colormaps, and may even outweigh traditional perceptual metrics. In particular, we found that the linguistic associations of color are a better predictor of performance than the perceptual properties of those colors. We discuss the implications and outline research opportunities. The data and materials for this study are available at https://osf.io/asb7n

Presenter: Khairi Reda

Abstract: Unfamiliar or esoteric visual forms arise in many areas of visualization. While such forms can be intriguing, it can be unclear how to make effective use of them without long periods of practice or costly user studies. In this work we analyze the table cartogram—a graphic which visualizes tabular data by bringing the areas of a grid of quadrilaterals into correspondence with the input data, like a heat map that has been ”area-ed” rather than colored. Despite having existed for several years, little is known about its appropriate usage. We mend this gap by using Algebraic Visualization Design to show that they are best suited to relatively small tables with ordinal axes for some comparison and outlier identification tasks. In doing so we demonstrate a discount theory-based analysis that can be used to cheaply determine best practices for unknown visualizations.

Presenter: Andrew McNutt

Abstract: Multi-dimensional data exploration is a classic research topic in visualization. Most existing approaches are designed for identifying record patterns in dimensional space or subspace. In this paper, we propose a visual analytics approach to exploring subset patterns. The core of the approach is a subset embedding network (SEN) that represents a group of subsets as uniformly-formatted embeddings. We implement the SEN as multiple subnets with separate loss functions. The design enables to handle arbitrary subsets and capture the similarity of subsets on single features, thus achieving accurate pattern exploration, which in most cases is searching for subsets having similar values on few features. Moreover, each subnet is a fully-connected neural network with one hidden layer. The simple structure brings high training efficiency. We integrate the SEN into a visualization system that achieves a 3-step workflow. Specifically, analysts (1) partition the given dataset into subsets, (2) select portions in a projected latent space created using the SEN, and (3) determine the existence of patterns within selected subsets. Generally, the system combines visualizations, interactions, automatic methods, and quantitative measures to balance the exploration flexibility and operation efficiency, and improve the interpretability and faithfulness of the identified patterns. Case studies and quantitative experiments on multiple open datasets demonstrate the general applicability and effectiveness of our approach.

Presenter: Peng Xie

Abstract: Projections attempt to convey the relationships and similarity of data points from a high dimensional dataset into a lower dimensional representation.Most projections techniques are designed for static data. When used for time-dependent data, they usually fail to create a stable and suitable low dimensional representation.We propose two new dynamic projection methods (PCD-tSNE and LD-tSNE) based on the idea of using global guides to steer projection points. This avoids unstable movement that hinders the ability to reason about high dimensional dynamics while keeping t-SNE’sneighborhood preservation ability. PCD-tSNE scores a good balance between stability, neighborhood presentation, and distance preservation, while LD-tSNE allows us to create stable and customizable projections.We demonstrate our methods by comparing them to 11 other techniques using quality metrics and datasets provided by a recent benchmark for dynamic projections.

Presenter: Eduardo Vernier

Abstract: Texture is a key characteristic in the definition of the physical appearance of an object and a crucial element in the creation process of 3D artists. However, retrieving a texture that matches an intended look from an image collection is difficult. Contrary to most photo collections, for which object recognition has proven quite useful, syntactic descriptions of texture characteristics is not straightforward, and even creating appropriate metadata is a very difficult task. In this paper, we propose a system to help explore large unlabeled collections of texture images. The key insight is that spatially grouping textures sharing similar features can simplify navigation. Our system uses a pre-trained convolutional neural network to extract high-level semantic image features, which are then mapped to a 2-dimensional location using an adaptation of t-SNE, a dimensionality-reduction technique. We describe an interface to visualize and explore the resulting distribution and provide a series of enhanced navigation tools, our prioritized t-SNE, scalable clustering, and multi-resolution embedding, to further facilitate exploration and retrieval tasks. Finally, we also present the results of a user evaluation that demonstrates the effectiveness of our solution.

Presenter: Xuejiao Luo

Abstract: We present an approach to local extraction of 3D time-dependent vector field topology. In this concept, Lagrangian coherent structures, which represent the separating manifolds in time-dependent transport, correspond to generalized streak manifolds seeded along hyperbolic path surfaces (HPSs). Instead of expensive and numerically challenging direct computation of the HPSs by intersection of ridges in the forward and backward finite-time Lyapunov exponent (FTLE) fields, our approach employs local extraction of respective candidates in the four-dimensional space-time domain. These candidates are subsequently refined toward the hyperbolic path surfaces, which provides unsteady equivalents of saddle-type critical points, periodic orbits, and bifurcation lines from steady, traditional vector field topology. In contrast to FTLE-based methods, we obtain an explicit geometric representation of the topological skeleton of the flow, which for steady flows coincides with the hyperbolic invariant manifolds of vector field topology. We evaluate our approach on analytical flows, as well as data from computational fluid dynamics, using the FTLE as a ground truth superset, i.e., we also show that FTLE ridges exhibit several types of false positives.

Presenter: Lutz Hofmann

Abstract: Summed Volume Tables (SVTs) allow one to compute integrals over the data values in any cubical area of a three-dimensional orthogonal grid in constant time, and they are especially interesting for building spatial search structures for sparse volumes. However, SVTs become extremely memory consuming due to the large values they need to store; for a dataset of n values an SVT requires O(n log n) bits. The 3D Fenwick tree allows recovering the integral values in O(log^3 n) time, at a memory consumption of O(n) bits. We propose an algorithm that generates SVT representations that can flexibly trade speed for memory: From similar characteristics as SVTs, over equal memory consumption as 3D Fenwick trees at significantly lower computational complexity, to even further reduced memory consumption at the cost of raising computational complexity. For a 641 X 9601 X 9601 binary dataset the algorithm can generate an SVT representation that requires 27.0GB and 46*8 data fetch operations to retrieve an integral value, compared to 27.5GB and 1521*8 fetches by 3D Fenwick trees, a decrease in fetches of 97%. A full SVT requires 247.6GB and 8 fetches per integral value. We present a novel hierarchical approach to compute and store intermediate prefix sums of SVTs, so that any prescribed memory consumption between O(n) bits and O(n log n) bits is achieved. We evaluate the performance of the proposed algorithm in a number of examples considering large volume data, and we perform comparisons to existing alternatives.

Presenter: Christian Reinbold

Abstract: We present an approach for compressing volumetric scalar fields using implicit neural representations. Our approach represents a scalar field as a learned function, wherein a neural network maps a point in the domain to an output scalar value. By setting the number of weights of the neural network to be smaller than the input size, we achieve compressed representations of scalar fields, thus framing compression as a type of function approximation. Combined with carefully quantizing network weights, we show that this approach yields highly compact representations that outperform state-of-the-art volume compression approaches. The conceptual simplicity of our approach enables a number of benefits, such as support for time-varying scalar fields, optimizing to preserve spatial gradients, and random-access field evaluation. We study the impact of network design choices on compression performance, highlighting how simple network architectures are effective for a broad range of volumes.

Presenter: Yuzhe Lu

Abstract: Thin, curved structures occur in many volumetric datasets. Their analysis using classical volume rendering is difficult because parts of such structures can bend away or hide behind occluding elements. This problem cannot be fully compensated by effective navigation alone, because structure-adapted navigation in the volume is cumbersome and only parts of the structure are visible in each view.We solve this problem by rendering a spatially transformed view into the volume so that an unobscured visualization of the entire curved structure is obtained. As a result, simple and intuitive navigation becomes possible. The domain of the spatial transform is defined by a triangle mesh that is topologically equivalent to an open disc and that approximates the structure of interest. The rendering is based on ray-casting in which the rays traverse the original curved sub-volume. In order to carve out volumes of varying thickness, the lengths of the rays as well as the position of the mesh vertices can be easily modified in a view-controlled manner by interactive painting. We describe a prototypical implementation and demonstrate the interactive visual inspection of complex structures from digital humanities, biology, medicine, and materials science. Displaying the structure as a whole enables simple inspection of interesting substructures in their original spatial context.Overall, we show that transformed views utilizing ray-casting-based volume rendering supported by guiding surface meshes and supplemented by local, interactive modifications of ray lengths and vertex positions, represent a simple but versatile approach to effectively visualize thin, curved structures in volumetric data.

Presenter: Felix Herter

Abstract: Popular sports tracking applications allow athletes to share and compare their personal performance data with others. Visualizing this data in relevant public settings can be beneficial in provoking novel types of opportunistic and communal sense-making. We investigated this premise by situating an analytical visualization of running performances on two touch-enabled public displays in proximity to a local community running trail. Using a rich mixed-method evaluation protocol during a three-week-long in-the-wild deployment, we captured its social and analytical impact across 235 distinct interaction sessions. Our results show how our public analytical visualization supported passers-by to create novel insights that were rather of casual nature. Several textual features that surrounded the visualization, such as titles that were framed as provocative hypotheses and predefined attention-grabbing data queries, sparked interest and social debate, while a narrative tutorial facilitated more analytical interaction patterns. Our detailed mixed-methods evaluation approach led to a set of actionable takeaways for public visualizations that allow novice audiences to engage with data analytical insights that have local relevance.

Presenter: Jorgos Coenen

Abstract: Guidance is an emerging topic in the field of visual analytics. Guidance can support users in pursuing their analytical goals more efficiently and help in making the analysis successful. However, it is not clear how guidance approaches should be designed and what specific factors should be considered for effective support. In this paper, we approach this problem from the perspective of guidance designers. We present a framework comprising requirements and a set of specific phases designers should go through when designing guidance for visual analytics. We relate this process with a set of quality criteria we aim to support with our framework, that are necessary for obtaining a suitable and effective guidance solution. To demonstrate the practical usability of our methodology, we apply our framework to the design of guidance in three analysis scenarios and a design walk-through session. Moreover, we list the emerging challenges and report how the framework can be used to design guidance solutions that mitigate these issues.

Presenter: Davide Ceneda

Abstract: Visualizations are now widely used across disciplines to understand and communicate data. The benefit of visualizations lies in leveraging our natural visual perception. However, the sole dependency on vision can produce unintended discrimination against people with visual impairments. While the visualization field has seen enormous growth in recent years, supporting people with disabilities is much less explored. In this work, we examine approaches to support this marginalized user group, focusing on visual disabilities. We collected and analyzed papers published for the last 20 years on visualization accessibility. We mapped a design space for accessible visualization that includes seven dimensions: user group, literacy task, chart type, interaction, information granularity, sensory modality, assistive technology. We describe the current knowledge gap in light of the latest advances in visualization and present a preliminary accessibility model by synthesizing findings from existing research. Finally, we reflected on the dimensions and discussed opportunities and challenges for future research.

Presenter: Shakila Cherise Joyner

Abstract: The model-based investing using financial factors is evolving as a principal method for quantitative investment. The main challenge lies in the selection of effective factors towards excess market returns. Existing approaches, either hand-picking factors or applying feature selection algorithms, do not orchestrate both human knowledge and computational power. This paper presents iQUANT, an interactive quantitative investment system that assists equity traders to quickly spot promising financial factors from initial recommendations suggested by algorithmic models, and conduct a joint refinement of factors and stocks for investment portfolio composition. We work closely with professional traders to assemble empirical characteristics of ”good” factors and propose effective visualization designs to illustrate the collective performance of financial factors, stock portfolios, and their interactions. We evaluate iQUANT through a formal user study, two case studies, and expert interviews, using a real stock market dataset consisting of 3000 stocks times 6000 days times 56 factors.

Presenter: Yong Wang

Abstract: During the training phase of machine learning (ML) models, it is usually necessary to configure several hyperparameters. This process is computationally intensive and requires an extensive search to infer the best hyperparameter set for the given problem. The challenge is exacerbated by the fact that most ML models are complex internally, and training involves trial-and-error processes that could remarkably affect the predictive result. Moreover, each hyperparameter of an ML algorithm is potentially intertwined with the others, and changing it might result in unforeseeable impacts on the remaining hyperparameters. Evolutionary optimization is a promising method to try and address those issues. According to this method, performant models are stored, while the remainder are improved through crossover and mutation processes inspired by genetic algorithms. We present VisEvol, a visual analytics tool that supports interactive exploration of hyperparameters and intervention in this evolutionary procedure. In summary, our proposed tool helps the user to generate new models through evolution and eventually explore powerful hyperparameter combinations in diverse regions of the extensive hyperparameter space. The outcome is a voting ensemble (with equal rights) that boosts the final predictive performance. The utility and applicability of VisEvol are demonstrated with two use cases and interviews with ML experts who evaluated the effectiveness of the tool.

Presenter: Angelos Chatzimparmpas

Abstract: Mixed-initiative visual analytics systems support collaborative human-machine decision-making processes. However, many multi-objective optimization tasks, such as topic model refinement, are highly subjective and context-dependent. Hence, systems need to adapt their optimization suggestions throughout the interactive refinement process to provide efficient guidance. To tackle this challenge, we present a technique for learning context-dependent user preferences and demonstrate its applicability to topic model refinement. We deploy agents with distinct associated optimization strategies that compete for the user’s acceptance of their suggestions. To decide when to provide guidance, each agent maintains an intelligible, rule-based classifier over context vectorizations that captures the development of quality metrics between distinct analysis states. By observing implicit and explicit user feedback, agents learn in which contexts to provide their specific guidance operation. An agent in topic model refinement might, for example, learn to react to declining model coherence by suggesting to split a topic. Our results confirm that the rules learned by agents capture contextual user preferences. Further, we show that the learned rules are transferable between similar datasets, avoiding common cold-start problems and enabling a continuous refinement of agents across corpora.

Presenter: Fabian Sperrle

Abstract: Layer-wise Relevance Propagation (LRP) is an emerging and widely-used method for interpreting the prediction results of convolutional neural networks (CNN). LRP developers often select and employ different relevance backpropagation rules and parameters, to compute relevance scores on input images. However, there exists no obvious solution to define a “best” LRP model. A satisfied model is highly reliant on pertinent images and designers’ goals. We develop a visual model designer, named as VisLRPDesigner, to overcome the challenges in the design and use of LRP models. Various LRP rules are unified into an integrated framework with an intuitive workflow of parameter setup. VisLRPDesigner thus allows users to interactively configure and compare LRP models. It also facilitates relevance-based visual analysis with two important functions: relevance-based pixel flipping and neuron ablation. Several use cases illustrate the benefits of VisLRPDesigner. The usability and limitation of the visual designer is evaluated by LRP users.

Presenter: Xinyi Huang

Abstract: Graphics Processing Units (GPUs) have been widely used to accelerate artificial intelligence, physics simulation, medical imaging, and information visualization applications. To improve GPU performance, GPU hardware designers need to identify performance issues by inspecting a huge amount of simulator-generated traces. Visualizing the execution traces can reduce the cognitive burden of users and facilitate making sense of behaviors of GPU hardware components. In this paper, we first formalize the process of GPU performance analysis and characterize the design requirements of visualizing execution traces based on a survey study and interviews with GPU hardware designers. We contribute data and task abstraction for GPU performance analysis. Based on our task analysis, we propose Daisen, a framework that supports data collection from GPU simulators and provides visualization of the simulator-generated GPU execution traces. Daisen features a data abstraction and trace format that can record simulator-generated GPU execution traces. Daisen also includes a web-based visualization tool that helps GPU hardware designers examine GPU execution traces, identify performance bottlenecks, and verify performance improvement. Our qualitative evaluation with GPU hardware designers demonstrates that the design of Daisen reflects the typical workflow of GPU hardware designers. Using Daisen, participants were able to effectively identify potential performance bottlenecks and opportunities for performance improvement. The open-sourced implementation of Daisen can be found at gitlab.com/akita/vis. Supplemental materials including a demo video, survey questions, evaluation study guide, and post-study evaluation survey are available at osf.io/j5ghq.

Presenter: Yifan Sun

Abstract: Single particle tracking (SPT) of fluorescent molecules provides significant insights into the diffusion and relative motion of tagged proteins and other structures of interest in biology. However, despite the latest advances in high-resolution microscopy, individual particles are typically not distinguished from clusters of particles. This lack of resolution obscures potential evidence for how merging and splitting of particles affect their diffusion and any implications on the biological environment. The particle tracks are typically decomposed into individual segments at observed merge and split events, and analysis is performed without knowing the true count of particles in the resulting segments. Here, we address the challenges in analyzing particle tracks in the context of cancer biology. In particular, we study the tracks of KRAS protein, which is implicated in nearly 20% of all human cancers, and whose clustering and aggregation have been linked to the signaling pathway leading to uncontrolled cell growth. We present a new analysis approach for particle tracks by representing them as tracking graphs and using topological events– merging and splitting, to disambiguate the tracks. Using this analysis, we infer a lower bound on the count of particles as they cluster and create conditional distributions of diffusion speeds before and after merge and split events. Using thousands of time-steps of simulated and in-vitro SPT data, we demonstrate the efficacy of our method, as it offers the biologists a new, detailed look into the relationship between KRAS clustering and diffusion speeds.

Presenter: Torin McDonald

Abstract: Incident report triage is a common endeavor in many industry sectors, often coupled with serious public safety implications. Forexample, at the US Food and Drug Administration (FDA), analysts triage an influx of incident reports to identify previouslyundiscovered drug safety problems. However, these analysts currently conduct this critical yet error-prone incident report triageusing a generic table-based interface, with no formal support. Visualization design, task-characterization methodologies, andevaluation models offer several possibilities for better supporting triage workflows, including those dealing with drug safetyand beyond. In this work, we aim to elevate the work of triage through a task-abstraction activity with FDA analysts. Second,we design an alternative gist-based summary of text documents used in triage (SumRe). Third, we conduct a crowdsourcedevaluation of SumRe with medical experts. Results of the crowdsourced study with medical experts (n = 20) suggest that SumRebetter supports accuracy in understanding the gist of a given report, and in identifying important reports for followup activities.We discuss implications of these results, including design considerations for triage workflows beyond the drug domain, as well asmethodologies for comparing visualization-enabled text summaries.

Presenter: Tabassum Kakar

Abstract: Sobol’s method is one of the most powerful and widely used frameworks for global sensitivity analysis, and it maps every possible combination of input variables to an associated Sobol index. However, these indices are often challenging to analyze in depth, due in part to the lack of suitable, flexible enough, and fast-to-query data access structures as well as visualization techniques. We propose a visualization tool that leverages tensor decomposition, a compressed data format that can quickly and approximately answer sophisticated queries over exponential-sized sets of Sobol indices. This way, we are able to capture the complete global sensitivity information of high-dimensional scalar models. Our application is based on a three-stage visualization, to which variables to be analyzed can be added or removed interactively. It includes a novel hourglass-like diagram presenting the relative importance for any single variable or combination of input variables with respect to any composition of the rest of the input variables. We showcase our visualization with a range of example models, whereby we demonstrate the high expressive power and analytical capability made possible with the proposed method.

Presenter: Haiyan Yang

Abstract: The study of electronic transitions within a molecule connected to the absorption or emission of light is a common task in the process of the design of new materials. The transitions are complex quantum mechanical processes and a detailed analysis requires a breakdown of these processes into components that can be interpreted via characteristic chemical properties. We approach these tasks by providing a detailed analysis of the electron density field. This entails methods to quantify and visualize electron localization and transfer from molecular subgroups combining spatial and abstract representations. The core of our method uses geometric segmentation of the electronic density field coupled with a graph-theoretic formulation of charge transfer between molecular subgroups. The design of the methods has been guided by the goal of providing a generic and objective analysis following fundamental concepts. We illustrate the proposed approach using several case studies involving the study of electronic transitions in different molecular systems.

Presenter: Talha Bin Masood

Abstract: Analyzing the evolution of thunderstorms is critical in determining the potential for the development of severe weather events. Existing visualization systems for short-term weather forecasting (nowcasting) allow for basic analysis and prediction of storm developments. However, they lack advanced visual features for efficient decision-making. We developed a visual analytics tool for the detection of hazardous thunderstorms and their characterization, using a visual design centered on a reformulated expert task workflow that includes visual features to overview storms and quickly identify high-impact weather events, a novel storm graph visualization to inspect and analyze the storm structure, as well as a set of interactive views for efficient identification of similar storm cells (known as analogs) in historical data and their use for nowcasting. Our tool was designed with and evaluated by meteorologists and expert forecasters working in short-term operational weather forecasting of severe weather events.Results show that our solution suits the forecasters’ workflow. Our visual design is expressive, easy to use, and effective for prompt analysis and quick decision-making in the context of short-range operational weather forecasting.

Presenter: Alexandra Diehl

Abstract: The model of a double gyre flow by Shadden et al. is a standard benchmark data set for the computation of hyperbolic Lagrangian Coherent Structures (LCS) in flow data. While structurally extremely simple, it generates hyperbolic LCS of arbitrary complexity. Unfortunately, the double gyre does not come with a well-defined ground truth: the location of hyperbolic LCS boundaries can only be approximated by numerical methods that usually involve the gradient of the flowmap. We present a new benchmark data set that is a small but carefully designed modification of the double gyre, which comes with ground truth closed-form hyperbolic trajectories. This allows for computing hyperbolic LCS boundaries by a simple particle integration without the consideration of the flow map gradient. We use these hyperbolic LCS as a ground truth solution for testing an existing numerical approach for extracting hyperbolic trajectories. In addition, we are able to construct hyperbolic LCS curves that are significantly longer than in existing numerical methods.

Presenter: Steve Wolligandt

Abstract: Data-driven stories comprise of visualizations and a textual narrative. The two representations coexist and complement each other. Although existing research has explored the design strategies and structure of such stories, it remains an open research question how the two representations play together on a detailed level and how they are linked with each other. In this paper, we aim at understanding the fine-grained interplay of text and visualizations in geographic data-driven stories. We focus on geographic content as it often includes complex spatiotemporal data presented as versatile visualizations and rich textual descriptions. We conduct a qualitative empirical study on 22 stories collected from a variety of news media outlets; 10 of the stories report the COVID-19 pandemic, the others cover diverse topics. We investigate the role of every sentence and visualization within the narrative to reveal how they reference each other and interact. Moreover, we explore the positioning and sequence of various parts of the narrative to find patterns that further consolidate the stories. Drawing from the findings, we discuss study implications with respect to best practices and possibilities to automate the report generation.

Presenter: Shahid Latif

Abstract: Visualization is an essential tool for observing and analyzing origin-destination (OD) data, which encodes flows between geographic locations, e.g., in applications concerning commuting, migration, and transport of goods. However, depicting OD data often encounter issues of cluttering and occlusion. To address these issues, many visual designs feature data abstraction and visual abstraction, such as node aggregation and edge bundling, resulting in information loss. The recent theoretical and empirical developments in visualization have substantiated the merits of such abstraction, while confirming that viewers’ knowledge can alleviate the negative impact due to information loss. It is thus desirable to map out different ways of losing and adding information in origin-destination data visualization (ODDV). We therefore formulate a new design space of ODDV based on the categorization of informative operations on OD data in data abstraction and visual abstraction. We apply this design space to existing ODDV methods, outline strategies for exploring the design space, and suggest ideas for further exploration.

Presenter: Martijn Tennekes

Abstract: It is crucial to visually extrapolate the characteristics of their evolution to understand critical spatio-temporal events such as earthquakes, fires, or the spreading of a disease. Animations embedded in the spatial context can be helpful for understanding details, but have proven to be less effective for overview and comparison tasks. We present an interactive approach for the exploration of spatio-temporal data, based on a set of neighborhood-preserving 1D projections which help identify patterns and support the comparison of numerous time steps and multivariate data. An important objective of the proposed approach is the visual description of local neighborhoods in the 1D projection to reveal patterns of similarity and propagation. As this locality cannot generally be guaranteed, we provide a selection of different projection techniques, as well as a hierarchical approach, to support the analysis of different data characteristics. In addition, we offer an interactive exploration technique to reorganize and improve the mapping locally to users’ foci of interest. We demonstrate the usefulness of our approach with different real-world application scenarios and discuss the feedback we received from domain and visualization experts.

Presenter: Max Franke

Abstract: We propose to take an artifact-centric approach to design studies by leveraging the concept of boundary object. Design studies typically focus on processes and articulate design decisions in a project-specific context with a goal of transferability. We argue that design studies could benefit from paying attention to the material conditions in which teams collaborate to reach design outcomes. We report on a design study of isochrone maps following cartographic generalization principles. Focusing on boundary objects enables us to characterize five categories of artifacts and tools that facilitated collaboration between actors involved in the design process (structured collections, structuring artifacts, process-centric artifacts, generative artifacts, and bridging artifacts). We found that artifacts such as layered maps and map collections played a unifying role for our inter-disciplinary team. We discuss how such artifacts can be pivotal in the design process. Finally, we discuss how considering boundary objects could improve the transferability of design study results, and support reflection on inter-disciplinary collaboration in the domain of Information Visualization.

Presenter: Romain Vuillemot, Aurélien Tabard

Abstract: Colormapping is one of the simplest and most widely used data visualization methods within and outside the visualization community. Uniformity, order, discriminative power, and smoothness of continuous colormaps are the most important criteria for evaluating and potentially improving colormaps. We present a local and a global automatic optimization algorithm in Euclidean color spaces for each of these design rules in this work. As a foundation for our optimization algorithms, we used the CCC-Tool colormap specification (CMS); each algorithm has been implemented in the CCC-Tool. In addition to synthetic examples that demonstrate each method’s effect, we show the outcome of some of the methods applied to a typhoon simulation.

Presenter: Pascal Nardini

Abstract: While there are many visualization techniques for exploring numeric data, only a few work with categorical data. One prominent example is Parallel Sets, showing data frequencies instead of data points – analogous to parallel coordinates for numerical data. As nominal data does not have an intrinsic order, the design of Parallel Sets is sensitive to visual clutter due to overlaps, crossings, and subdivision of ribbons hindering readability and pattern detection. In this paper, we propose a set of quality metrics, called ParSetgnostics (Parallel Sets diagnostics), which aim to improve Parallel Sets by reducing clutter. These quality metrics quantify important properties of Parallel Sets such as overlap, orthogonality, ribbon width variance, and mutual information to optimize the category and dimension ordering. By conducting a systematic correlation analysis between the individual metrics, we ensure their distinctiveness. Further, we evaluate the clutter reduction effect of ParSetgnostics by reconstructing six datasets from previous publications using Parallel Sets measuring and comparing their respective properties. Our results show that ParSetgostics facilitates multi-dimensional analysis of categorical data by automatically providing optimized Parallel Set designs with a clutter reduction of up to 81% compared to the originally proposed Parallel Sets visualizations.

Presenter: Frederik Dennig

Abstract: We introduce a novel approach for assisting users in exploring 2D data representations with an interactive lens. Focus-and-context exploration is supported by translating user actions to the joint adjustments in camera and lens parameters that ensure a good placement and sizing of the lens within the view. This general approach, implemented using standard device mappings, overcomes the limitations of current solutions, which force users to continuously switch from lens positioning and scaling to view panning and zooming. Navigation is further assisted by exploiting data annotations. In addition to traditional visual markups and information links, we associate to each annotation a lens configuration that highlights the region of interest. During interaction, an assisting controller determines the next best lens in the database based on the current view and lens parameters and the navigation history. Then, the controller interactively guides the user’s lens towards the selected target and displays its annotation markup. As only one annotation markup is displayed at a time, clutter is reduced. Moreover, in addition to guidance, the navigation can also be automated to create a tour through the data. While our methods are generally applicable to general 2D visualization, we have implemented them for the exploration of stratigraphic relightable models. The capabilities of our approach are demonstrated in cultural heritage use cases. A user study has been performed in order to validate our approach.

Presenter: Moonisa Ahsan

Abstract: Line charts are an effective and widely used technique for visualizing series of ordered two-dimensional data points. The relationship between consecutive points is indicated by connecting line segments, revealing potential trends or clusters in the underlying data. However, when dealing with an increasing number of lines, the render order substantially influences the resulting visualization. Rendering transparent lines can help but unfortunately the blending order is currently either ignored or naively used, for example, assuming it is implicitly given by the order in which the data was saved in a file. Due to the non-commutativity of classic alpha blending, this results in contradicting visualizations of the same underlying data set, so-called “”hallucinators””. In this paper, we therefore present line weaver, a novel visualization technique for dense line charts. Using an importance function, we developed an approach that correctly considers the blending order independently of the render order and without any prior sorting of the data. We allow for importance functions which are either explicitly given or implicitly derived from the geometric properties of the data if no external data is available. The importance can then be applied globally to entire lines, or locally per pixel which simultaneously supports various types of user interaction. Finally, we discuss the potential of our contribution based on different synthetic and real-world data sets where classic or naive approaches would fail.

Presenter: Thomas Trautner

Abstract: Diffusion Tensor Imaging (DTI) is a non-invasive magnetic resonance imaging technique that, combined with fiber tracking algorithms, allows the characterization and visualization of white matter structures in the brain. The resulting fiber tracts are used, for example, in tumor surgery to evaluate the potential brain functional damage due to tumor resection. The DTI processing pipeline from image acquisition to the final visualization is rather complex generating undesirable uncertainties in the final results. Most DTI visualization techniques do not provide any information regarding the presence of uncertainty. When planning surgery, a fixed safety margin around the fiber tracts is often used; however, it cannot capture local variability and distribution of the uncertainty, thereby limiting the informed decision-making process. Stochastic techniques are a possibility to estimate uncertainty for the DTI pipeline. However, it has high computational and memory requirements that make it infeasible in a clinical setting. The delay in the visualization of the results adds hindrance to the workflow. We propose a progressive approach that relies on a combination of wild-bootstrapping and fiber tracking to be used within the progressive visual analytics paradigm. We present a local bootstrapping strategy, which reduces the computational and memory costs, and provides fiber-tracking results in a progressive manner. We have also implemented a progressive aggregation technique that computes the distances in the fiber ensemble during progressive bootstrap computations. We present experiments with different scenarios to highlight the benefits of using our progressive visual analytic pipeline in a clinical workflow along with a use case and analysis obtained by discussions with our collaborators.

Presenter: Faizan Siddiqui

Abstract: Aortic dissection is a life-threatening vascular disease characterized by abrupt formation of a new flow channel (false lumen) within the aortic wall. Survivors of the acute phase remain at high risk for late complications, such as aneurysm formation, rupture, and death. Morphologic features of aortic dissection determine not only treatment strategies in the acute phase (surgical vs. endovascular vs. medical), but also modulate the hemodynamics in the false lumen, ultimately responsible for late complications. Accurate description of the true and false lumen, any communications across the dissection membrane separating the two lumina, and blood supply from each lumen to aortic branch vessels is critical for risk prediction. Patient-specific surface representations are also a prerequisite for hemodynamic simulations, but currently require time-consuming manual segmentation of CT data. We present an aortic dissection cross-sectional model that captures the varying aortic anatomy, allowing for reliable measurements and creation of high-quality surface representations. In contrast to the traditional spline-based cross-sectional model, we employ elliptic Fourier descriptors, which allows users to control the accuracy of the cross-sectional contour of a flow channel. We demonstrate (i) how our approach can solve the requirements for generating surface and wall representations of the flow channels, (ii) how any number of communications between flow channels can be specified in a consistent manner, and (iii) how well branches connected to the respective flow channels are handled. Finally, we discuss how our approach is a step forward to an automated generation of surface models for aortic dissections from raw 3D imaging segmentation masks.

Presenter: Gabriel Mistelbauer

Abstract: In this work, we investigate how concepts from medical flow visualization can be applied to enhance stroke prevention diagnostics. Our focus lies on carotid stenoses, i.e., local narrowings of the major brain-supplying arteries, which are a frequent cause of stroke. Carotid surgery can reduce the stroke risk associated with stenoses, however, the procedure entails risks itself. Therefore, a thorough assessment of each case is necessary. In routine diagnostics, the morphology and hemodynamics of an afflicted vessel are separately analyzed using angiography and sonography, respectively. Blood flow simulations based on computational fluid dynamics could enable the visual integration of hemodynamic and morphological information and provide a higher resolution on relevant parameters. We identify and abstract the tasks involved in the assessment of stenoses and investigate how clinicians could derive relevant insights from carotid blood flow simulations. We adapt and refine a combination of techniques to facilitate this purpose, integrating spatiotemporal navigation, dimensional reduction, and contextual embedding. We evaluated and discussed our approach with an interdisciplinary group of medical practitioners, fluid simulation and flow visualization researchers. Our initial findings indicate that visualization techniques could promote usage of carotid blood flow simulations in practice.

Presenter: Pepe Eulzer

Abstract: A connectivity graph of neurons at the resolution of single synapses provides scientists with a tool for understanding the nervous system in health and disease. Recent advances in automatic image segmentation and synapse prediction in electron microscopy (EM) datasets of the brain have made reconstructions of neurons possible at the nanometer scale. However, automatic segmentation sometimes struggles to segment large neurons correctly, requiring human effort to proofread its output. General proofreading involves inspecting large volumes to correct segmentation errors at the pixel level, a visually intensive and time-consuming process. This paper presents the design and implementation of an analytics framework that streamlines proofreading, focusing on connectivity-related errors. We accomplish this with automated likely-error detection and synapse clustering that drives the proofreading effort with highly interactive 3D visualizations. In particular, our strategy centers on proofreading the local circuit of a single cell to ensure a basic level of completeness. We demonstrate our framework’s utility with a user study and report quantitative and subjective feedback from our users. Overall, users find the framework more efficient for proofreading, understanding evolving graphs, and sharing error correction strategies.

Presenter: Felix Gonda

Abstract: Increased access to mobile devices motivates the need to design communicative visualizations that are responsive to varying screen sizes. However, relatively little design guidance or tooling is currently available to authors. We contribute a detailed characterization of responsive visualization strategies in communication-oriented visualizations, identifying 76 total strategies by analyzing 378 pairs of large screen (LS) and small screen (SS) visualizations from online articles and reports. Our analysis distinguishes between the Targets of responsive visualization, referring to what elements of a design are changed and Actions representing how targets are changed. We identify key trade-offs related to authors’ need to maintain graphical density, referring to the amount of information per pixel, while also maintaining the “message’’ or intended takeaways for users of a visualization. We discuss implications of our findings for future visualization tool design to support responsive transformation of visualization designs, including requirements for automated recommenders for communication-oriented responsive visualizations.

Presenter: Hyeok Kim

Abstract: In geographic data analysis, one is often given point data of different categories (such as facilities of a university categorized by department). Drawing upon recent research on set visualization, we want to visualize category membership by connecting points of the same category with visual links. Existing approaches that follow this path usually insist on connecting all members of a category, which may lead to many crossings and visual clutter. We propose an approach that avoids crossings between connections of different categories completely. Instead of connecting all data points of the same category, we subdivide categories into smaller, local clusters where needed. We do a case study comparing the legibility of drawings produced by our approach and those by existing approaches.In our problem formulation, we are additionally given a graph G on the data points whose edges express some sort of proximity. Our aim is to find a subgraph G’ of G with the following properties:(i) edges connect only data points of the same category, (ii) no two edges cross, and (iii) the number of connected components (clusters) is minimized. We then visualize the clusters in G’. For arbitrary graphs, the resulting optimization problem, Cluster Minimization, is NP-hard (even to approximate). Therefore, we introduce two heuristics. We do an extensive benchmark test on real-world data. Comparisons with exact solutions indicate that our heuristics do astonishing well for certain relative-neighborhood graphs.

Presenter: Philipp Kindermann

Abstract: Radial axes plots are projection methods that represent high-dimensional data samples as points on a two-dimensional plane. These techniques define mappings through a set of axis vectors, each associated with a data variable, which users can manipulate interactively to create different plots and analyze data from multiple points of view. However, updating the direction and length of an axis vector is far from trivial. Users must consider the data analysis task, domain knowledge, the directions in which values should increase, the relative importance of each variable, or the correlations between variables, among other factors. Another issue is the difficulty to approximate high-dimensional data values in the two-dimensional visualizations, which can hamper searching for data with particular characteristics, analyzing the most common data values in clusters, inspecting outliers, etc. In this paper we present and analyze several optimization approaches for enhancing radial axes plots regarding their ability to represent high-dimensional data values. The techniques can be used not only to approximate data values with greater accuracy, but also to guide users when updating axis vectors or extending visualizations with new variables, since they can reveal poor choices of axis vectors. The optimal axes can also be included in nonlinear plots. In particular, we show how they can be used within RadViz to assess the quality of a variable ordering. The in-depth analysis carried out is useful for visualization designers developing radial axes techniques, or planning to incorporate axes into other visualization methods.

Presenter: Manuel Rubio-Sánchez

Abstract: Data videos, a storytelling genre that visualizes data facts with motion graphics, are gaining increasing popularity among data journalists, non-profits, and marketers to communicate data to broad audiences. However, crafting a data video is often time-consuming and asks for various domain knowledge such as data visualization, animation design, and screenwriting. Existing authoring tools usually enable users to edit and compose a set of templates manually, which still cost a lot of human effort.To further lower the barrier of creating data videos, this work introduces a new approach, AutoClips, which can automatically generate data videos given the input of a sequence of data facts. We built AutoClips through two stages. First, we constructed a fact-driven clip library where we mapped ten data facts to potential animated visualizations respectively by analyzing 230 online data videos and conducting interviews. Next, we constructed an algorithm that generates data videos from data facts through three steps: selecting and identifying the optimal clip for each of the data facts, arranging the clips into a coherent video, and optimizing the duration of the video. The results from two user studies indicated that the data videos generated byAutoClips are comprehensible, engaging, and have comparable quality with human-made videos.

Presenter: Danqing Shi

Abstract: By displaying visual elements logically in temporal order, animated infographics can help readers better understand layers of information expressed in an infographic. While many techniques and tools target the quick generation of static infographics, few support animation designs. We propose InfoMotion that automatically generates animated presentations of static infographics. We first conduct a survey to explore the design space of animated infographics. Based on this survey, InfoMotion extracts graphical properties of an infographic to analyze the underlying information structures; then, animation effects are applied to the visual elements in the infographic in temporal order to present the infographic. The generated animations can be used in data videos or presentations. We demonstrate the utility of InfoMotion with two example applications, including mixed-initiative animation authoring and animation recommendation. To further understand the quality of the generated animations, we conduct a user study to gather subjective feedback on the animations generated by InfoMotion.

Presenter: Yun Wang

Abstract: Given a time-varying scalar field, the analysis of correlations between different spatial regions, i.e., the linear dependence of time series within these regions, provides insights into the structural properties of the data.In this context, regions are connected components of the spatial domain with high time series correlations.The detection and analysis of such regions is often performed globally, which requires pairwise correlation computations that are quadratic in the number of spatial data samples. Thus, operations based on all pairwise correlations are computationally demanding, especially when dealing with ensembles that model the uncertainty in the spatio-temporal phenomena using multiple simulation runs. We propose a two-step procedure: In a first step, we map the spatial samples to a 3D embedding based on a pairwise correlation matrix computed from the ensemble of time series. The 3D embedding allows for a one-to-one mapping to a 3D color space such that the outcome can be visually investigated by rendering the colors for all samples in the spatial domain. In a second step, we generate a hierarchical image segmentation based on the color images. From then on, we can visually analyze correlations of regions at all levels in the hierarchy within an interactive setting, which includes the uncertainty-aware analysis of the region’s time series correlation and respective time lags.

Presenter: Karim Huesmann

Abstract: There are many multiple-stage racing competitions in various sports such as swimming, running, or cycling. The wide availability of affordable tracking devices facilitates monitoring the position along with the race of all participants, even for non-professional contests. Getting real-time information of contenders is useful but also unleashes the possibility of creating more complex visualization systems that ease the understanding of the behavior of all participants during a simple stage or throughout the whole competition. In this paper we focus on bicycle races, which are highly popular, especially in Europe, being the Tour de France its greatest exponent. Current visualizations from TV broadcasting or real-time tracking websites are useful to understand the current stage status, up to a certain extent. Unfortunately, still no current system exists that visualizes a whole multi-stage contest in such a way that users can interactively explore the relevant events of a single stage (e.g. breakaways, groups, virtual leadership…), as well as the full competition. In this paper, we present an interactive system that is useful both for aficionados and professionals to visually analyze the development of multi-stage cycling competitions.

Presenter: Pere-Pau Vázquez