bluuebunny/crossref_metadata_2025_split huggingface dataset:
Density Displays for Data Stream Monitoring
Authors: Hao Ming , Keim Daniel A. , Dayal Umeshwar , Oelke Daniela , Tremblay Chantal 
Published: September 2008

AbstractIn many business applications, large data workloads such as sales figures or process performance measures need to be monitored in real‐time. The data analysts want to catch problems in flight to reveal the root cause of anomalies. Immediate actions need to be taken before the problems become too expensive or consume too many resources. In the meantime, analysts need to have the “big picture” of what the information is about. In this paper, we derive and analyze two real‐time visualization techniques for managing density displays: (1) circular overlay d isplays which visualize large volumes of data without data shift movements after the display is full, thus freeing the analyst from adjusting the mental picture of the data after each data shift; and (2) variable resolution density displays which allow users to get the entire view without cluttering. We evaluate these techniques with respect to a number of evaluation measures, such as constancy of the display and usage of display space, and compare them to conventional d isplays with periodic shifts. Our real time data monitoring system also provides advanced interactions such as a local root cause analysis for further exploration. The applications using a number of real‐world data sets show the wide applicability and usefulness of our ideas.
Towards closing the analysis gap: Visual generation of decision supporting schemes from raw data
Authors: May T. , Kohlhammer J. 
Published: September 2008

AbstractThe derivation, manipulation and verification of analytical models from raw data is a process which requires a transformation of information across different levels of abstraction. We introduce a concept for the coupling of data classification and interactive visualization in order to make this transformation visible and steerable for the human user. Data classification techniques generate mappings that formally group data items into categories. Interactive visualization includes the user into an iterative refinement process. The user identifies and selects interesting patterns to define these categories. The following step is the transformation of a visible pattern into the formal definition of a classifier. In the last step the classifier is transformed back into a pattern that is blended with the original data in the same visual display. Our approach allows in intuitive assessment of a formal classifier and its model, the detection of outliers and the handling of noisy data using visual pattern‐matching. We instantiated the concept using decision trees for classification and KVMaps as the visualization technique. The generation of a classifier from visual patterns and its verification is transformed from a cognitive to a mostly pre‐cognitive task.
Investigative Visual Analysis of Global Terrorism
Authors: Wang Xiaoyu , Miller Erin , Smarick Kathleen , Ribarsky William , Chang Remco 
Published: September 2008

AbstractRecent increases in terrorist activity around the world have made analyzing and understanding such activities more critical than ever. With the help of organizations such as the National Center for the Study of Terrorism and Responses to Terrorism (START), we now have detailed historical information on each terrorist event around the world since 1970. However, due to the size and complexity of the data, identifying terrorists' patterns and trends has been difficult. To better enable investigators in understanding terrorist activities, we propose a visual analytical system that focuses on depicting one of the most fundamental concepts in investigative analysis, the five W's (who, what, where, when, and why). Views in our system are highly correlated, and each represents one of the W's. With this approach, an investigator can interactively explore terrorist activities efficiently and discover reasons of attacks (why) by identifying patterns temporally (when), geo‐spatially (where), between multiple terrorist groups (who), and across different methods or modes of attacks (what). By coupling a global perspective with the details gleaned from asking these five questions, the system allows analysts to think both tactically and strategically.
COPERNICUS: Context‐Preserving Engine for Route Navigation with Interactive User‐modifiable Scaling
Authors: Ziegler Hartmut , Keim Daniel A. 
Published: September 2008

AbstractIn this paper, we present an automated system for generating context‐preserving route maps that depict navigation routes as a path between nodes and edges inside a topographic network. Our application identifies relevant context information to support navigation and orientation, and generates customizable route maps according to design principles that communicate all relevant context information clearly visible on one single page. Interactive scaling allows seamless transition between the original undistorted map and our new map design, and supports user‐specified scaling of regions of interest to create personalized driving directions according to the drivers needs.
Sound Tracing: Rendering Listener Specific Acoustic Room Properties
Authors: Bellmann Jens , Michel Frank , Deines Eduard , Hering‐Bertram Martin , Mohring Jan , Hagen Hans 
Published: September 2008

