Volume visualization

Volume visualization is a method of extracting information from volumetric datasets through interactive graphics and imaging, and is concerned with the representation, manipulation, and rendering of these datasets [Gallagher 1995; Kaufman 1991; Rosenblum 1994]. Volume data are 3D entities that may have information inside them, may not consist of surfaces and edges, or may be too voluminous to be represented geometrically. Volume visualization encompasses an array of techniques for peering inside the dataset and for interactively extracting meaningful information from it using transformations, cuts, segmentation, translucency, measurements, and the like. The primary sources of volume data are three: sampled data of real objects or phenomena, computed data produced by a computer simulation, and modeled data generated from a geometric model. Examples of applications generating sampled data are medical imaging (e.g., CT, MRI), biology (e.g., confocal microscopy), geoscience (e.g., seismic measurements), industry (e.g., nondestructive inspection), and chemistry (e.g., electron density maps) [Kaufman 1991]. Some examples of applications generating computed datasets, typically by running a simulation on a supercomputer, are meteorology (e.g., storm prediction), computational fluid dynamics (e.g., water flow), and materials science (e.g., new materials). Recently, many traditional computer graphics applications, such as computer-aided design and flight simulation [Cohen and Shaked 1993; Kaufman et al. 1993], have been exploiting the advantages of volumetric techniques for modeling, manipulation, and visualization, an approach called volume graphics [Kaufman et al. 1993]. Volumetric data is typically a set S of samples (x, y, z, v), representing the value v of some property of the data at a 3D location (x, y, z). If v is simply a 0 or a 1, with 0 indicating background and 1 indicating the object, the data is called binary data. The data may instead be multivalued, with v representing some measurable property of the data, such as density, color, heat, or pressure. The value v may even be a vector, representing, for example, velocity at each location. In general, the samples may be taken at random locations in space, but in many cases S is isotropic, containing samples taken at regularly spaced intervals along three orthogonal axes. Since S is defined on a regular grid, a 3D array (called volume buffer, cubic frame buffer, 3D raster) is typically used to store the values. S is therefore referred to as the array of values S(x, y, z), which is defined only at grid locations. A function may be defined to describe the value at any continuous location by approximating v at a location (x, y, z) using some interpolation function to S, such as zero-order (nearest-neighbor), piecewise function known as first-order (trilinear), or higher-order interpolation. The region of constant value that surrounds each sample in zero-order interpolation is known as a volume cell (voxel for short), with each voxel being a rectangular cuboid having six faces, twelve edges, and eight corners. The terms, voxel, grid location,

[1]  Jayaram K. Udupa,et al.  Display Of Three-Dimensional Discrete Surfaces , 1981, Other Conferences.

[2]  Marc Levoy,et al.  A hybrid ray tracer for rendering polygon and volume data , 1990, IEEE Computer Graphics and Applications.

[3]  Andreas Pommert,et al.  3D visualization of tomographic volume data using the generalized voxel model , 1990, VVS '89.

[4]  Arie E. Kaufman,et al.  Discrete ray tracing , 1992, IEEE Computer Graphics and Applications.

[5]  Daniel Cohen-Or,et al.  Photo‐Realistic Imaging of Digital Terrains , 1993, Comput. Graph. Forum.

[6]  Andreas Pommert,et al.  Investigation of medical 3D-rendering algorithms , 1990, IEEE Computer Graphics and Applications.

[7]  Boon-Lock Yeo,et al.  Volume Rendering of DCT-Based Compressed 3D Scalar Data , 1995, IEEE Trans. Vis. Comput. Graph..

[8]  Heang K. Tuy,et al.  Direct 2-D display of 3-D objects , 1984, IEEE Computer Graphics and Applications.

[9]  Don Speray,et al.  Volume probes: interactive data exploration on arbitrary grids , 1990, SIGGRAPH 1990.

[10]  R. Bernstein,et al.  Shading 3D-Images from CT Using Gray-Level Gradients , 1986, IEEE Transactions on Medical Imaging.

[11]  Thomas Malzbender,et al.  Fourier volume rendering , 1993, TOGS.

[12]  D. Hemmy,et al.  CT of dry skulls with craniofacial deformities: accuracy of three-dimensional reconstruction. , 1985, Radiology.

[13]  David Baraff,et al.  Physician's Workstation with Real-Time Performance , 1985, IEEE Computer Graphics and Applications.

[14]  Guido Gerig,et al.  Unsupervised tissue type segmentation of 3D dual-echo MR head data , 1992, Image Vis. Comput..

[15]  P. Hanrahan,et al.  Area and volume coherence for efficient visualization of 3D scalar functions , 1990, SIGGRAPH 1990.

[16]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  H E Cline,et al.  3D reconstruction of the brain from magnetic resonance images using a connectivity algorithm. , 1987, Magnetic Resonance Imaging.

[18]  Pat Hanrahan,et al.  Hierarchical splatting: a progressive refinement algorithm for volume rendering , 1991, SIGGRAPH.

[19]  Christopher Giertsen,et al.  Volume visualization of sparse irregular meshes , 1992, IEEE Computer Graphics and Applications.

[20]  Arie E. Kaufman,et al.  3D Volume Visualization , 1990, Advances in Computer Graphics.

[21]  Daniel Cohen-Or,et al.  Volume graphics , 1993, Computer.

[22]  Charles M. Eastman,et al.  Vector versus raster: a functional comparison of drawing technologies , 1990, IEEE Computer Graphics and Applications.

[23]  G. Herman,et al.  Three-dimensional display of human organs from computed tomograms , 1979 .

[24]  W. Lorensen,et al.  Two algorithms for the three-dimensional reconstruction of tomograms. , 1988, Medical physics.

[25]  R. Kikinis,et al.  Three-dimensional segmentation of MR images of the head using probability and connectivity. , 1990, Journal of computer assisted tomography.

[26]  Arie Kaufman,et al.  Volume Visualization (Tutorial) , 1991 .

[27]  Alan Kalvin,et al.  Quantitative and Qualitative Comparison of Voluinetric and Surface Rendering Techniques , 1990 .

[28]  Aristides A. G. Requicha,et al.  Algorithms for computing the volume and other integral properties of solids. I. known methods and open issues , 1982, CACM.

[29]  Guido Gerig,et al.  Nonlinear anisotropic filtering of MRI data , 1992, IEEE Trans. Medical Imaging.

[30]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[31]  Marc Levoy,et al.  Display of surfaces from volume data , 1988, IEEE Computer Graphics and Applications.

[32]  Per E. Danielsson Incremental Curve Generation , 1970, IEEE Transactions on Computers.

[33]  Lawrence J. Rosenblum,et al.  Scientific visualization : advances and challenges , 1994 .

[34]  W. A. Hanson,et al.  Interactive 3D segmentation of MRI and CT volumes using morphological operations. , 1992, Journal of computer assisted tomography.

[35]  D. Jackél,et al.  The Graphics PARCUM * System: A 3D Memory Based Computer Architecture for Processing and Display of Solid Models , 1985, Comput. Graph. Forum.

[36]  Dan Gordon,et al.  Image space shading of 3-dimensional objects , 1985, Comput. Vis. Graph. Image Process..

[37]  Ross T. Whitaker,et al.  Direct visualization of volume data , 1992, IEEE Computer Graphics and Applications.

[38]  Michael P. Garrity Raytracing irregular volume data , 1990, SIGGRAPH 1990.

[39]  Jayaram K. Udupa,et al.  Surface Shading in the Cuberille Environment , 1985, IEEE Computer Graphics and Applications.