bluuebunny/crossref_metadata_2025_split huggingface dataset:
Computing Local Signed Distance Fields for Large Polygonal Models
Authors: Chang B. , Cha D. , Ihm I. 
Published: September 2008

AbstractThe signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is more effective to build a local distance field only within a narrow band around the surface that holds local geometric information for the model. In this paper, we present a novel technique to construct a volumetric local signed distance field of a polygonal model. To compute the local field efficiently, exactly those cells that cross the polygonal surface are found first through a new voxelization method, building a list of intersecting triangles for each boundary cell. After their neighboring cells are classified, the triangle lists are exploited to compute the local signed distance field with minimized voxel‐to‐triangle distance computations. While several efficient methods for computing the distance field, particularly those harnessing the graphics processing unit's (GPU's) processing power, have recently been proposed, we focus on a CPU‐based technique, intended to deal flexibly with large polygonal models and high‐resolution grids that are often too bulky for GPU computation.
Interactive Visualization for Memory Reference Traces
Authors: Choudhury A. N. M. Imroz , Potter Kristin C. , Parker Steven G. 
Published: September 2008

AbstractWe present the Memory Trace Visualizer (MTV), a tool that provides interactive visualization and analysis of the sequence of memory operations performed by a program as it runs. As improvements in processor performance continue to outpace improvements in memory performance, tools to understand memory access patterns are increasingly important for optimizing data intensive programs such as those found in scientific computing. Using visual representations of abstract data structures, a simulated cache, and animating memory operations, MTV can expose memory performance bottlenecks and guide programmers toward memory system optimization opportunities. Visualization of detailed memory operations provides a powerful and intuitive way to expose patterns and discover bottlenecks, and is an important addition to existing statistical performance measurements.
Exploratory Visualization of Animal Kinematics Using Instantaneous Helical Axes
Authors: Keefe D. F. , O'Brien T. M. , Baier D. B. , Gatesy S. M. , Brainerd E. L. , Laidlaw D. H. 
Published: September 2008

AbstractWe present novel visual and interactive techniques for exploratory visualization of animal kinematics using instantaneous helical axes (IHAs). The helical axis has been used in orthopedics, biomechanics, and structural mechanics as a construct for describing rigid body motion. Within biomechanics, recent imaging advances have made possible accurate high‐speed measurements of individual bone positions and orientations during experiments. From this high‐speed data, instantaneous helical axes of motion may be calculated. We address questions of effective interactive, exploratory visualization of this high‐speed 3D motion data. A 3D glyph that encodes all parameters of the IHA in visual form is presented. Interactive controls are used to examine the change in the IHA over time and relate the IHA to anatomical features of interest selected by a user. The techniques developed are applied to a stereoscopic, interactive visualization of the mechanics of pig mastication and assessed by a team of evolutionary biologists who found interactive IHA‐based analysis a useful addition to more traditional motion analysis techniques.
Geometry‐driven Visualization of Microscopic Structures in Biology
Authors: Mosaliganti Kishore , Machiraju Raghu , Huang Kun , Leone Gustavo 
Published: September 2008

AbstractAt a microscopic resolution, biological structures are composed of cells, red blood corpuscles (RBCs), cytoplasm and other microstructural components. There is a natural pattern in terms of distribution, arrangement and packing density of these components in biological organization. In this work, we propose to use N‐point correlation functions to guide the analysis and exploration process in microscopic datasets. These functions provide useful feature spaces to aid segmentation and visualization tasks. We show3D visualizations of mouse placenta tissue layers and mouse mammary ducts as well as2D segmentation/tracking of clonal populations. Further confidence in our results stems from validation studies that were performed with manual ground‐truth for segmentation.
Classification and Uncertainty Visualization of Dendritic Spines from Optical Microscopy Imaging
Authors: Janoos Firdaus , Nouansengsy Boonthanome , Xu Xiaoyin , Machiraju Raghu , Wong Stephen T.C. 
Published: September 2008