AbstractWe present an acoustic rendering approach visualizing the listener‐specific contribution of frequency‐dependent pressure fields on a scene geometry with acoustic reflection and scattering properties. Our method facilitates the evaluation of simulated acoustics showing the effect of simulation parameters like absorption and scattering. The image‐based spatial localization of acoustic properties is complementary to the auditive evaluation by means of auralization. Our core contribution is a pressure‐based acoustic rendering equation and a corresponding raytracing method applying techniques from photorealistic rendering to the field of simulated room acoustics. Applications are directed at the visualization of interference patterns and analyzing the impact of acoustic reflection parameters.
From Web Data to Visualization via Ontology Mapping
Authors: Gilson O. , Silva N. , Grant P.W. , Chen M. 
Published: September 2008

AbstractIn this paper, we propose a novel approach for automatic generation of visualizations from domain‐specific data available on the web. We describe a general system pipeline that combines ontology mapping and probabilistic reasoning techniques. With this approach, a web page is first mapped to a Domain Ontology, which stores the semantics of a specific subject domain (e.g., music charts). The Domain Ontology is then mapped to one or more Visual Representation Ontologies, each of which captures the semantics of a visualization style (e.g., tree maps). To enable the mapping between these two ontologies, we establish a Semantic Bridging Ontology, which specifies the appropriateness of each semantic bridge. Finally each Visual Representation Ontology is mapped to a visualization using an external visualization toolkit. Using this approach, we have developed a prototype software tool, SemViz, as a realisation of this approach. By interfacing its Visual Representation Ontologies with public domain software such as ILOG Discovery and Prefuse, SemViz is able to generate appropriate visualizations automatically from a large collection of popular web pages for music charts without prior knowledge of these web pages.
Lagrangian Visualization of Flow‐Embedded Surface Structures
Authors: Garth Christoph , Wiebel Alexander , Tricoche Xavier , Joy Ken , Scheuermann Gerik 
Published: September 2008

AbstractThe notions of Finite‐Time Lyapunov Exponent (FTLE) and Lagrangian Coherent Structures provide a strong framework for the analysis and visualization of complex technical flows. Their definition is simple and intuitive, and they are built on a deep theoretical foundation. We apply these concepts to enable the analysis of flows in the immediate vicinity of the boundaries of flow‐embedded objects by limiting the Lagrangian analysis to surfaces closely neighboring these boundaries. To this purpose, we present an approach to approximate FTLE fields over such surfaces. Furthermore, we achieve an effective depiction of boundary‐related flow structures such as separation and attachment over object boundaries and specific insight into the surrounding flow using several specifically chosen visualization techniques. We document the applicability of our methods by presenting a number of application examples.
Discrete Multi‐Material Interface Reconstruction for Volume Fraction Data
Authors: Anderson J. C. , Garth C. , Duchaineau M. A. , Joy K. I. 
Published: September 2008

AbstractMaterial interface reconstruction (MIR) is the task of constructing boundary interfaces between regions of homogeneous material, while satisfying volume constraints, over a structured or unstructured spatial domain. In this paper, we present a discrete approach to MIR based upon optimizing the labeling of fractional volume elements within a discretization of the problem's original domain. We detail how to construct and initially label a discretization, and introduce avolume conservative swapmove for optimization. Furthermore, we discuss methods for extracting and visualizing material interfaces from the discretization. Our technique has significant advantages over previous methods: we produce interfaces between multiple materials that are continuous across cell boundaries for time‐varying and static data in arbitrary dimension with bounded error.
Topology‐Preserving λ2‐based Vortex Core Line Detection for Flow Visualization
Authors: Schafhitzel T. , Vollrath J. E. , Gois J. P. , Weiskopf D. , Castelo A. , Ertl T. 
Published: September 2008

