DevLan/vispubs huggingface dataset:
Interactive Fusion and Tracking For Multi-Modal Spatial Data Visualization
Authors: Mai El-Shehaly, Denis Gracanin, Mohamed A. Gad, Hicham G. Elmongui, Kresimir Matkovic
Published at EuroVis, 2015

Scientific data acquired through sensors which monitor natural phenomena, as well as simulation data that imitate time‐identified events, have fueled the need for interactive techniques to successfully analyze and understand trends and patterns across space and time. We present a novel interactive visualization technique that fuses ground truth measurements with simulation results in real‐time to support the continuous tracking and analysis of spatiotemporal patterns. We start by constructing a reference model which densely represents the expected temporal behavior, and then use GPU parallelism to advect measurements on the model and track their location at any given point in time. Our results show that users can interactively fill the spatio‐temporal gaps in real world observations, and generate animations that accurately describe physical phenomena.
Interactive Visual Analysis for Vehicle Detector Data
Authors: Yi-Cheng Chen, Yu-Shuen Wang, Wen-Chieh Lin, Wei-Xiang Huang, I-Chen Lin
Published at EuroVis, 2015

Visualization of vehicle detection (VD) data is essential because the data play an important role in traffic control and policy development. Most previous works focus on visualizing trajectories obtained from global positioning system (GPS), which are detailed but less representative. In contrast, VD data report the traffic statistic at each sensing site during a time span, including speed, flow, and occupancy of each lane, which contain comprehensive traffic information for analysis. In this work, we visualize three‐year VD data of freeways in Taiwan. The visualization depicts the traffic situation at a site over time using a color‐coded chart that extends from left to right over time. The charts are vertically stacked and horizontally aligned according to VD's located mileage and data time, respectively, to provide global insight. Our system allows semantic zoom, which changes the chart appearance in a continuous manner, to enable macro‐ and micro‐ scopic visualizations. Analysts can explore events that span an area with different sizes and that persist a time span with various lengths. To ensure the feasibility of our visualization, before the system design, we conducted a study with experts who work in the national freeway bureau and the institute of transportation of Taiwan. We also showed our results to the experts after the prototype system was built. The feedback shows that our VD data visualization is helpful to traffic control and policy development.
Learning Probabilistic Transfer Functions: A Comparative Study of Classifiers
Authors: Krishna Prasad Soundararajan, Thomas Schultz 0001
Published at EuroVis, 2015

Complex volume rendering tasks require high‐dimensional transfer functions, which are notoriously difficult to design. One solution to this is to learn transfer functions from scribbles that the user places in the volumetric domain in an intuitive and natural manner. In this paper, we explicitly model and visualize the uncertainty in the resulting classification. To this end, we extend a previous intelligent system approach to volume rendering, and we systematically compare five supervised classification techniques – Gaussian Naive Bayes, k Nearest Neighbor, Support Vector Machines, Neural Networks, and Random Forests – with respect to probabilistic classification, support for multiple materials, interactive performance, robustness to unreliable input, and easy parameter tuning, which we identify as key requirements for the successful use in this application. Based on theoretical considerations, as well as quantitative and visual results on volume datasets from different sources and modalities, we conclude that, while no single classifier can be expected to outperform all others under all circumstances, random forests are a useful off‐the‐shelf technique that provides fast, easy, robust and accurate results in many scenarios.
Map-based Visualizations Increase Recall Accuracy of Data
Authors: Bahador Saket, Carlos Scheidegger, Stephen G. Kobourov, Katy Börner
Published at EuroVis, 2015

We investigate the memorability of data represented in two different visualization designs. In contrast to recent studies that examine which types of visual information make visualizations memorable, we examine the effect of different visualizations on time and accuracy of recall of the displayed data, minutes and days after interaction with the visualizations. In particular, we describe the results of an evaluation comparing the memorability of two different visualizations of the same relational data: node‐link diagrams and map‐based visualization. We find significant differences in the accuracy of the tasks performed, and these differences persist days after the original exposure to the visualizations. Specifically, participants in the study recalled the data better when exposed to map‐based visualizations as opposed to node‐link diagrams. We discuss the scope of the study and its limitations, possible implications, and future directions.
MoleCollar and Tunnel Heat Map Visualizations for Conveying Spatio-Temporo-Chemical Properties Across and Along Protein Voids
Authors: Jan Byska, Adam Jurcík, M. Eduard Gröller, Ivan Viola, Barbora Kozlíková
Published at EuroVis, 2015

