IEEE VIS Publication Dataset

next
Vis
2004
Code Checking and Visualization of an Architecture Design
10.1109/VISUAL.2004.14
1. 10
M
Computer graphics has be successfully applied to architecture design. There is more demand to new applications. One of them, to be addressed in this work, is the code checking and visualization of the checking results.
Rong Xu;Solihin, W.;Zhiyong Huang
National University of Singapore and novaCITYNETS Pte. Ltd.|c|;;
Vis
2004
Compatible triangulations of spatial decompositions
10.1109/VISUAL.2004.15
2. 217
C
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solving several problems in graphics and visualization including the crack problem found in adaptive isosurface generation, triangulation of arbitrary grids (including unstructured grids), clipping, and the interval tetrahedrization problem. The algorithm produces compatible triangulations on a cell-by-cell basis, using a modified Delaunay triangulation with a simple point ordering rule to resolve degenerate cases and produce unique triangulations across cell boundaries. The algorithm is naturally parallel since it requires no neighborhood cell information, only a unique, global point numbering. We show application of this algorithm to adaptive contour generation; tetrahedrization of unstructured meshes; clipping and interval volume mesh generation.
Schroeder, W.J.;Geveci, B.;Malaterre, M.
;;
10.1109/VISUAL.1996.568127;10.1109/VISUAL.1997.663869;10.1109/VISUAL.1997.663886
triangulation, tetrahedrization, adaptive grid, clipping, contouring, template, Delaunay, parallel
Vis
2004
Compression, Segmentation, and Modeling of Large-Scale Filamentary Volumetric Data
10.1109/VISUAL.2004.16
3. 31
M
We describe a method for processing large amounts of volumetric data collected from a Knife Edge Scanning Microscope (KESM). The neuronal data that we acquire consists of thin, branching structures extending over very large regions that prior volumetric representations have difficulty dealing with efficiently. Since the full volume data set can be extremely large, on-the-fly processing of the data is necessary.
McCormick, B.H.;Doddapaneni, P.;Mayerich, D.;Melek, Z.;Keyser, J.
Texas A&M University|c|;;;;
Vis
2004
Constrained inverse volume rendering for planetary nebulae
10.1109/VISUAL.2004.18
8. 90
C
Determining the three-dimensional structure of distant astronomical objects is a challenging task, given that terrestrial observations provide only one viewpoint. For this task, bipolar planetary nebulae are interesting objects of study because of their pronounced axial symmetry due to fundamental physical processes. Making use of this symmetry constraint, we present a technique to automatically recover the axisymmetric structure of bipolar planetary nebulae from two-dimensional images. With GPU-based volume rendering driving a nonlinear optimization, we estimate the nebula's local emission density as a function of its radial and axial coordinates, and we recover the orientation of the nebula relative to Earth. The optimization refines the nebula model and its orientation by minimizing the differences between the rendered image and the original astronomical image. The resulting model enables realistic 3D visualizations of planetary nebulae, e.g. for educational purposes in planetarium shows. In addition, the recovered spatial distribution of the emissive gas allows validating computer simulation results of the astrophysical formation processes of planetary nebulae.
Magnor, M.;Kindlmann, G.;Duric, N.;Hansen, C.
;;;
volumetric modeling, inverse rendering, volume rendering, volume reconstruction, planetary nebulae
Vis
2004
Context-Adaptive Mobile Visualization and Information Management
10.1109/VISUAL.2004.19
8. 8
M
This poster abstract presents a scalable information visualization system for mobile devices and desktop systems. It is designed to support the operation and the workflow of wastewater systems. The regarded information data includes general information about buildings and units, process data, occupational safety regulations, work directions and first aid instructions in case of an accident. Technically, the presented framework combines visualization with agent technology in order to automatically scale various visualization types to fit on different platforms like PDAs (Personal Digital Assistants) or Tablet PCs. The implementation is based on but not limited to SQL, JSP, HTML and VRML.
Ehret, J.;Ebert, A.;Schuchardt, L.;Steinmetz, H.;Hagen, H.
German Research Center for Artificial Intelligence|c|;;;;
Vis
2004
DaMI - Data Management for Multimedial Information Systems
10.1109/VISUAL.2004.21
9. 9
M
This paper describes a Data Management System for Multimedial Information Visualization called DaMI. It is possible to create 2D or 3D model based on data out of standard databases and additional metainformation. DaMI is a generic system guaranteeing an optimal reusability and compatibility.
Hagen, H.;Steinebach, G.;Munchhofen, M.;Scheler, I.;Ruby, M.;Wadle, M.
University of Kaiserslautern|c|;;;;;
Vis
2004
Depth Enhanced Panoramas
10.1109/VISUAL.2004.22
1. 11
M
Bahmutov, G.;Popescu, V.;Sacks, E.
Purdue University|c|;;
Vis
2004
Detection and visualization of anomalous structures in molecular dynamics simulation data
10.1109/VISUAL.2004.23
4. 472
C
We explore techniques to detect and visualize features in data from molecular dynamics (MD) simulations. Although the techniques proposed are general, we focus on silicon (Si) atomic systems. The first set of methods use 3D location of atoms. Defects are detected and categorized using local operators and statistical modeling. Our second set of exploratory techniques employ electron density data. This data is visualized to glean the defects. We describe techniques to automatically detect the salient isovalues for isosurface extraction and designing transfer functions. We compare and contrast the results obtained from both sources of data. Essentially, we find that the methods of defect (feature) detection are at least as robust as those based on the exploration of electron density for Si systems.
Mehta, S.;Hazzard, K.;Machiraju, R.;Parthasarathy, S.;Wilkins, J.
Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA|c|;;;;
10.1109/VISUAL.1995.480793;10.1109/VISUAL.2002.1183753
Feature Extraction, Scientific Data Visualization, Data Mining, Iso-surface, Transfer Functions, Molecular Dynamics
Vis
2004
Dispersion simulation and visualization for urban security
10.1109/VISUAL.2004.24
5. 560
C
We present a system for simulating and visualizing the propagation of dispersive contaminants with an application to urban security. In particular, we simulate airborne contaminant propagation in open environments characterised by sky-scrapers and deep urban canyons. Our approach is based on the multiple relaxation time lattice Boltzmann model (MRTLBM), which can efficiently handle complex boundary conditions such as buildings. In addition, we model thermal effects on the flow field using the hybrid thermal MRTLBM. Our approach can also accommodate readings from various sensors distributed in the environment and adapt the simulation accordingly. We accelerate the computation and efficiently render many buildings with small textures on the GPU. We render streamlines and the contaminant smoke with self-shadowing composited with the textured buildings.
Feng Qiu;Ye Zhao;Zhe Fan;Xiaoming Wei;Lorenz, H.;Jianning Wang;Yoakum-Stover, S.;Kaufman, A.;Mueller, K.
Dept. of Comput. Sci., Stony Brook Univ., NY, USA|c|;;;;;;;;
10.1109/VISUAL.2003.1250382;10.1109/VISUAL.2002.1183764;10.1109/VISUAL.2002.1183779;10.1109/VISUAL.1993.398877
Lattice Boltzmann Model, GPU, Visualization
Vis
2004
Display of vector fields using a reaction-diffusion model
10.1109/VISUAL.2004.25
1. 122
C
Effective visualization of vector fields relies on the ability to control the size and density of the underlying mapping to visual cues used to represent the field. In this paper we introduce the use of a reaction-diffusion model, already well known for its ability to form irregular spatio-temporal patters, to control the size, density, and placement of the vector field representation. We demonstrate that it is possible to encode vector field information (orientation and magnitude) into the parameters governing a reaction-diffusion model to form a spot pattern with the correct orientation, size, and density, creating an effective visualization. To encode direction we texture the spots using a light to dark fading texture. We also show that it is possible to use the reaction-diffusion model to visualize an additional scalar value, such as the uncertainty in the orientation of the vector field. An additional benefit of the reaction-diffusion visualization technique arises from its automatic density distribution. This benefit suggests using the technique to augment other vector visualization techniques. We demonstrate this utility by augmenting a LIC visualization with a reaction-diffusion visualization. Finally, the reaction-diffusion visualization method provides a technique that can be used for streamline and glyph placement.
Sanderson, A.;Johnson, C.R.;Kirby, R.M.
Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA|c|;;
10.1109/VISUAL.1999.809865;10.1109/VISUAL.1995.480817;10.1109/VISUAL.1995.485141;10.1109/VISUAL.2000.885688;10.1109/VISUAL.1996.567784;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225;10.1109/TVCG.2009.126;10.1109/VISUAL.1996.567777;10.1109/VISUAL.2003.1250357;10.1109/VISUAL.1999.809904;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1997.663897
Vector Field Visualization, Flow Visualization, Reaction-Diffusion, Vector Fields
Vis
2004
DTI Fiber Clustering in the Whole Brain
10.1109/VISUAL.2004.26
2. 28
M
Song Zhang;Laidlaw, D.H.
Brown University|c|;
Vis
2004
Dual contouring with topology-preserving simplification using enhanced cell representation
10.1109/VISUAL.2004.27
5. 512
C
We present a fast, topology-preserving approach for isosurface simplification. The underlying concept behind our approach is to preserve the disconnected surface components in cells during isosurface simplification. We represent isosurface components in a novel representation, called enhanced cell, where each surface component in a cell is represented by a vertex and its connectivity information. A topology-preserving vertex clustering algorithm is applied to build a vertex octree. An enhanced dual contouring algorithm is applied to extract error-bounded multiresolution isosurfaces from the vertex octree while preserving the finest resolution isosurface topology. Cells containing multiple vertices are properly handled during contouring. Our approach demonstrates better results than existing octree-based simplification techniques.
Zhang, N.;Hong, W.;Kaufman, A.
Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA|c|;;
10.1109/VISUAL.1994.346308;10.1109/VISUAL.2001.964503;10.1109/VISUAL.2003.1250356;10.1109/VISUAL.2003.1250360;10.1109/VISUAL.2002.1183810;10.1109/VISUAL.1996.568127;10.1109/VISUAL.2000.885703
isosurface simplification, isosurface extraction, topology preservation, vertex clustering
Vis
2004
Dual marching cubes
10.1109/VISUAL.2004.28
4. 496
C
We present the definition and computational algorithms for a new class of surfaces which are dual to the isosurface produced by the widely used marching cubes (MC) algorithm. These new isosurfaces have the same separating properties as the MC surfaces but they are comprised of quad patches that tend to eliminate the common negative aspect of poorly shaped triangles of the MC isosurfaces. Based upon the concept of this new dual operator, we describe a simple, but rather effective iterative scheme for producing smooth separating surfaces for binary, enumerated volumes which are often produced by segmentation algorithms. Both the dual surface algorithm and the iterative smoothing scheme are easily implemented.
Nielson, G.M.
Arizona Univ., Tucson, AZ, USA|c|
10.1109/VISUAL.2002.1183807;10.1109/VISUAL.1991.175782
Marching Cubes, isosurfaces, triangular mesh, dual graph, segmented data, smoothing
Vis
2004
Efficient point-based isosurface exploration using the span-triangle
10.1109/VISUAL.2004.29
4. 448
C
We introduce a novel span-triangle data structure, based on the span-space representation for isosurfaces. It stores all necessary cell information for dynamic manipulation of the isovalue in an efficient way. We have found that using our data structure in combination with point-based techniques, implemented on graphics hardware, effects in real-time rendering and exploration. Our extraction algorithm utilizes an incremental and progressive update scheme, enabling smooth interaction without significant latency. Moreover, the corresponding visualization pipeline is capable of processing large data sets by utilizing all three levels of memory: disk, system and graphics. We address practical usability in actual medical applications, achieving a new level of interactivity.
von Rymon-Lipinski, B.;Hanssen, N.;Jansen, T.;Ritter, L.;Keeve, E.
;;;;
10.1109/VISUAL.1991.175780;10.1109/VISUAL.2001.964489;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1995.480806
Point-Based Visualization, Isosurfaces, Hardware Acceleration, Large Data Set Visualization, Visualization in Medicine
Vis
2004
Exploration of the brain's white matter pathways with dynamic queries
10.1109/VISUAL.2004.30
3. 384
C
Diffusion tensor imaging (DTI) is a magnetic resonance imaging method that can be used to measure local information about the structure of white matter within the human brain. Combining DTI data with the computational methods of MR tractography, neuroscientists can estimate the locations and sizes of nerve bundles (white matter pathways) that course through the human brain. Neuroscientists have used visualization techniques to better understand tractography data, but they often struggle with the abundance and complexity of the pathways. We describe a novel set of interaction techniques that make it easier to explore and interpret such pathways. Specifically, our application allows neuroscientists to place and interactively manipulate box-shaped regions (or volumes of interest) to selectively display pathways that pass through specific anatomical areas. A simple and flexible query language allows for arbitrary combinations of these queries using Boolean logic operators. Queries can be further restricted by numerical path properties such as length, mean fractional anisotropy, and mean curvature. By precomputing the pathways and their statistical properties, we obtain the speed necessary for interactive question-and-answer sessions with brain researchers. We survey some questions that researchers have been asking about tractography data and show how our system can be used to answer these questions efficiently.
Akers, D.;Sherbondy, A.;Mackenzie, R.;Dougherty, R.;Wandell, B.
Stanford Univ., CA, USA|c|;;;;
10.1109/VISUAL.1999.809894;10.1109/VISUAL.1999.809886;10.1109/VISUAL.2002.1183799
Visualization, DTI, MR Tractography
Vis
2004
Fast Rendering of Foveated Volume in the Wavelet Domain
10.1109/VISUAL.2004.31
2. 26
M
Hang Yu;Chang, E.-C.;Zhiyong Huang;Zhijian Zheng
National University of Singapore|c|;;;
Vis
2004
Flow field clustering via algebraic multigrid
10.1109/VISUAL.2004.32
3. 42
C
We present a novel multiscale approach for flow visualization. We define a local alignment tensor that encodes a measure for alignment to the direction of a given flow field. This tensor induces an anisotropic differential operator on the flow domain, which is discretized with a standard finite element technique. The entries of the corresponding stiffness matrix represent the anisotropically weighted couplings of adjacent nodes of the domain mesh. We use an algebraic multigrid algorithm to generate a hierarchy of fine to coarse descriptions for the above coupling data. This hierarchy comprises a set of coarse grid nodes, a multiscale of basis functions and their corresponding supports. We use these supports to obtain a multilevel decomposition of the flow structure. Standard streamline icons are used to visualize this decomposition at any user-selected level of detail. The method provides a single framework for vector field decomposition independent on the domain dimension or mesh type. Applications are shown in 2D, for flow fields on curved surfaces, and for 3D volumetric flow fields.
Griebel, M.;Preusser, T.;Rumpf, M.;Schweitzer, M.A.;Telea, A.
Inst. for Numerical Simulation, Bonn Univ., Germany|c|;;;;
10.1109/VISUAL.1999.809865;10.1109/VISUAL.2003.1250372;10.1109/VISUAL.2003.1250377;10.1109/VISUAL.2003.1250363;10.1109/VISUAL.1999.809863
algebraic multigrid, multiscale visualization, flow visualization
Vis
2004
Force-Feedback-Enhanced Navigation for Interactive Visualization of Coronary Vessels
10.1109/VISUAL.2004.33
3. 32
M
Coronary heart disease (CHD) is the number one killer in the United States. Although it is well known that CHD mainly occurs due to blocked arteries, there are contradictory results from studies designed to identify basic causes for this common disease is. To find out more about the true reason for CHD, virtual models can be employed to better understand the way the heart functions. With such a model, scientists and surgeons are able to analyze the effects of different treatment options, and ultimately find more suited ways to prevent coronary heart diseases. To investigate a given model, appropriate navigation methods are required, including suitable input devices. For the visualization, graphics cards originally designed for gaming applications are used; so, it is a just natural transition to adapt gaming input devices to a visualization system for controlling of the navigation. These devices are usually well designed with respect to ergonomics and durability, yielding more degrees of freedom in steering than two-dimensional input devices, such as desktop mice. This poster describes a visualization system that provides the user with advanced control devices for navigation enabling interactive exploration of the model. Force-feedback and sound effects provide additional cues.
Wischgoll, T.;Moritz, E.;Meyer, J.
University of California at Irvine|c|;;
Vis
2004
Generating realistic images from hydrothermal plume data
10.1109/VISUAL.2004.34
9. 98
C
Most data used in the study of seafloor hydrothermal plumes consists of sonar (acoustic) scans and sensor readings. Visual data captures only a portion of the sonar data range due to the prohibitive cost and physical infeasibility of taking sufficient lighting and video equipment to such extreme depths. However, visual images are available from research dives and from the recent IMAX movie, volcanoes of the deep sea. In this application paper, we apply existing lighting models with forward scattering and light attenuation to the 3D sonar data in order to mimic the visual images available. These generated images are compared to existing visual images. This can help the geoscientists understand the relationship between these different data modalities and elucidate some of the mechanisms used to capture the data.
Santilli, K.;Bemis, K.;Silver, D.;Dastur, J.;Rona, P.
Rutgers Univ., NJ, USA|c|;;;;
10.1109/VISUAL.2000.885737;10.1109/VISUAL.2003.1250383;10.1109/VISUAL.1998.745347
Applications of volume graphics and volume visualization, Earth / Space / and Environmental Sciences Visualization, PC-based volume graphics, Volume Rendering
Vis
2004
Generating sub-resolution detail in images and volumes using constrained texture synthesis
10.1109/VISUAL.2004.35
7. 82
C
A common deficiency of discretized datasets is that detail beyond the resolution of the dataset has been irrecoverably lost. This lack of detail becomes immediately apparent once one attempts to zoom into the dataset and only recovers blur. We describe a method that generates the missing detail from any available and plausible high-resolution data, using texture synthesis. Since the detail generation process is guided by the underlying image or volume data and is designed to fill in plausible detail in accordance with the coarse structure and properties of the zoomed-in neighborhood, we refer to our method as constrained texture synthesis. Regular zooms become "semantic zooms", where each level of detail stems from a data source attuned to that resolution. We demonstrate our approach by a medical application - the visualization of a human liver - but its principles readily apply to any scenario, as long as data at all resolutions are available. We first present a 2D viewing application, called the "virtual microscope", and then extend our technique to 3D volumetric viewing.
Lujin Wang;Mueller, K.
;
texture synthesis, semantic zoom