30-Issue 3

Permanent URI for this collection

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

Browse

Now showing 1 - 20 of 54

Efficient Parallel Vectors Feature Extraction from Higher-Order Data
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Pagot, Christian; Osmari, D.; Sadlo, F.; Weiskopf, Daniel; Ertl, Thomas; Comba, J.; H. Hauser, H. Pfister, and J. J. van Wijk
The parallel vectors (PV) operator is a feature extraction approach for defining line-type features such as creases (ridges and valleys) in scalar fields, as well as separation, attachment, and vortex core lines in vector fields. In this work, we extend PV feature extraction to higher-order data represented by piecewise analytical functions defined over grid cells. The extraction uses PV in two distinct stages. First, seed points on the feature lines are placed by evaluating the inclusion form of the PV criterion with reduced affine arithmetic. Second, a feature flow field is derived from the higher-order PV expression where the features can be extracted as streamlines starting at the seeds. Our approach allows for guaranteed bounds regarding accuracy with respect to existence, position, and topology of the features obtained. The method is suitable for parallel implementation and we present results obtained with our GPU-based prototype. We apply our method to higher-order data obtained from discontinuous Galerkin fluid simulations.
Comparison of Multiple Weighted Hierarchies: Visual Analytics for Microbe Community Profiling
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Dinkla, Kasper; Westenberg, M. A.; Timmerman, H. M.; Hijum, S.A.F.T. van; Wijk, J. J. van; H. Hauser, H. Pfister, and J. J. van Wijk
We propose visual analytics techniques to support concurrent comparison of hundreds of cumulatively weighted instances of a single hierarchy. This includes a node-link representation of the hierarchy where nodes depict the weights of all instances with high-density heat maps that are grouped and aligned to ease cross-referencing. Hierarchy exploration is facilitated by smoothly animated expansion and collapse of its branches. Detailed infor- mation about hierarchy structure, weights, and meta-data is provided by secondary linked visualizations. These techniques have been implemented in a prototype tool, in which the computational analysis concerns have been strictly separated from the visualization concerns. The analysis algorithms are extensible via a script engine. We discuss the effectiveness of our techniques for the visual analytic process of microbe community profiling experts.
WaveMap: Interactively Discovering Features From Protein Flexibility Matrices Using Wavelet-based Visual Analytics
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Barlowe, Scott; Liu, Yujie; Yang, Jing; Livesay, Dennis R.; Jacobs, Donald J.; Mottonen, James; Verma, Deeptak; H. Hauser, H. Pfister, and J. J. van Wijk
The knowledge gained from biology datasets can streamline and speed-up pharmaceutical development. However, computational models generate so much information regarding protein behavior that large-scale analysis by traditional methods is almost impossible. The volume of data produced makes the transition from data to knowledge difficult and hinders biomedical advances. In this work, we present a novel visual analytics approach named WaveMap for exploring data generated by a protein flexibility model. WaveMap integrates wavelet analysis, visualizations, and interactions to facilitate the browsing, feature identification, and comparison of protein attributes represented by two-dimensional plots. We have implemented a fully working prototype of WaveMap and illustrate its usefulness through expert evaluation and an example scenario.
Perceptual Evaluation of Ghosted View Techniques for the Exploration of Vascular Structures and Embedded Flow
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Baer, Alexandra; Gasteiger, Rocco; Cunningham, Douglas; Preim, Bernhard; H. Hauser, H. Pfister, and J. J. van Wijk
This paper presents three controlled perceptual studies investigating the visualization of the cerebral aneurysm anatomy with embedded flow visualization. We evaluate and compare the common semitransparent visualization technique with a ghosted view and a ghosted view with depth enhancement technique. We analyze the techniques' ability to facilitate and support the shape and spatial representation of the aneurysm models as well as evaluating the smart visibility characteristics. The techniques are evaluated with respect to the participants accuracy, response time and their personal preferences. We used as stimuli 3D aneurysm models of five clinical datasets. There was overwhelming preference for the two ghosted view techniques over the semitransparent technique. Since smart visibility techniques are rarely evaluated, this paper may serve as orientation for further studies.
Visualizing the Evolution of Community Structures in Dynamic Social Networks
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Reda, Khairi; Tantipathananandh, Chayant; Johnson, Andrew; Leigh, Jason; Berger-Wolf, Tanya; H. Hauser, H. Pfister, and J. J. van Wijk
Social network analysis is the study of patterns of interaction between social entities. The field is attracting increasing attention from diverse disciplines including sociology, epidemiology, and behavioral ecology. An important sociological phenomenon that draws the attention of analysts is the emergence of communities, which tend to form, evolve, and dissolve gradually over a period of time. Understanding this evolution is crucial to sociologists and domain scientists, and often leads to a better appreciation of the social system under study. Therefore, it is imperative that social network visualization tools support this task. While graph-based representations are well suited for investigating structural properties of networks at a single point in time, they appear to be significantly less useful when used to analyze gradual structural changes over a period of time. In this paper, we present an interactive visualization methodology for dynamic social networks. Our technique focuses on revealing the community structure implied by the evolving interaction patterns between individuals. We apply our visualization to analyze the community structure in the US House of Representatives. We also report on a user study conducted with the participation of behavioral ecologists working with social network datasets that depict interactions between wild animals. Findings from the user study confirm that the visualization was helpful in providing answers to sociological questions as well as eliciting new observations on the social organization of the population under study.
Flowstrates: An Approach for Visual Exploration of Temporal Origin-Destination Data
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Boyandin, Ilya; Bertini, Enrico; Bak, Peter; Lalanne, Denis; H. Hauser, H. Pfister, and J. J. van Wijk
Many origin-destination datasets have become available in the recent years, e.g. flows of people, animals, money, material, or network traffic between pairs of locations, but appropriate techniques for their exploration still have to be developed. Especially, supporting the analysis of datasets with a temporal dimension remains a significant challenge. Many techniques for the exploration of spatio-temporal data have been developed, but they prove to be only of limited use when applied to temporal origin-destination datasets.We present Flowstrates, a new interactive visualization approach in which the origins and the destinations of the flows are displayed in two separate maps, and the changes over time of the flow magnitudes are represented in a separate heatmap view in the middle. This allows the users to perform spatial visual queries, focusing on different regions of interest for the origins and destinations, and to analyze the changes over time provided with the means of flow ordering, filtering and aggregation in the heatmap. In this paper, we discuss the challenges associated with the visualization of temporal origin-destination data, introduce our solution, and present several usage scenarios showing how the tool we have developed supports them.
Stable Morse Decompositions for Piecewise Constant Vector Fields on Surfaces
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Szymczak, Andrzej; H. Hauser, H. Pfister, and J. J. van Wijk
Numerical simulations and experimental observations are inherently imprecise. Therefore, most vector fields of interest in scientific visualization are known only up to an error. In such cases, some topological features, especially those not stable enough, may be artifacts of the imprecision of the input. This paper introduces a technique to compute topological features of user-prescribed stability with respect to perturbation of the input vector field. In order to make our approach simple and efficient, we develop our algorithms for the case of piecewise constant (PC) vector fields. Our approach is based on a super-transition graph, a common graph representation of all PC vector fields whose vector value in a mesh triangle is contained in a convex set of vectors associated with that triangle. The graph is used to compute a Morse decomposition that is coarse enough to be correct for all vector fields satisfying the constraint. Apart from computing stable Morse decompositions, our technique can also be used to estimate the stability of Morse sets with respect to perturbation of the vector field or to compute topological features of continuous vector fields using the PC framework.
Visualizing High-Dimensional Structures by Dimension Ordering and Filtering using Subspace Analysis
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Ferdosi, Bilkis J.; H. Hauser, H. Pfister, and J. J. van Wijk
High-dimensional data visualization is receiving increasing interest because of the growing abundance of highdimensional datasets. To understand such datasets, visualization of the structures present in the data, such as clusters, can be an invaluable tool. Structures may be present in the full high-dimensional space, as well as in its subspaces. Two widely used methods to visualize high-dimensional data are the scatter plot matrix (SPM) and the parallel coordinate plot (PCP). SPM allows a quick overview of the structures present in pairwise combinations of dimensions. On the other hand, PCP has the potential to visualize not only bi-dimensional structures but also higher dimensional ones. A problem with SPM is that it suffers from crowding and clutter which makes interpretation hard. Approaches to reduce clutter are available in the literature, based on changing the order of the dimensions. However, usually this reordering has a high computational complexity. For effective visualization of high-dimensional structures, also PCP requires a proper ordering of the dimensions. In this paper, we propose methods for reordering dimensions in PCP in such a way that high-dimensional structures (if present) become easier to perceive. We also present a method for dimension reordering in SPM which yields results that are comparable to those of existing approaches, but at a much lower computational cost. Our approach is based on finding relevant subspaces for clustering using a quality criterion and cluster information. The quality computation and cluster detection are done in image space, using connected morphological operators. We demonstrate the potential of our approach for synthetic and astronomical datasets, and show that our method compares favorably with a number of existing approaches.
Probabilistic Marching Cubes
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Pöthkow, Kai; Weber, Britta; Hege, Hans-Christian; H. Hauser, H. Pfister, and J. J. van Wijk
In this paper we revisit the computation and visualization of equivalents to isocontours in uncertain scalar fields. We model uncertainty by discrete random fields and, in contrast to previous methods, also take arbitrary spatial correlations into account. Starting with joint distributions of the random variables associated to the sample locations, we compute level crossing probabilities for cells of the sample grid. This corresponds to computing the probabilities that the well-known symmetry-reduced marching cubes cases occur in random field realizations. For Gaussian random fields, only marginal density functions that correspond to the vertices of the considered cell need to be integrated. We compute the integrals for each cell in the sample grid using a Monte Carlo method. The probabilistic ansatz does not suffer from degenerate cases that usually require case distinctions and solutions of ill-conditioned problems. Applications in 2D and 3D, both to synthetic and real data from ensemble simulations in climate research, illustrate the influence of spatial correlations on the spatial distribution of uncertain isocontours.
ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Simonetto, Paolo; Archambault, Daniel; Auber, David; Bourqui, Romain; H. Hauser, H. Pfister, and J. J. van Wijk
PrEd [Ber00] is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler-like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, PrEd can be computationally expensive and overlyrestrictive in terms of node movement. In this paper, we introduce ImPrEd: an improved version of PrEd that overcomes some of its limitations and widens its range of applicability. ImPrEd also adds features such as flexible or crossable edges, allowing for greater control over the output. Flexible edges, in particular, can improve the distribution of graph elements and the angular resolution of the input graph. They can also be used to generate Euler diagrams with smooth boundaries. As flexible edges increase data set size, we experience an execution/drawing quality trade off. However, when flexible edges are not used, ImPrEd proves to be consistently faster than PrEd.
Lagrangian Coherent Structures with Guaranteed Material Separation
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Germer, Tobias; Otto, Mathias; Peikert, R.; Theisel, H.; H. Hauser, H. Pfister, and J. J. van Wijk
Given an unsteady flow field, one common way to compute Lagrangian Coherent Structures (LCS) is to extract extremal structures of the Finite Time Lyapunov Exponent (FTLE). Experience has shown that the resulting structures are often close to material structures (i.e., material lines or material surfaces). Moreover, it has been proven that for an integration time converging to infinity, they converge to exact material structures. However, due to the finite integration time in FTLE, they are generally not exact material structures. In this paper we introduce a modification of the FTLE method which is guaranteed to produce separating material structures as features of a scalar field. We achieve this by incorporating the complete available integration time both in forward and backward direction, and by choosing an appropriate definition for separating structures. We apply our method to two test data sets and show the differences to classical FTLE.
Automatic Registration of Multi-Projector Domes Using a Single Uncalibrated Camera
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Sajadi, Behzad; Majumder, Aditi; H. Hauser, H. Pfister, and J. J. van Wijk
In this paper we present a novel technique for easily calibrating multiple casually aligned projectors on spherical domes using a single uncalibrated camera. Using the prior knowledge of the display surface being a dome, we can estimate the camera intrinsic and extrinsic parameters and the projector to display surface correspondences automatically using a set of images. These images include the image of the dome itself and a projected pattern from each projector. Using these correspondences we can register images from the multiple projectors on the dome. Further, we can register displays which are not entirely visible in a single camera view using multiple pan and tilted views of an uncalibrated camera making our method suitable for displays of different size and resolution. We can register images from any arbitrary viewpoint making it appropriate for a single head-tracked user in a 3D visualization system. Also, we can use several cartographic mapping techniques to register images in a manner that is appropriate for multi-user visualization. Domes are known to produce a tremendous sense of immersion and presence in visualization systems. Yet, till date, there exists no easy way to register multiple projectors on a dome to create a high-resolution realistic visualizations. To the best of our knowledge, this is the first method that can achieve accurate geometric registration of multiple projectors on a dome simply and automatically using a single uncalibrated camera.
A User Study of Visualization Effectiveness Using EEG and Cognitive Load
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Anderson, Erik W.; Potter, K. C.; Matzen, L. E.; Shepherd, J. F.; Preston, G. A.; Silva, C. T.; H. Hauser, H. Pfister, and J. J. van Wijk
Effectively evaluating visualization techniques is a difficult task often assessed through feedback from user studies and expert evaluations. This work presents an alternative approach to visualization evaluation in which brain activity is passively recorded using electroencephalography (EEG). These measurements are used to compare different visualization techniques in terms of the burden they place on a viewer's cognitive resources. In this paper, EEG signals and response times are recorded while users interpret different representations of data distributions. This information is processed to provide insight into the cognitive load imposed on the viewer. This paper describes the design of the user study performed, the extraction of cognitive load measures from EEG data, and how those measures are used to quantitatively evaluate the effectiveness of visualizations.
A Framework for Exploring Multidimensional Data with 3D Projections
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Poco, Jorge; Etemadpour, Ronak; Paulovich, F. V.; Long, T. V.; Rosenthal, P.; Oliveira, M. C. F.; Linsen, Lars; Minghim, R.; H. Hauser, H. Pfister, and J. J. van Wijk
Visualization of high-dimensional data requires a mapping to a visual space. Whenever the goal is to preserve similarity relations a frequent strategy is to use 2D projections, which afford intuitive interactive exploration, e.g., by users locating and selecting groups and gradually drilling down to individual objects. In this paper, we propose a framework for projecting high-dimensional data to 3D visual spaces, based on a generalization of the Least- Square Projection (LSP). We compare projections to 2D and 3D visual spaces both quantitatively and through a user study considering certain exploration tasks. The quantitative analysis confirms that 3D projections outperform 2D projections in terms of precision. The user study indicates that certain tasks can be more reliably and confidently answered with 3D projections. Nonetheless, as 3D projections are displayed on 2D screens, interaction is more difficult. Therefore, we incorporate suitable interaction functionalities into a framework that supports 3D transformations, predefined optimal 2D views, coordinated 2D and 3D views, and hierarchical 3D cluster definition and exploration. For visually encoding data clusters in a 3D setup, we employ color coding of projected data points as well as four types of surface renderings. A second user study evaluates the suitability of these visual encodings. Several examples illustrate the framework's applicability for both visual exploration of multidimensional abstract (non-spatial) data as well as the feature space of multi-variate spatial data.
Illustrative Molecular Visualization with Continuous Abstraction
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Zwan, Matthew van der; Lueks, Wouter; Bekker, Henk; Isenberg, Tobias; H. Hauser, H. Pfister, and J. J. van Wijk
Molecular systems may be visualized with various degrees of structural abstraction, support of spatial perception, and 'illustrativeness.' In this work we propose and realize methods to create seamless transformations that allow us to affect and change each of these three parameters individually. The resulting transitions give viewers a dedicated control of abstraction in illustrative molecular visualization and, consequently, allow them to seamlessly explore the resulting abstraction space for obtaining a fundamental understanding of molecular systems.We show example visualizations created with our approach and report informal feedback on our technique from domain experts.
Visual Boosting in Pixel-based Visualizations
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Oelke, Daniela; Janetzko, Halldor; Simon, Svenja; Neuhaus, Klaus; Keim, Daniel A.; H. Hauser, H. Pfister, and J. J. van Wijk
Pixel-based visualizations have become popular, because they are capable of displaying large amounts of data and at the same time provide many details. However, pixel-based visualizations are only effective if the data set is not sparse and the data distribution not random. Single pixels - no matter if they are in an empty area or in the middle of a large area of differently colored pixels - are perceptually difficult to discern and may therefore easily be missed. Furthermore, trends and interesting passages may be camouflaged in the sea of details. In this paper we compare different approaches for visual boosting in pixel-based visualizations. Several boosting techniques such as halos, background coloring, distortion, and hatching are discussed and assessed with respect to their effectiveness in boosting single pixels, trends, and interesting passages. Application examples from three different domains (document analysis, genome analysis, and geospatial analysis) show the general applicability of the techniques and the derived guidelines.
Interactive Exploration of Protein Cavities
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Krone, M.; Falk, M.; Rehm, S.; Pleiss, J.; Ertl, T.; H. Hauser, H. Pfister, and J. J. van Wijk
We present a novel application for the interactive exploration of cavities within proteins in dynamic data sets. Inside a protein, cavities can often be found close to the active center. Therefore, when analyzing a molecular dynamics simulation trajectory it is of great interest to find these cavities and determine if such a cavity opens up to the environment, making the binding site accessible to the surrounding substrate. Our user-driven approach enables expert users to select a certain cavity and track its evolution over time. The user is supported by different visualizations of the extracted cavity to facilitate the analysis. The boundary of the protein and its cavities is obtained by means of volume ray casting, where the volume is computed in real-time for each frame, therefore allowing the examination of time-dependent data sets. A fast, partial segmentation of the volume is applied to obtain the selected cavity and trace it over time. Domain experts found our method useful when they applied it exemplarily on two trajectories of lipases from Rhizomucor miehei and Candida antarctica. In both data sets cavities near the active center were easily identified and tracked over time until they reached the surface and formed an open substrate channel.
PaperVis: Literature Review Made Easy
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Chou, Jia -Kai; Yang, C. -K.; H. Hauser, H. Pfister, and J. J. van Wijk
Reviewing literatures for a certain research field is always important for academics. One could use Google-like information seeking tools, but oftentimes he/she would end up obtaining too many possibly related papers, as well as the papers in the associated citation network. During such a process, a user may easily get lost after following a few links for searching or cross-referencing. It is also difficult for the user to identify relevant/important papers from the resulting huge collection of papers. Our work, called PaperVis, endeavors to provide a user-friendly interface to help users quickly grasp the intrinsic complex citation-reference structures among a specific group of papers. We modify the existing Radial Space Filling (RSF) and Bullseye View techniques to arrange involved papers as a node-link graph that better depicts the relationships among them while saving the screen space at the same time. PaperVis applies visual cues to present node attributes and their transitions among interactions, and it categorizes papers into semantically meaningful hierarchies to facilitate ensuing literature exploration. We conduct experiments on the InfoVis 2004 Contest Dataset to demonstrate the effectiveness of PaperVis.
Evaluation of the Visibility of Vessel Movement Features in Trajectory Visualizations
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Willems, Niels; Wetering, Huub van de; Wijk, Jarke J. van; H. Hauser, H. Pfister, and J. J. van Wijk
There are many visualizations that show the trajectory of a moving object to obtain insights in its behavior. In this user study, we test the performance of three of these visualizations with respect to three movement features that occur in vessel behavior. Our goal is to compare the recently presented vessel density by Willems et al. [WvdWvW09] with well-known trajectory visualizations such as an animation of moving dots and the space-time cube. We test these visualizations with common maritime analysis tasks by investigating the ability of users to find stopping objects, fast moving objects, and estimate the busiest routes in vessel trajectories. We test the robustness of the visualizations towards scalability and the influence of complex trajectories using small-scale synthetic data sets. The performance is measured in terms of correctness and response time. The user test shows that each visualization type excels for correctness for a specific movement feature. Vessel density performs best for finding stopping objects, but does not perform significantly less than the remaining visualizations for the other features. Therefore, vessel density is a nice extension in the toolkit for analyzing trajectories of moving objects, in particular for vessel movements, since stops can be visualized better, and the performance for comparing lanes and finding fast movers is at a similar level as established trajectory visualizations.
Visual Exploration of Time-Series Data with Shape Space Projections
(The Eurographics Association and Blackwell Publishing Ltd., 2011) Ward, Matthew O.; Guo, Zhenyu; H. Hauser, H. Pfister, and J. J. van Wijk
Time-series data is a common target for visual analytics, as they appear in a wide range of application domains. Typical tasks in analyzing time-series data include identifying cyclic behavior, outliers, trends, and periods of time that share distinctive shape characteristics. Many methods for visualizing time series data exist, generally mapping the data values to positions or colors. While each can be used to perform a subset of the above tasks, none to date is a complete solution. In this paper we present a novel approach to time-series data visualization, namely creating multivariate data records out of short subsequences of the data and then using multivariate visualization methods to display and explore the data in the resulting shape space. We borrow ideas from text analysis, where the use of N-grams is a common approach to decomposing and processing unstructured text. By mapping each temporal N-gram to a glyph, and then positioning the glyphs via PCA (basically a projection in shape space), many different kinds of patterns in the sequence can be readily identified. Interactive selection via brushing, in conjunction with linking to other visualizations, provides a wide range of tools for exploring the data. We validate the usefulness of this approach with examples from several application domains and tasks, comparing our methods with traditional time-series visualizations.

Browse

Browsing 30-Issue 3 by Issue Date

Results Per Page

Sort Options