AbstractNeuronal dendrites and their spines affect the connectivity of neural networks, and play a significant role in many neurological conditions. Neuronal function is observed to be closely correlated with the appearance, disappearance and morphology of the spines. Automatic 3‐D reconstruction of neurons from light microscopy images, followed by the identification, classification and visualization of dendritic spines is therefore essential for studying neuronal physiology and biophysical properties. In this paper, we present a method to reconstruct dendrites using a surface representation of the dendrite. The 1‐D skeleton of the dendritic surface is then extracted by a medial geodesic function that is robust and topologically correct. This is followed by a Bayesian identification and classification of the spines. The dendrite and spines are visualized in a manner that displays the spines' types and the inherent uncertainty in identification and classification. We also describe a user study conducted to validate the accuracy of the classification and the efficacy of the visualization.
Visual Analysis and Semantic Exploration of Urban LIDAR Change Detection
Authors: Butkiewicz Thomas , Chang Remco , Wartell Zachary , Ribarsky William 
Published: September 2008

AbstractMany previous approaches to detecting urban change from LIDAR point clouds interpolate the points into rasters, perform pixel‐based image processing to detect changes, and produce 2D images as output. We present a method of LIDAR change detection that maintains accuracy by only using the raw, irregularly spaced LIDAR points, and extracts relevant changes as individual 3D models. We then utilize these models, alongside existing GIS data, within an interactive application that allows the chronological exploration of the changes to an urban environment. A three‐tiered level‐of‐detail system maintains a scale‐appropriate, legible visual representation across the entire range of view scales, from individual changes such as buildings and trees, to groups of changes such as new residential developments, deforestation, and construction sites, and finally to larger regions such as neighborhoods and districts of a city that are emerging or undergoing revitalization. Tools are provided to assist the visual analysis by urban planners and historians through semantic categorization and filtering of the changes presented.
Visual Abstractions of Solvent Pathlines near Protein Cavities
Authors: Bidmon Katrin , Grottel Sebastian , Bös Fabian , Pleiss Jürgen , Ertl Thomas 
Published: September 2008

AbstractWater is known to play a crucial role in protein structure, flexibility and activity. The use of molecular dynamics simulations allows detailed studies of complex protein‐solvent interactions. Cluster analysis and density‐based approaches have been successfully used for the identification and analysis of conserved water molecules and hydration patterns of proteins. However, appropriate tools for analysing long‐time molecular dynamics simulations with respect to tracking and visualising the paths of solvent molecules are lacking. Our method focuses on visualising the solvent paths entering and leaving cavities of the protein and allows to study the route and dynamics of the exchange of tightly bound internal water molecules with the bulk solvent. The proposed visualisation also represents dynamic properties such as direction and velocity in the solvent. Especially, by clustering similar path‐lines with respect to designated properties the visualisation can be abstracted to represent the principal paths of solvent molecules through the cavities. Its application in the analysis of long‐time scale molecular dynamics simulations not only confirmed conjectures based on previous manual observations made by chance, but also led to novel insights into the dynamical and structural role of water molecules and its interplay with protein structure.
Navigation and Exploration of Interconnected Pathways
Authors: Streit M. , Kalkusch M. , Kashofer K. , Schmalstieg D. 
Published: September 2008

AbstractVisualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interwoven graphs, with complex structures present in both the individual graphs and their interconnections. This situation requires the development of novel visualization techniques to allow efficient visual exploration. We present the Caleydo framework, which incorporates a number of approaches to handle such pathways. Navigation in the network of pathways is facilitated by a hierarchical approach which dynamically selects a working set of individual pathways for closer inspection. These pathways are interactively rendered together with visual interconnections in a 2.5D view using graphics hardware acceleration. The layout of individual graphs is not computed automatically, but taken from the KEGG and BioCarta databases, which use layouts that life scientists are familiar with. Therefore they encode essential meta‐information. While the KEGG and BioCarta pathways use a pre‐defined layout, interactions such as linking+brushing, neighborhood search or detail on demand are still fully interactive in Caleydo. We have evaluated Caleydo with pathologists working on the determination of unknown gene functions. Informal experiences confirm that Caleydo is useful in both generating and validating such hypotheses.Even though the presented techniques are applied to medical pathways, the proposed way of interaction is not limited to cellular processes and therefore has the potential to open new possibilities in other fields of application.
Visual Inspection of Multivariate Graphs
Authors: Pretorius A. Johannes , Van Wijk Jarke J. 
Published: September 2008