AbstractWe propose a novel vortex core line extraction method based on the λ2vortex region criterion in order to improve the detection of vortex features for 3D flow visualization. The core line is defined as a curve that connects λ2minima restricted to planes that are perpendicular to the core line. The basic algorithm consists of the following stages: (1) λ2field construction and isosurface extraction; (2) computation of the curve skeleton of the λ2isosurface to build an initial prediction for the core line; (3) correction of the locations of the prediction by searching for λ2minima on planes perpendicular to the core line. In particular, we consider the topology of the vortex core lines, guaranteeing the same topology as the initial curve skeleton. Furthermore, we propose a geometry‐guided definition of vortex bifurcation, which represents the split of one core line into two parts. Finally, we introduce a user‐guided approach in order to narrow down vortical regions taking into account the graph of λ2along the computed vortex core line. We demonstrate the effectiveness of our method by comparing our results to previous core line detection methods with both simulated and experimental data; in particular, we show robustness of our method for noise‐affected data.
Illustrative Parallel Coordinates
Authors: McDonnell K. T. , Mueller K. 
Published: September 2008

AbstractIllustrative parallel coordinates (IPC) is a suite of artistic rendering techniques for augmenting and improving parallel coordinate (PC) visualizations. IPC techniques can be used to convey a large amount of information about a multidimensional dataset in a small area of the screen through the following approaches: (a) edge‐bundling through splines; (b) visualization of “branched ” clusters to reveal the distribution of the data; (c) opacity‐based hints to show cluster density; (d) opacity and shading effects to illustrate local line density on the parallel axes; and (e) silhouettes, shadows and halos to help the eye distinguish between overlapping clusters. Thus, the primary goal of this work is to convey as much information as possible in a manner that is aesthetically pleasing and easy to understand for non‐experts.
Abstractive Representation and Exploration of Hierarchically Clustered Diffusion Tensor Fiber Tracts
Authors: Chen Weri , Zhang Song , Correia Stephfan , Ebert David S. 
Published: September 2008

AbstractDiffusion tensor imaging (DTI) has been used to generate fibrous structures in both brain white matter and muscles. Fiber clustering groups the DTI fibers into spatially and anatomically related tracts. As an increasing number of fiber clustering methods have been recently developed, it is important to display, compare, and explore the clustering results efficiently and effectively. In this paper, we present an anatomical visualization technique that reduces the geometric complexity of the fiber tracts and emphasizes the high‐level structures. Beginning with a volumetric diffusion tensor image, we first construct a hierarchical clustering representation of the fiber bundles. These bundles are then reformulated into a 3D multi‐valued volume data. We then build a set of geometric hulls and principal fibers to approximate the shape and orientation of each fiber bundle. By simultaneously visualizing the geometric hulls, individual fibers, and other data sets such as fractional anisotropy, the overall shape of the fiber tracts are highlighted, while preserving the fibrous details. A rater with expert knowledge of white matter structure has evaluated the resulting interactive illustration and confirmed the improvement over straightforward DTI fiber tract visualization.
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Authors: Attene Marco , Mortara Michela , Spagnuolo Michela , Falcidieno Bianca 
Published: September 2008

AbstractGiven a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be browsed at interactive speed on a modern PC and it is useful for implementing an intuitive feature selection paradigm for 3D editing environments. Convex parts often coincide with perceptually relevant shape components and, for their identification, existing methods rely on the boundary surface only. In contrast, we show that the notion of part concavity can be expressed and implemented more intuitively and efficiently by exploiting a tetrahedrization of the shape volume. The method proposed is completely automatic, and generates a tree of convex polyhedra in which the root is the convex hull of the whole shape, and the leaves are the tetrahedra of the input mesh. The algorithm proceeds bottom‐up by hierarchically clustering tetrahedra into nearly convex aggregations, and the whole process is significantly fast. We prove that, in the average case, for a mesh of n tetrahedra O(n log2n) operations are sufficient to compute the whole tree.
Discrete Distortion in Triangulated 3‐Manifolds
Authors: Mesmoudi Mohammed Mostefa , De Floriani Leila , Port Umberto 
Published: September 2008