Studying the characteristics of proteins and their inner void space, including their geometry, physico‐chemical properties and dynamics are instrumental for evaluating the reactivity of the protein with other small molecules. The analysis of long simulations of molecular dynamics produces a large number of voids which have to be further explored and evaluated. In this paper we propose three new methods: two of them convey important properties along the long axis of a selected void during molecular dynamics and one provides a comprehensive picture across the void. The first two proposed methods use a specific heat map to present two types of information: an overview of all detected tunnels in the dynamics and their bottleneck width and stability over time, and an overview of a specific tunnel in the dynamics showing the bottleneck position and changes of the tunnel length over time. These methods help to select a small subset of tunnels, which are explored individually and in detail. For this stage we propose the third method, which shows in one static image the temporal evolvement of the shape of the most critical tunnel part, i.e., its bottleneck. This view is enriched with abstract depictions of different physicochemical properties of the amino acids surrounding the bottleneck. The usefulness of our newly proposed methods is demonstrated on a case study and the feedback from the domain experts is included. The biochemists confirmed that our novel methods help to convey the information about the appearance and properties of tunnels in a very intuitive and comprehensible manner.
Mosaic Drawings and Cartograms
Authors: Rafael G. Cano, Kevin Buchin, Thom Castermans, Astrid Pieterse, Willem Sonke, Bettina Speckmann
Published at EuroVis, 2015

Cartograms visualize quantitative data about a set of regions such as countries or states. There are several different types of cartograms and – for some – algorithms to automatically construct them exist. We focus on mosaic cartograms: cartograms that use multiples of simple tiles – usually squares or hexagons – to represent regions. Mosaic cartograms communicate well data that consist of, or can be cast into, small integer units (for example, electorial college votes). In addition, they allow users to accurately compare regions and can often maintain a (schematized) version of the input regions’ shapes. We propose the first fully automated method to construct mosaic cartograms. To do so, we first introduce mosaic drawings of triangulated planar graphs. We then show how to modify mosaic drawings into mosaic cartograms with low cartographic error while maintaining correct adjacencies between regions. We validate our approach experimentally and compare to other cartogram methods.
Perfopticon: Visual Query Analysis for Distributed Databases
Authors: Dominik Moritz, Daniel Halperin, Bill Howe, Jeffrey Heer
Published at EuroVis, 2015

Distributed database performance is often unpredictable due to issues such as system complexity, network congestion, or imbalanced data distribution. These issues are difficult for users to assess in part due to the opaque mapping between declaratively specified queries and actual physical execution plans. Database developers currently must expend significant time and effort scanning log files to isolate and debug the root causes of performance issues. In response, we present Perfopticon, an interactive query profiling tool that enables rapid insight into common problems such as performance bottlenecks and data skew. Perfopticon combines interactive visualizations of (1) query plans, (2) overall query execution, (3) data flow among servers, and (4) execution traces. These views coordinate multiple levels of abstraction to enable detection, isolation, and understanding of performance issues. We evaluate our design choices through engagements with system developers, scientists, and students. We demonstrate that Perfopticon enables performance debugging for real‐world tasks.
Persistent Homology for the Evaluation of Dimensionality Reduction Schemes
Authors: Bastian Rieck, Heike Leitte
Published at EuroVis, 2015

High‐dimensional data sets are a prevalent occurrence in many application domains. This data is commonly visualized using dimensionality reduction (DR) methods. DR methods provide e.g. a two‐dimensional embedding of the abstract data that retains relevant high‐dimensional characteristics such as local distances between data points. Since the amount of DR algorithms from which users may choose is steadily increasing, assessing their quality becomes more and more important. We present a novel technique to quantify and compare the quality of DR algorithms that is based on persistent homology. An inherent beneficial property of persistent homology is its robustness against noise which makes it well suited for real world data. Our pipeline informs about the best DR technique for a given data set and chosen metric (e.g. preservation of local distances) and provides knowledge about the local quality of an embedding, thereby helping users understand the shortcomings of the selected DR method. The utility of our method is demonstrated using application data from multiple domains and a variety of commonly used DR methods.
Photoelasticity Raycasting
Authors: Michael Bußler, Thomas Ertl, Filip Sadlo
Published at EuroVis, 2015

We present a novel physically‐based method to visualize stress tensor fields. By incorporating photoelasticity into traditional raycasting and extending it with reflection and refraction, taking into account polarization, we obtain the virtual counterpart to traditional experimental polariscopes. This allows us to provide photoelastic analysis of stress tensor fields in arbitrary domains. In our model, the optical material properties, such as stress‐optic coefficient and refractive index, can either be chosen in compliance with the subject under investigation, or, in case of stress problems that do not model optical properties or that are not transparent, be chosen according to known or even new transparent materials. This enables direct application of established polariscope methodology together with respective interpretation. Using a GPU‐based implementation, we compare our technique to experimental data, and demonstrate its utility with several simulated datasets.
Quantitative Measures for Cartogram Generation Techniques
Authors: Md. Jawaherul Alam, Stephen G. Kobourov, Sankar Veeramoni
Published at EuroVis, 2015