AbstractMost graph visualization techniques focus on the structure of graphs and do not offer support for dealing with node attributes and edge labels. To enable users to detect relations and patterns in terms of data associated with nodes and edges, we present a technique where this data plays a more central role. Nodes and edges are clustered based on associated data. Via direct manipulation users can interactively inspect and query the graph. Questions that can be answered include, “which edge types are activated by specific node attributes?” and, “how and from where can I reach specific types of nodes?” To validate our approach we contrast it with current practice. We also provide several examples where our method was used to study transition graphs that model real‐world systems.
Interactive Exploratory Visualization of 2D Vector Fields
Authors: Isenberg Tobias , Everts Maarten H. , Grubert Jens , Carpendale Sheelagh 
Published: September 2008

AbstractIn this paper we present several techniques to interactively explore representations of 2D vector fields. Through a set of simple hand postures used on large, touch‐sensitive displays, our approach allows individuals to custom‐design glyphs (arrows, lines, etc.) that best reveal patterns of the underlying dataset. Interactive exploration of vector fields is facilitated through freedom of glyph placement, glyph density control, and animation. The custom glyphs can be applied individually to probe specific areas of the data but can also be applied in groups to explore larger regions of a vector field. Re‐positionable sources from which glyphs—animated according to the local vector field—continue to emerge are used to examine the vector field dynamically. The combination of these techniques results in an engaging visualization with which the user can rapidly explore and analyze varying types of 2D vector fields, using a virtually infinite number of custom‐designed glyphs.
Results of a User Study on 2D Hurricane Visualization
Authors: Martin Joel P. , Swan J. Edward , Moorhead Robert J. , Liu Zhanping , Cai Shangshu 
Published: September 2008

AbstractWe present the results from a user study looking at the ability of observers to mentally integrate wind direction and magnitude over a vector field. The data set chosen for the study is an MM5 (PSU/NCAR Mesoscale Model) simulation of Hurricane Lili over the Gulf of Mexico as it approaches the southeastern United States. Nine observers participated in the study. This study investigates the effect of layering on the observer's ability to determine the magnitude and direction of a vector field. We found a tendency for observers to underestimate the magnitude of the vectors and a counter‐clockwise bias when determining the average direction of a vector field. We completed an additional study with two observers to try to uncover the source of the counter‐clockwise bias. These results have direct implications to atmospheric scientists, but may also be able to be applied to other fields that use 2D vector fields.
Evaluation of illustration‐inspired techniques for time‐varying data visualization
Authors: Joshi Alark , Rheingans Penny 
Published: September 2008

AbstractIllustration‐inspired techniques have provided alternative ways to visualize time‐varying data. Techniques such as speedlines, flow ribbons, strobe silhouettes and opacity‐based techniques provide temporal context to the current timestep being visualized. We evaluated the effectiveness of these illustrative techniques by conducting a user study. We compared the ability of subjects to visually track features using snapshots, snapshots augmented by illustration techniques, animations, and animations augmented by illustration techniques. User accuracy, time required to perform a task, and user confidence were used as measures to evaluate the techniques. The results indicate that the use of illustration‐inspired techniques provides a significant improvement in user accuracy and the time required to complete the task. Subjects performed significantly better on each metric when using augmented animations as compared to augmented snapshots.
Visual Clustering in Parallel Coordinates
Authors: Zhou Hong , Yuan Xiaoru , Qu Huamin , Cui Weiwei , Chen Baoquan 
Published: September 2008