AbstractWe introduce a novel notion, that we call discrete distortion, for a triangulated 3‐manifold. Discrete distortion naturally generalizes the notion of concentrated curvature defined for triangulated surfaces and provides a powerful tool to understand the local geometry and topology of 3‐manifolds. Discrete distortion can be viewed as a discrete approach to Ricci curvature for singular flat manifolds. We distinguish between two kinds of distortion, namely, vertex distortion, which is associated with the vertices of the tetrahedral mesh decomposing the 3‐manifold, and bond distortion, which is associated with the edges of the tetrahedral mesh. We investigate properties of vertex and bond distortions. As an example, we visualize vertex distortion on manifold hypersurfaces in R4defined by a scalar field on a 3D mesh. distance fields.
Global Intrinsic Symmetries of Shapes
Authors: Ovsjanikov Maks , Sun Jian , Guibas Leonidas 
Published: September 2008

AbstractAlthough considerable attention in recent years has been given to the problem of symmetry detection in general shapes, few methods have been developed that aim to detect and quantify the intrinsic symmetry of a shape rather than its extrinsic, or pose‐dependent symmetry. In this paper, we present a novel approach for efficiently computing symmetries of a shape which are invariant up to isometry preserving transformations. We show that the intrinsic symmetries of a shape are transformed into the Euclidean symmetries in the signature space defined by the eigenfunctions of the Laplace‐Beltrami operator. Based on this observation, we devise an algorithm which detects and computes the isometric mappings from the shape onto itself. We show that our approach is both computationally efficient and robust with respect to small non‐isometric deformations, even if they include topological changes.
A Hierarchical Segmentation of Articulated Bodies
Authors: De Goes Fernando , Goldenstein Siome , Velho Luiz 
Published: September 2008

AbstractThis paper presents a novel segmentation method to assist the rigging of articulated bodies. The method computes a coarse‐to‐fine hierarchy of segments ordered by the level of detail. The results are invariant to deformations, and numerically robust to noise, irregular tessellations, and topological short‐circuits. The segmentation is based on two key ideas. First, it exploits the multiscale properties of the diffusion distance on surfaces, and then it introduces a new definition of medial structures, composing a bijection between medial structures and segments. Our method computes this bijection through a simple and fast iterative approach, and applies it to triangulated meshes.
Fast Parallel Construction of Smooth Surfaces from Meshes with Tri/Quad/Pent Facets
Authors: Myles A. , Ni T. , Peters J. 
Published: September 2008

AbstractPolyhedral meshes consisting of triangles, quads, and pentagons and polar configurations cover all major sampling and modeling scenarios. We give an algorithm for efficient local, parallel conversion of such meshes to an everywhere smooth surface consisting of low‐degree polynomial pieces. Quadrilateral facets with 4‐valent vertices are ‘regular’ and are mapped to bi‐cubic patches so that adjacent bi‐cubics join C2 as for cubic tensor‐product splines. The algorithm can be implemented in the vertex and geometry shaders of the GPU pipeline and does not use the fragment shader. Its implementation in DirectX 10 achieves conversion plus rendering at 659 frames per second with 42.5 million triangles per second on input of a model of 1300 facets of which 60% are not regular.
Global Correspondence Optimization for Non‐Rigid Registration of Depth Scans
Authors: Li Hao , Sumner Robert W. , Pauly Mark 
Published: September 2008