Cartograms are used to visualize geographically distributed data by scaling the regions of a map (e.g., US states) such that their areas are proportional to some data associated with them (e.g., population). Thus the cartogram computation problem can be considered as a map deformation problem where the input is a planar polygonal map M and an assignment of some positive weight for each region. The goal is to create a deformed map M′, where the area of each region realizes the weight assigned to it (no cartographic error) while the overall map remains readable and recognizable (e.g., the topology, relative positions and shapes of the regions remain as close to those before the deformation as possible). Although several such measures of cartogram quality are well‐known, different cartogram generation methods optimize different features and there is no standard set of quantitative metrics. In this paper we define such a set of seven quantitative measures, designed to evaluate how faithfully a cartogram represents the desired weights and to estimate the readability of the final representation. We then study several cartogram‐generation algorithms and compare them in terms of these quantitative measures.
Rationale Visualization for Safety and Security
Authors: Roeland Scheepens, Steffen Michels, Huub van de Wetering, Jarke J. van Wijk
Published at EuroVis, 2015

In safety and security domains where objects of interest (OOI), such as people, vessels, or transactions, are continuously monitored, automated reasoning is required due to their sheer number and volume of information. We present a method to visually explain the rationale of a reasoning engine that raises an alarm if a certain situation is reached. Based both on evidence from heterogeneous and possibly unreliable sources, and on a domain specific reasoning structure, this engine concludes with a certain probability that, e.g., the OOI is suspected of smuggling. To support decision making, we visualize the rationale, an abstraction of the complicated reasoning structure. The evidence is displayed in a color‐coded matrix that easily reveals if and where observations contradict. In it, domain and operational experts can quickly understand and find complicated patterns and relate them to real‐world situations. Also, two groups of these experts evaluate our system through maritime use cases based on real data.
Refinery: Visual Exploration of Large, Heterogeneous Networks through Associative Browsing
Authors: Sanjay Kairam, Nathalie Henry Riche, Steven Mark Drucker, Roland Fernandez, Jeffrey Heer
Published at EuroVis, 2015

Browsing is a fundamental aspect of exploratory information‐seeking. Associative browsing represents a common and intuitive set of exploratory strategies in which users step iteratively from familiar to novel bits of information. In this paper, we examine associative browsing as a strategy for bottom‐up exploration of large, heterogeneous networks. We present Refinery, an interactive visualization system informed by guidelines for associative browsing drawn from literature on exploratory information‐seeking. These guidelines motivate Refinery's query model, which allows users to simply and expressively construct queries using heterogeneous sets of nodes. This system computes degree‐of‐interest scores for associated content using a fast, random‐walk algorithm. Refinery visualizes query nodes within a subgraph of results, providing explanatory context, facilitating serendipitous discovery, and stimulating continued exploration. A study of 12 academic researchers using Refinery to browse publication data demonstrates how the system enables discovery of valuable new content, even within existing areas of expertise.
Rule-Enhanced Transfer Function Generation for Medical Volume Visualization
Authors: Lile Cai, Binh P. Nguyen, Chee-Kong Chui, Sim Heng Ong
Published at EuroVis, 2015

In volume visualization, transfer functions are used to classify the volumetric data and assign optical properties to the voxels. In general, transfer functions are generated in a transfer function space, which is the feature space constructed by data values and properties derived from the data. If volumetric objects have the same or overlapping data values, it would be difficult to separate them in the transfer function space. In this paper, we present a rule‐enhanced transfer function design method that allows important structures of the volume to be more effectively separated and highlighted. We define a set of rules based on the local frequency distribution of volume attributes. A rule‐selection method based on a genetic algorithm is proposed to learn the set of rules that can distinguish the user‐specified target tissue from other tissues. In the rendering stage, voxels satisfying these rules are rendered with higher opacities in order to highlight the target tissue. The proposed method was tested on various volumetric datasets to enhance the visualization of important structures that are difficult to be visualized by traditional transfer function design methods. The results demonstrate the effectiveness of the proposed method.
Small MultiPiles: Piling Time to Explore Temporal Patterns in Dynamic Networks
Authors: Benjamin Bach, Nathalie Henry Riche, Tim Dwyer, Tara M. Madhyastha, Jean-Daniel Fekete, Thomas J. Grabowski
Published at EuroVis, 2015