AbstractParallel coordinates have been widely applied to visualize high‐dimensional and multivariate data, discerning patterns within the data through visual clustering. However, the effectiveness of this technique on large data is reduced by edge clutter. In this paper, we present a novel framework to reduce edge clutter, consequently improving the effectiveness of visual clustering. We exploit curved edges and optimize the arrangement of these curved edges by minimizing their curvature and maximizing the parallelism of adjacent edges. The overall visual clustering is improved by adjusting the shape of the edges while keeping their relative order. The experiments on several representative datasets demonstrate the effectiveness of our approach.
Interactive Visualization of Multimodal Volume Data for Neurosurgical Tumor Treatment
Authors: Rieder Christian , Ritter Felix , Raspe Matthias , Peitgen Heinz‐Otto 
Published: September 2008

AbstractWe present novel interactive methods for the visualization of multimodal volume data as used in neurosurgical therapy planning. These methods allow surgeons to explore multimodal volumes and focus on functional data and lesions. Computer graphics techniques are proposed to create expressive visualizations at interactive frame rates to reduce time‐consuming and complex interaction with the medical data. Contributions of our work are the distance‐based enhancements of functional data and lesions which allows the surgeon to perceive functional and anatomical structures at once and relate them directly to the intervention. In addition we propose methods for the visual exploration of the path to the structures of interest, to enhance anatomical landmarks, and to provide additional depth indicators. These techniques have been integrated in a visualization prototype that provides interaction capabilities for finding the optimal therapeutic strategy for the neurosurgeon.
Virtual Klingler Dissection: Putting Fibers into Context
Authors: Schultz T. , Sauber N. , Anwander A. , Theisel H. , Seidel H.‐P. 
Published: September 2008

AbstractFiber tracking is a standard tool to estimate the course of major white matter tracts from diffusion tensor magnetic resonance imaging (DT‐MRI) data. In this work, we aim at supporting the visual analysis of classical streamlines from fiber tracking by integrating context from anatomical data, acquired by aT1‐weighted MRI measurement. To this end, we suggest a novel visualization metaphor, which is based on data‐driven deformation of geometry and has been inspired by a technique for anatomical fiber preparation known as Klingler dissection. We demonstrate that our method conveys the relation between streamlines and surrounding anatomical features more effectively than standard techniques like slice images and direct volume rendering. The method works automatically, but its GPU‐based implementation allows for additional, intuitive interaction.
A smart stochastic approach for manifolds smoothing
Authors: El Ouafdi A.F. , Ziou D. , Krim H. 
Published: September 2008

AbstractIn this paper, we present a probabilistic approach for 3D object's smoothing. The core idea behind the proposed method is to relate the problem of smoothing objects to that of tracking the transition probability density functions of an underlying random process. We show that such an approach allows for additional insight and sufficient flexibility compared with existing standard smoothing techniques. In particular, we are able to propose a newer, faster, and simpler smoothing approach that retains and enhances important manifold features. Furthermore, it is demonstrated to improve performance over existing smoothing techniques.
Fitting Sharp Features with Loop Subdivision Surfaces
Authors: Ling Ruotian , Wang Wenping , Yan Dongming 
Published: September 2008

AbstractVarious methods have been proposed for fitting subdivision surfaces to different forms of shape data (e.g., dense meshes or point clouds), but none of these methods effectively deals with shapes with sharp features, that is, creases, darts and corners. We present an effective method for fitting a Loop subdivision surface to a dense triangle mesh with sharp features. Our contribution is a new exact evaluation scheme for the Loop subdivision with all types of sharp features, which enables us to compute a fitting Loop subdivision surface for shapes with sharp features in an optimization framework. With an initial control mesh obtained from simplifying the input dense mesh using QEM, our fitting algorithm employs an iterative method to solve a nonlinear least squares problem based on the squared distances from the input mesh vertices to the fitting subdivision surface. This optimization framework depends critically on the ability to express these distances as quadratic functions of control mesh vertices using our exact evaluation scheme near sharp features. Experimental results are presented to demonstrate the effectiveness of the method.
Surface sampling and the intrinsic Voronoi diagram
Authors: Dyer Ramsay , Zhang Hao , Möller Torsten 
Published: September 2008