AbstractWe present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non‐rigid registration within a single non‐linear optimization. Our algorithm simultaneously solves for correspondences between points on source and target scans, confidence weights that measure the reliability of each correspondence and identify non‐overlapping areas, and a warping field that brings the source scan into alignment with the target geometry. The optimization maximizes the region of overlap and the spatial coherence of the deformation while minimizing registration error. All optimization parameters are chosen automatically; hand‐tuning is not necessary. Our method is not restricted to part‐in‐whole matching, but addresses the general problem of partial matching, and requires no explicit prior correspondences or feature points. We evaluate the performance and robustness of our method using scan data acquired by a structured light scanner and compare our method with existing non‐rigid registration algorithms.
Non‐Rigid Registration Under Isometric Deformations
Authors: Huang Qi‐Xing , Adams Bart , Wicke Martin , Guibas Leonidas J. 
Published: September 2008

AbstractWe present a robust and efficient algorithm for the pairwise non‐rigid registration of partially overlapping 3D surfaces. Our approach treats non‐rigid registration as an optimization problem and solves it by alternating between correspondence and deformation optimization. Assuming approximately isometric deformations, robust correspondences are generated using a pruning mechanism based on geodesic consistency. We iteratively learn an appropriate deformation discretization from the current set of correspondences and use it to update the correspondences in the next iteration. Our algorithm is able to register partially similar point clouds that undergo large deformations, in just a few seconds. We demonstrate the potential of our algorithm in various applications such as example based articulated segmentation, and shape interpolation.
Reconstructing Animated Meshes from Time‐Varying Point Clouds
Authors: Süßmuth Jochen , Winter Marco , Greiner Günther 
Published: September 2008

AbstractIn this paper, we describe a novel approach for the reconstruction of animated meshes from a series of time‐deforming point clouds. Given a set of unordered point clouds that have been captured by a fast 3‐D scanner, our algorithm is able to compute coherent meshes which approximate the input data at arbitrary time instances. Our method is based on the computation of an implicit function in ℝ4 that approximates the time‐space surface of the time‐varying point cloud. We then use the four‐dimensional implicit function to reconstruct a polygonal model for the first time‐step. By sliding this template mesh along the time‐space surface in an as‐rigid‐as‐possible manner, we obtain reconstructions for further time‐steps which have the same connectivity as the previously extracted mesh while recovering rigid motion exactly.The resulting animated meshes allow accurate motion tracking of arbitrary points and are well suited for animation compression. We demonstrate the qualities of the proposed method by applying it to several data sets acquired by real‐time 3‐D scanners.
Motorcycle Graphs: Canonical Quad Mesh Partitioning
Authors: Eppstein David , Goodrich Michael T. , Kim Ethan , Tamstorf Rasmus 
Published: September 2008

AbstractWe describe algorithms for canonically partitioning semi‐regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein and Erickson to quad meshes. Our partitions may be used to efficiently find isomorphisms between quad meshes. In addition, they may be used as a highly compressed representation of the original mesh. These partitions can be constructed in sublinear time from a list of the extraordinary vertices in a mesh. We also study the problem of further reducing the number of submeshes in our partitions—we prove that optimizing this number is NP‐hard, but it can be efficiently approximated.
Maximum Entropy Coordinates for Arbitrary Polytopes
Authors: Hormann K. , Sukumar N. 
Published: September 2008

AbstractBarycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to linearly interpolate data that is given at the vertices of a triangle. In recent years, the ideas of barycentric coordinates and barycentric interpolation have been extended to arbitrary polygons in the plane and general polytopes in higher dimensions, which in turn has led to novel solutions in applications like mesh parameterization, image warping, and mesh deformation. In this paper we introduce a new generalization of barycentric coordinates that stems from the maximum entropy principle. The coordinates are guaranteed to be positive inside any planar polygon, can be evaluated efficiently by solving a convex optimization problem with Newton's method, and experimental evidence indicates that they are smooth inside the domain. Moreover, the construction of these coordinates can be extended to arbitrary polyhedra and higher‐dimensional polytopes.