We introduce MultiPiles, a visualization to explore time‐series of dense, weighted networks. MultiPiles is based on the physical analogy of piling adjacency matrices, each one representing a single temporal snapshot. Common interfaces for visualizing dynamic networks use techniques such as: flipping/animation; small multiples; or summary views in isolation. Our proposed ‘piling’ metaphor presents a hybrid of these techniques, leveraging each one's advantages, as well as offering the ability to scale to networks with hundreds of temporal snapshots. While the MultiPiles technique is applicable to many domains, our prototype was initially designed to help neuroscientists investigate changes in brain connectivity networks over several hundred snapshots. The piling metaphor and associated interaction and visual encodings allowed neuroscientists to explore their data, prior to a statistical analysis. They detected high‐level temporal patterns in individual networks and this helped them to formulate and reject several hypotheses.
Towards a smooth design process for static communicative node-link diagrams
Authors: Andre Suslik Spritzer, Jeremy Boy, Pierre Dragicevic, Jean-Daniel Fekete, Carla Maria Dal Sasso Freitas
Published at EuroVis, 2015

Node‐link infographics are visually very rich and can communicate messages effectively, but can be very difficult to create, often involving a painstaking and artisanal process. In this paper we present an investigation of node‐link visualizations for communication and how to better support their creation. We begin by breaking down these images into their basic elements and analyzing how they are created. We then present a set of techniques aimed at improving the creation workflow by bringing more flexibility and power to users, letting them manipulate all aspects of a node‐link diagram (layout, visual attributes, etc.) while taking into account the context in which it will appear. These techniques were implemented in a proof‐of‐concept prototype called GraphCoiffure, which was designed as an intermediary step between graph drawing/editing software and image authoring applications. We describe how GraphCoiffure improves the workflow and illustrate its benefits through practical examples.
Uncovering Representative Groups in Multidimensional Projections
Authors: Paulo Joia, Fabiano Petronetto, Luis Gustavo Nonato
Published at EuroVis, 2015

Multidimensional projection‐based visualization methods typically rely on clustering and attribute selection mechanisms to enable visual analysis of multidimensional data. Clustering is often employed to group similar instances according to their distance in the visual space. However, considering only distances in the visual space may be misleading due to projection errors as well as the lack of guarantees to ensure that distinct clusters contain instances with different content. Identifying clusters made up of a few elements is also an issue for most clustering methods. In this work we propose a novel multidimensional projection‐based visualization technique that relies on representative instances to define clusters in the visual space. Representative instances are selected by a deterministic sampling scheme derived from matrix decomposition, which is sensitive to the variability of data while still been able to handle classes with a small number of instances. Moreover, the sampling mechanism can easily be adapted to select relevant attributes from each cluster. Therefore, our methodology unifies sampling, clustering, and feature selection in a simple framework. A comprehensive set of experiments validate our methodology, showing it outperforms most existing sampling and feature selection techniques. A case study shows the effectiveness of the proposed methodology as a visual data analysis tool.
Vector Field Visualization of Advective-Diffusive Flows
Authors: Hendrik Hochstetter, Maximilian Wurm, Andreas Kolb 0001
Published at EuroVis, 2015

We propose a framework for unified visualization of advective and diffusive concentration fluxes, which play a key role in many phenomena like, e.g. Marangoni convection and microscopic mixing. The main idea is the decomposition of fluxes into their concentration and velocity parts. Using this flux decomposition, we are able to convey advective‐diffusive concentration transport using integral lines. In order to visualize superimposed flux effects, we introduce a new graphical metaphor, the stream feather, which adds extensions to stream tubes pointing in the directions of deviating fluxes. The resulting unified visualization of macroscopic advection and microscopic diffusion allows for deeper insight into complex flow scenarios that cannot be achieved with current volume and surface rendering techniques alone.Our approach for flux decomposition and visualization of advective‐diffusive flows can be applied to any kind of (simulation) data if velocity and concentration data are available. We demonstrate that our techniques can easily be integrated into Smoothed Particle Hydrodynamics (SPH) based simulations.
VIMTEX: A Visualization Interface for Multivariate, Time-Varying, Geological Data Exploration
Authors: Aritra Dasgupta, Robert Kosara, Luke J. Gosink
Published at EuroVis, 2015

Observing interactions among chemical species and microorganisms in the earth's sub‐surface is a common task in the field of geology. Bioremediation experiments constitute one such class of interactions which focus on getting rid of pollutants through processes such as carbon sequestration. The main goal of scientists’ observations is to analyze the dynamics of the chemical reactions and understand how they collectively affect the carbon content of the soil. In our work, we extract the high‐level goals of geologists and propose a visual analytics solution which helps scientists in deriving insights about multivariate, temporal behavior of these chemical species. Specifically, our key contributions are the following: i) characterization of the domain‐specific goals and their translation to exploratory data analysis tasks, ii) developing an analytical abstraction in the form of perceptually motivated screen‐space metrics for bridging the gap between the tasks and the visualization, and iii) realization of the tasks and metrics in the form of VIMTEX, which is a set of coordinated multiple views for letting scientists observe multivariate, temporal relationships in the data. We provide several examples and case studies along with expert feedback for demonstrating the efficacy of our solution.