AbstractWe develop adaptive sampling criteria which guarantee a topologically faithful mesh and demonstrate an improvement and simplification over earlier results, albeit restricted to 2D surfaces. These sampling criteria are based on functions defined by intrinsic properties of the surface: the strong convexity radius and the injectivity radius. We establish inequalities that relate these functions to the local feature size, thus enabling a comparison between the demands of the intrinsic sampling criteria and those based on Euclidean distances and the medial axis.
Provably Good 2D Shape Reconstruction from Unorganized Cross‐Sections
Authors: Memari Pooran , Boissonnat Jean‐Daniel 
Published: September 2008

AbstractThis paper deals with the reconstruction of 2‐dimensional geometric shapes from unorganized 1‐dimensional cross‐sections. We study the problem in its full generality following the approach of Boissonnat and Memari [BM07] for the analogous 3D problem. We propose a new variant of this method and provide sampling conditions to guarantee that the output of the algorithm has the same topology as the original object and is close to it (for the Hausdorff distance).
Streaming Surface Reconstruction Using Wavelets
Authors: Manson J. , Petrova G. , Schaefer S. 
Published: September 2008

AbstractWe present a streaming method for reconstructing surfaces from large data sets generated by a laser range scanner using wavelets. Wavelets provide a localized, multiresolution representation of functions and this makes them ideal candidates for streaming surface reconstruction algorithms. We show how wavelets can be used to reconstruct the indicator function of a shape from a cloud of points with associated normals. Our method proceeds in several steps. We first compute a low‐resolution approximation of the indicator function using an octree followed by a second pass that incrementally adds fine resolution details. The indicator function is then smoothed using a modified octree convolution step and contoured to produce the final surface. Due to the local, multiresolution nature of wavelets, our approach results in an algorithm over 10 times faster than previous methods and can process extremely large data sets in the order of several hundred million points in only an hour.
Deformation‐Driven Shape Correspondence
Authors: Zhang H. , Sheffer A. , Cohen‐Or D. , Zhou Q. , Van Kaick O. , Tagliasacchi A. 
Published: September 2008

AbstractNon‐rigid 3D shape correspondence is a fundamental and difficult problem. Most applications which require a correspondence rely on manually selected markers. Without user assistance, the performances of existing automatic correspondence methods depend strongly on a good initial shape alignment or shape prior, and they generally do not tolerate large shape variations. We present an automatic feature correspondence algorithm capable of handling large, non‐rigid shape variations, as well as partial matching. This is made possible by leveraging the power of state‐of‐the‐art mesh deformation techniques and relying on a combinatorial tree traversal for correspondence search. The search is deformation‐driven, prioritized by a self‐distortion energy measured on meshes deformed according to a given correspondence. We demonstrate the ability of our approach to naturally match shapes which differ in pose, local scale, part decomposition, and geometric detail through numerous examples.
Dental Inlay and Onlay Construction by Iterative Laplacian Surface Editing
Authors: Steinbrecher Tillmann , Gerth Maik 
Published: September 2008

AbstractWe propose a new method for automatic construction of inlays and onlays. Mesh models from a small tooth library are adapted to the remaining healthy surface of the patient's tooth. In the area above the cavity, the general morphology of the model tooth (fissures, cusp tips, etc) is preserved, but precisely adjusted to the intra‐oral situation. Our approach uses iterative Laplacian Surface Editing to deform the model tooth. This allows the automatic generation of highly individual, functional and anatomically correct inlays/onlays, without having to resort to a large library of different tooth shapes.