EuroVis18: Eurographics Conference on Visualization

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/3607289

Browse

Now showing 1 - 20 of 48

Multiscale Visualization and Exploration of Large Bipartite Graphs
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Pezzotti, Nicola; Fekete, Jean-Daniel; Höllt, Thomas; Lelieveldt, Boudewijn P. F.; Eisemann, Elmar; Vilanova, Anna; Jeffrey Heer and Heike Leitte and Timo Ropinski
A bipartite graph is a powerful abstraction for modeling relationships between two collections. Visualizations of bipartite graphs allow users to understand the mutual relationships between the elements in the two collections, e.g., by identifying clusters of similarly connected elements. However, commonly-used visual representations do not scale for the analysis of large bipartite graphs containing tens of millions of vertices, often resorting to an a-priori clustering of the sets. To address this issue, we present the Who's-Active-On-What-Visualization (WAOW-Vis) that allows for multiscale exploration of a bipartite socialnetwork without imposing an a-priori clustering. To this end, we propose to treat a bipartite graph as a high-dimensional space and we create the WAOW-Vis adapting the multiscale dimensionality-reduction technique HSNE. The application of HSNE for bipartite graph requires several modifications that form the contributions of this work. Given the nature of the problem, a set-based similarity is proposed. For efficient and scalable computations, we use compressed bitmaps to represent sets and we present a novel space partitioning tree to efficiently compute similarities; the Sets Intersection Tree. Finally, we validate WAOWVis on several datasets connecting Twitter-users and -streams in different domains: news, computer science and politics. We show how WAOW-Vis is particularly effective in identifying hierarchies of communities among social-media users.
EuroVis 2018: Frontmatter
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Heer, Jeffrey; Leitte, Heike; Ropinski, Timo; Jeffrey Heer and Heike Leitte and Timo Ropinski
Bladder Runner: Visual Analytics for the Exploration of RT-Induced Bladder Toxicity in a Cohort Study
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Raidou, Renata Georgia; Casares-Magaz, Oscar; Amirkhanov, Aleksandr; Moiseenko, Vitali; Muren, Ludvig P.; Einck, John P.; Vilanova, Anna; Gröller, Eduard; Jeffrey Heer and Heike Leitte and Timo Ropinski
We present the Bladder Runner, a novel tool to enable detailed visual exploration and analysis of the impact of bladder shape variation on the accuracy of dose delivery, during the course of prostate cancer radiotherapy (RT). Our tool enables the investigation of individual patients and cohorts through the entire treatment process, and it can give indications of RT-induced complications for the patient. In prostate cancer RT treatment, despite the design of an initial plan prior to dose administration, bladder toxicity remains very common. The main reason is that the dose is delivered in multiple fractions over a period of weeks, during which, the anatomical variation of the bladder - due to differences in urinary filling - causes deviations between planned and delivered doses. Clinical researchers want to correlate bladder shape variations to dose deviations and toxicity risk through cohort studies, to understand which specific bladder shape characteristics are more prone to side effects. This is currently done with Dose-Volume Histograms (DVHs), which provide limited, qualitative insight. The effect of bladder variation on dose delivery and the resulting toxicity cannot be currently examined with the DVHs. To address this need, we designed and implemented the Bladder Runner, which incorporates visualization strategies in a highly interactive environment with multiple linked views. Individual patients can be explored and analyzed through the entire treatment period, while inter-patient and temporal exploration, analysis and comparison are also supported. We demonstrate the applicability of our presented tool with a usage scenario, employing a dataset of 29 patients followed through the course of the treatment, across 13 time points. We conducted an evaluation with three clinical researchers working on the investigation of RT-induced bladder toxicity. All participants agreed that Bladder Runner provides better understanding and new opportunities for the exploration and analysis of the involved cohort data.
Baseball Timeline: Summarizing Baseball Plays Into a Static Visualization
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Ono, Jorge H. Piazentin; Dietrich, Carlos; Silva, Claudio T.; Jeffrey Heer and Heike Leitte and Timo Ropinski
In sports, Play Diagrams are the standard way to represent and convey information. They are widely used by coaches, managers, journalists and fans in general. There are situations where diagrams may be hard to understand, for example, when several actions are packed in a certain region of the field or there are just too many actions to be transformed in a clear depiction of the play. The representation of how actions develop through time, in particular, may be hardly achieved on such diagrams. The time, and the relationship among the actions of the players through time, is critical on the depiction of complex plays. In this context, we present a study on how player actions may be clearly depicted on 2D diagrams. The study is focused on Baseball plays, a sport where diagrams are heavily used to summarize the actions of the players. We propose a new and simple approach to represent spatiotemporal information in the form of a timeline. We designed our visualization with a requirement driven approach, conducting interviews and fulfilling the needs of baseball experts and expert-fans. We validate our approach by presenting a detailed analysis of baseball plays and conducting interviews with four domain experts.
ChangeCatcher: Increasing Inter-author Awareness for Visualization Development
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Loorak, Mona Hosseinkhani; Tory, Melanie; Carpendale, Sheelagh; Jeffrey Heer and Heike Leitte and Timo Ropinski
We introduce an approach for explicitly revealing changes between versions of a visualization workbook to support version comparison tasks. Visualization authors may need to understand version changes for a variety of reasons, analogous to document editing. An author who has been away for a while may need to catch up on the changes made by their co-author, or a person responsible for formatting compliance may need to check formatting changes that occurred since the last time they reviewed the work. We introduce ChangeCatcher, a prototype tool to help people find and understand changes in a visualization workbook, specifically, a Tableau workbook. Our design is based on interviews we conducted with experts to investigate user needs and practices around version comparison. ChangeCatcher provides an overview of changes across six categories, and employs a multi-level details-on-demand approach to progressively reveal details. Our qualitative study showed that ChangeCatcher's methods for explicitly revealing and categorizing version changes were helpful in version comparison tasks.
CFGExplorer: Designing a Visual Control Flow Analytics System around Basic Program Analysis Operations
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Devkota, Sabin; Isaacs, Katherine E.; Jeffrey Heer and Heike Leitte and Timo Ropinski
To develop new compilation and optimization techniques, computer scientists frequently consult program analysis artifacts such as control flow graphs (CFGs) and traces of executed instructions. A CFG is a directed graph representing possible execution paths in a program. CFGs are commonly visualized as node-link diagrams while traces are commonly viewed in raw text format. Visualizing and exploring CFGs and traces is challenging because of the complexity and specificity of the operations researchers perform. We present a design study where we collaborate with computer scientists researching dynamic binary analysis and compilation techniques. The research group primarily employs CFGs and traces to reason about and develop new algorithms for program optimization and parallelization. Through questionnaires, interviews, and a year-long observation, we analyzed their use of visualization, noting that the tasks they perform match common subroutines they employ in their techniques. Based on this task analysis, we designed CFGExplorer, a visual analytics system that supports computer scientists with interactions that are integrated with the program structure. We developed a domain-specific graph modification to generate graph layouts that reflect program structure. CFGExplorer incorporates structures such as functions and loops, and uses the correspondence between CFGs and traces to support navigation. We further augment the system to highlight the output of program analysis techniques, facilitating exploration at a higher level. We evaluate the tool through guided sessions and semi-structured interviews as well as deployment. Our collaborators have integrated CFGExplorer into their workflow and use it to reason about programs, develop and debug new algorithms, and share their findings.
Visualizing the Phase Space of Heterogeneous Inertial Particles in 2D Flows
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Rojo, Irene Baeza; Gross, Markus; Günther, Tobias; Jeffrey Heer and Heike Leitte and Timo Ropinski
In many scientific disciplines, the motion of finite-sized objects in fluid flows plays an important role, such as in brownout engineering, sediment transport, oceanology or meteorology. These finite-sized objects are called inertial particles and, in contrast to traditional tracer particles, their motion depends on their current position, their own particle velocity, the time and their size. Thus, the visualization of their motion becomes a high-dimensional problem that entails computational and perceptual challenges. So far, no visualization explored and visualized the particle trajectories under variation of all seeding parameters. In this paper, we propose three coordinated views that visualize the different aspects of the high-dimensional space in which the particles live. We visualize the evolution of particles over time, showing that particles travel different distances in the same time, depending on their size. The second view provides a clear illustration of the trajectories of different particle sizes and allows the user to easily identify differences due to particle size. Finally, we embed the trajectories in the space-velocity domain and visualize their distance to an attracting manifold using ribbons. In all views, we support interactive linking and brushing, and provide abstraction through density volumes that are shown by direct volume rendering and isosurface slabs. Using our method, users gain deeper insights into the dynamics of inertial particles in 2D fluids, including size-dependent separation, preferential clustering and attraction. We demonstrate the effectiveness of our method in multiple steady and unsteady 2D flows.
Fast and Accurate CNN-based Brushing in Scatterplots
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Fan, Chaoran; Hauser, Helwig; Jeffrey Heer and Heike Leitte and Timo Ropinski
Brushing plays a central role in most modern visual analytics solutions and effective and efficient techniques for data selection are key to establishing a successful human-computer dialogue. With this paper, we address the need for brushing techniques that are both fast, enabling a fluid interaction in visual data exploration and analysis, and also accurate, i.e., enabling the user to effectively select specific data subsets, even when their geometric delimination is non-trivial. We present a new solution for a near-perfect sketch-based brushing technique, where we exploit a convolutional neural network (CNN) for estimating the intended data selection from a fast and simple click-and-drag interaction and from the data distribution in the visualization. Our key contributions include a drastically reduced error rate-now below 3%, i.e., less than half of the so far best accuracy- and an extension to a larger variety of selected data subsets, going beyond previous limitations due to linear estimation models.
Interactive Investigation of Traffic Congestion on Fat-Tree Networks Using TREESCOPE
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Bhatia, Harsh; Jain, Nikhil; Bhatele, Abhinav; Livnat, Yarden; Domke, Jens; Pascucci, Valerio; Bremer, Peer-Timo; Jeffrey Heer and Heike Leitte and Timo Ropinski
Parallel simulation codes often suffer from performance bottlenecks due to network congestion, leaving millions of dollars of investments underutilized. Given a network topology, it is critical to understand how different applications, job placements, routing schemes, etc., are affected by and contribute to network congestion, especially for large and complex networks. Understanding and optimizing communication on large-scale networks is an active area of research. Domain experts often use exploratory tools to develop both intuitive and formal metrics for network health and performance. This paper presents TREESCOPE, an interactive, web-based visualization tool for exploring network traffic on large-scale fat-tree networks. TREESCOPE encodes the network topology using a tailored matrix-based representation and provides detailed visualization of all traffic in the network. We report on the design process of TREESCOPE, which has been received positively by network researchers as well as system administrators. Through case studies of real and simulated data, we demonstrate how TREESCOPE's visual design and interactive support for complex queries on network traffic can provide experts with new insights into the occurrences and causes of congestion in the network.
Visual Analysis of Protein-ligand Interactions
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Vázquez, Pere-Pau; Casajus, Pedro Hermosilla; Guallar, Victor; Estrada, Jorge; Vinacua, Àlvar; Jeffrey Heer and Heike Leitte and Timo Ropinski
The analysis of protein-ligand interactions is complex because of the many factors at play. Most current methods for visual analysis provide this information in the form of simple 2D plots, which, besides being quite space hungry, often encode a low number of different properties. In this paper we present a system for compact 2D visualization of molecular simulations. It purposely omits most spatial information and presents physical information associated to single molecular components and their pairwise interactions through a set of 2D InfoVis tools with coordinated views, suitable interaction, and focus+context techniques to analyze large amounts of data. The system provides a wide range of motifs for elements such as protein secondary structures or hydrogen bond networks, and a set of tools for their interactive inspection, both for a single simulation and for comparing two different simulations. As a result, the analysis of protein-ligand interactions of Molecular Simulation trajectories is greatly facilitated.
Exploring the Visualization Design Space with Repertory Grids
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Kurzhals, Kuno; Weiskopf, Daniel; Jeffrey Heer and Heike Leitte and Timo Ropinski
There is an ongoing discussion in the visualization community about the relevant factors that render a visualization effective, expressive, memorable, aesthetically pleasing, etc. These factors lead to a large design space for visualizations. To explore this design space, qualitative research methods based on observations and interviews are often necessary. We describe an interview method that allows us to systematically acquire and assess important factors from subjective answers by interviewees. To this end, we adopt the repertory grid methodology in the context of visualization. It is based on the personal construct theory: each personality interprets a topic based on a set of personal, basic constructs expressed as contrasts. For the individual interpretation of visualizations, this means that these personal terms can be very different, depending on numerous influences, such as the prior experiences of the interviewed person. We present an interviewing process, visual interface, and qualitative and quantitative analysis procedures that are specifically devised to fit the needs of visualization applications. A showcase interview with 15 typical static information visualizations and 10 participants demonstrates that our approach is effective in identifying common constructs as well as individual differences. In particular, we investigate differences between expert and nonexpert interviewees. Finally, we discuss the differences to other qualitative methods and how the repertory grid can be embedded in existing theoretical frameworks of visualization research for the design process.
Towards User-Centered Active Learning Algorithms
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Bernard, Jürgen; Zeppelzauer, Matthias; Lehmann, Markus; Müller, Martin; Sedlmair, Michael; Jeffrey Heer and Heike Leitte and Timo Ropinski
The labeling of data sets is a time-consuming task, which is, however, an important prerequisite for machine learning and visual analytics. Visual-interactive labeling (VIAL) provides users an active role in the process of labeling, with the goal to combine the potentials of humans and machines to make labeling more efficient. Recent experiments showed that users apply different strategies when selecting instances for labeling with visual-interactive interfaces. In this paper, we contribute a systematic quantitative analysis of such user strategies. We identify computational building blocks of user strategies, formalize them, and investigate their potentials for different machine learning tasks in systematic experiments. The core insights of our experiments are as follows. First, we identified that particular user strategies can be used to considerably mitigate the bootstrap (cold start) problem in early labeling phases. Second, we observed that they have the potential to outperform existing active learning strategies in later phases. Third, we analyzed the identified core building blocks, which can serve as the basis for novel selection strategies. Overall, we observed that data-based user strategies (clusters, dense areas) work considerably well in early phases, while model-based user strategies (e.g., class separation) perform better during later phases. The insights gained from this work can be applied to develop novel active learning approaches as well as to better guide users in visual interactive labeling.
A General Illumination Model for Molecular Visualization
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Casajus, Pedro Hermosilla; Vázquez, Pere-Pau; Vinacua, Àlvar; Ropinski, Timo; Jeffrey Heer and Heike Leitte and Timo Ropinski
Several visual representations have been developed over the years to visualize molecular structures, and to enable a better understanding of their underlying chemical processes. Today, the most frequently used atom-based representations are the Space-filling, the Solvent Excluded Surface, the Balls-and-Sticks, and the Licorice models. While each of these representations has its individual benefits, when applied to large-scale models spatial arrangements can be difficult to interpret when employing current visualization techniques. In the past it has been shown that global illumination techniques improve the perception of molecular visualizations; unfortunately existing approaches are tailored towards a single visual representation. We propose a general illumination model for molecular visualization that is valid for different representations. With our illumination model, it becomes possible, for the first time, to achieve consistent illumination among all atom-based molecular representations. The proposed model can be further evaluated in real-time, as it employs an analytical solution to simulate diffuse light interactions between objects. To be able to derive such a solution for the rather complicated and diverse visual representations, we propose the use of regression analysis together with adapted parameter sampling strategies as well as shape parametrization guided sampling, which are applied to the geometric building blocks of the targeted visual representations. We will discuss the proposed sampling strategies, the derived illumination model, and demonstrate its capabilities when visualizing several dynamic molecules.
Spatio-Temporal Contours from Deep Volume Raycasting
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Frey, Steffen; Jeffrey Heer and Heike Leitte and Timo Ropinski
We visualize contours for spatio-temporal processes to indicate where and when non-continuous changes occur or spatial bounds are encountered. All time steps are comprised densely in one visualization, with contours allowing to efficiently analyze processes in the data even in case of spatial or temporal overlap. Contours are determined on the basis of deep raycasting that collects samples across time and depth along each ray. For each sample along a ray, its closest neighbors from adjacent rays are identified, considering time, depth, and value in the process. Large distances are represented as contours in image space, using color to indicate temporal occurrence. This contour representation can easily be combined with volume rendering-based techniques, providing both full spatial detail for individual time steps and an outline of the whole time series in one view. Our view-dependent technique supports efficient progressive computation, and requires no prior assumptions regarding the shape or nature of processes in the data. We discuss and demonstrate the performance and utility of our approach via a variety of data sets, comparison and combination with an alternative technique, and feedback by a domain scientist.
An Approximate Parallel Vectors Operator for Multiple Vector Fields
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Gerrits, Tim; Rössl, Christian; Theisel, Holger; Jeffrey Heer and Heike Leitte and Timo Ropinski
The Parallel Vectors (PV) Operator extracts the locations of points where two vector fields are parallel. In general, these features are line structures. The PV operator has been used successfully for a variety of problems, which include finding vortex-core lines or extremum lines. We present a new generic feature extraction method for multiple 3D vector fields: The Approximate Parallel Vectors (APV) Operator extracts lines where all fields are approximately parallel. The definition of the APV operator is based on the application of PV for two vector fields that are derived from the given set of fields. The APV operator enables the direct visualization of features of vector field ensembles without processing fields individually and without causing visual clutter. We give a theoretical analysis of the APV operator and demonstrate its utility for a number of ensemble data.
The Perception of Graph Properties in Graph Layouts
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Soni, Utkarsh; Lu, Yafeng; Hansen, Brett; Purchase, Helen C.; Kobourov, Stephen; Maciejewski, Ross; Jeffrey Heer and Heike Leitte and Timo Ropinski
When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms relate to a user's ability to perceive graph properties for a given graph layout. In this study, we apply previously established methodologies for perceptual analysis to identify which graph drawing layout will help the user best perceive a particular graph property. We conduct a large scale (n = 588) crowdsourced experiment to investigate whether the perception of two graph properties (graph density and average local clustering coefficient) can be modeled using Weber's law. We study three graph layout algorithms from three representative classes (Force Directed - FD, Circular, and Multi-Dimensional Scaling - MDS), and the results of this experiment establish the precision of judgment for these graph layouts and properties. Our findings demonstrate that the perception of graph density can be modeled with Weber's law. Furthermore, the perception of the average clustering coefficient can be modeled as an inverse of Weber's law, and the MDS layout showed a significantly different precision of judgment than the FD layout.
PixelSNE: Pixel-Aligned Stochastic Neighbor Embedding for Efficient 2D Visualization with Screen-Resolution Precision
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Kim, Minjeong; Choi, Minsuk; Lee, Sunwoong; Tang, Jian; Park, Haesun; Choo, Jaegul; Jeffrey Heer and Heike Leitte and Timo Ropinski
Embedding and visualizing large-scale high-dimensional data in a two-dimensional space is an important problem, because such visualization can reveal deep insights of complex data. However, most of the existing embedding approaches run on an excessively high precision, even when users want to obtain a brief insight from a visualization of large-scale datasets, ignoring the fact that in the end, the outputs are embedded onto a fixed-range pixel-based screen space. Motivated by this observation and directly considering the properties of screen space in an embedding algorithm, we propose Pixel-Aligned Stochastic Neighbor Embedding (PixelSNE), a highly efficient screen resolution-driven 2D embedding method which accelerates Barnes-Hut treebased t-distributed stochastic neighbor embedding (BH-SNE), which is known to be a state-of-the-art 2D embedding method. Our experimental results show a significantly faster running time for PixelSNE compared to BH-SNE for various datasets while maintaining comparable embedding quality.
Assessing Effects of Task and Data Distribution on the Effectiveness of Visual Encodings
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Kim, Younghoon; Heer, Jeffrey; Jeffrey Heer and Heike Leitte and Timo Ropinski
In addition to the choice of visual encodings, the effectiveness of a data visualization may vary with the analytical task being performed and the distribution of data values. To better assess these effects and create refined rankings of visual encodings, we conduct an experiment measuring subject performance across task types (e.g., comparing individual versus aggregate values) and data distributions (e.g., with varied cardinalities and entropies).We compare performance across 12 encoding specifications of trivariate data involving 1 categorical and 2 quantitative fields, including the use of x, y, color, size, and spatial subdivision (i.e., faceting). Our results extend existing models of encoding effectiveness and suggest improved approaches for automated design. For example, we find that colored scatterplots (with positionally-coded quantities and color-coded categories) perform well for comparing individual points, but perform poorly for summary tasks as the number of categories increases.
SetCoLa: High-Level Constraints for Graph Layout
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Hoffswell, Jane; Borning, Alan; Heer, Jeffrey; Jeffrey Heer and Heike Leitte and Timo Ropinski
Constraints enable flexible graph layout by combining the ease of automatic layout with customizations for a particular domain. However, constraint-based layout often requires many individual constraints defined over specific nodes and node pairs. In addition to the effort of writing and maintaining a large number of similar constraints, such constraints are specific to the particular graph and thus cannot generalize to other graphs in the same domain. To facilitate the specification of customized and generalizable constraint layouts, we contribute SetCoLa: a domain-specific language for specifying high-level constraints relative to properties of the backing data. Users identify node sets based on data or graph properties and apply high-level constraints within each set. Applying constraints to node sets rather than individual nodes reduces specification effort and facilitates reapplication of customized layouts across distinct graphs. We demonstrate the conciseness, generalizability, and expressiveness of SetCoLa on a series of real-world examples from ecological networks, biological systems, and social networks.
Cosine-Weighted B-Spline Interpolation on the Face-Centered Cubic Lattice
(The Eurographics Association and John Wiley & Sons Ltd., 2018) Rácz, Gergely Ferenc; Csébfalvi, Balázs; Jeffrey Heer and Heike Leitte and Timo Ropinski
Cosine-Weighted B-spline (CWB) interpolation [Csé13] has been originally proposed for volumetric data sampled on the Body-Centered Cubic (BCC) lattice. The BCC lattice is well known to be optimal for sampling isotropically band-limited signals above the Nyquist limit. However, the Face-Centered Cubic (FCC) lattice has been recently proven to be optimal for low-rate sampling. The CWB interpolation is a state-of-the-art technique on the BCC lattice, which outperforms, for example, the previously proposed box-spline interpolation in terms of both efficiency and visual quality. In this paper, we show that CWB interpolation can be adapted to the FCC lattice as well, and results in similarly isotropic signal reconstructions as on the BCC lattice.

Browse

Browsing EuroVis18: Eurographics Conference on Visualization by Issue Date

Results Per Page

Sort Options