Introduction to Volume Visualization Mengxia Zhu Fall 2007.

Slides:



Advertisements
Similar presentations
7.1 Vis_04 Data Visualization Lecture 7 3D Scalar Visualization Part 2 : Volume Rendering- Introduction.
Advertisements

Reconstruction from Voxels (GATE-540)
Yingcai Xiao Chapter 6 Fundamental Algorithms. Types of Visualization Transformation Types 1.Data (Attribute Transformation) 2.Topology (Topological Transformation)
Direct Volume Rendering. What is volume rendering? Accumulate information along 1 dimension line through volume.
Visualization Data Representation Ray Gasser SCV Visualization Workshop – Fall 2008.
3D Graphics Rendering and Terrain Modeling
Hank Childs, University of Oregon November 15 th, 2013 Volume Rendering, Part 2.
Volume Rendering Volume Modeling Volume Rendering Volume Modeling Volume Rendering 20 Apr
1 Computer Graphics Chapter 7 3D Object Modeling.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
HCI 530 : Seminar (HCI) Damian Schofield.
Splatting Josh Anon Advanced Graphics 1/29/02. Types of Rendering Algorithms Backward mapping Image plane mapped into data Ray casting Forward mapping.
CSE351/ IT351 Modeling And Simulation Choosing a Mesh Model Dr. Jim Holten.
Introduction to Volume Rendering Presented by Zvi Devir.
6.1 Vis_04 Data Visualization Lecture 6 - A Rough Guide to Rendering.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
Scientific Data Representation and Mapping
Geometric Objects and Transformations Geometric Entities Representation vs. Reference System Geometric ADT (Abstract Data Types)
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Volumetric and Blobby Objects Lecture 8 (Modelling)
1 Computer Graphics Week13 –Shading Models. Shading Models Flat Shading Model: In this technique, each surface is assumed to have one normal vector (usually.
lecture 2 : Visualization Basics
COMP 175: Computer Graphics March 24, 2015
Technology and Historical Overview. Introduction to 3d Computer Graphics  3D computer graphics is the science, study, and method of projecting a mathematical.
VTK: Data Shroeder et al. Chapter 5 University of Texas – Pan American CSCI 6361, Spring 2014 After Taku Komura and other lecture sets
Scientific Visualization An Introduction Michel O. R. Eboueya Computer Sciences Department Pôle Sciences et Technologies Université de La Rochelle.
19/18/ :34 Graphics II Volume Rendering Session 10.
Rendering Adaptive Resolution Data Models Daniel Bolan Abstract For the past several years, a model for large datasets has been developed and extended.
CDS 301 Fall, 2009 Vector Visualization Chap. 6 October 7, 2009 Jie Zhang Copyright ©
Lecture 3 : Direct Volume Rendering Bong-Soo Sohn School of Computer Science and Engineering Chung-Ang University Acknowledgement : Han-Wei Shen Lecture.
Scientific Visualization Module 6 Volumetric Algorithms (adapted by S.V. Moore – slides deleted, modified, and added) prof. dr. Alexandru (Alex) Telea.
REAL-TIME VOLUME GRAPHICS Christof Rezk Salama Computer Graphics and Multimedia Group, University of Siegen, Germany Eurographics 2006 Real-Time Volume.
Chapter 3 Digital Representation of Geographic Data.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Direct Volume Rendering (DVR): Ray-casting Jian Huang This set of slides references slides used by Prof. Torsten Moeller (Simon Fraser), Prof. Han-Wei.
Unstructured Volume Rendering Jian Huang, CS 594, Spring 2002 This set of slides reference slides developed by Prof. Torsten Moeller, SFU, Canada.
CMSC 635 Volume Rendering. Volume data  3D Scalar Field: F(x,y,z) = ?  Implicit functions  Voxel grid  Scalar data  Density  Temperature  Wind.
Volume Rendering CMSC 491/635. Volume data  3D Scalar Field: F(x,y,z) = ?  Implicit functions  Voxel grid  Scalar data  Density  Temperature  Wind.
CHAPTER 8 Color and Texture Mapping © 2008 Cengage Learning EMEA.
Scientific Visualization An Introduction Michel O. R. Eboueya Computer Sciences Department Pôle Sciences et Technologies Université de La Rochelle.
Solid Modeling. Solid Modeling - Polyhedron A polyhedron is a connected mesh of simple planar polygons that encloses a finite amount of space. A polyhedron.
3D Volume Visualization. Volume Graphics  Maintains a 3D image representation that is close to the underlying fully-3D object (but discrete)  경계표면 (Boundary.
Volume Visualization Presented by Zhao, hai. What’ volume visualization Volume visualization is the creation of graphical representations of data sets.
112/5/ :54 Graphics II Image Based Rendering Session 11.
Three-Dimensional Object Representation
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Bounding Volume Hierarchy. The space within the scene is divided into a grid. When a ray travels through a scene, it only passes a few boxes within the.
3D Object Representations 2011, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
COMPUTER GRAPHICS CS 482 – FALL 2015 SEPTEMBER 29, 2015 RENDERING RASTERIZATION RAY CASTING PROGRAMMABLE SHADERS.
2/24/2016 A.Aruna/Assistant professor/IT/SNSCE 1.
Data Visualization Fall The Data as a Quantity Quantities can be classified in two categories: Intrinsically continuous (scientific visualization,
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Hardware-Accelerated Parallel Non-Photorealistic Volume Rendering Eric B.Lum Kwan-Liu Ma University of California at Davis.
Robert S. Laramee 1 1 Visualization, Lecture #3 Volume Visualization, Part 1 (of 4)
VTK: The Visualization Toolkit
Volume Visualization Chap. 10 November 20 , 2008 Jie Zhang Copyright ©
Introduction to Graphics Modeling
3D Graphics Rendering PPT By Ricardo Veguilla.
3D Object Representations
CSc4730/6730 Scientific Visualization
Statistical surfaces: DEM’s
Computer Vision Lecture 4: Color
Real-Time Volume Graphics [06] Local Volume Illumination
Domain-Modeling Techniques
Volume Rendering (2).
CSc4730/6730 Scientific Visualization
Volume Rendering.
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Visualization CSE 694L Roger Crawfis The Ohio State University.
Presentation transcript:

Introduction to Volume Visualization Mengxia Zhu Fall 2007

Volume Visualization Volume visualization is used to create images from volumetric data defined on multiple dimensional grids volumetric data is typically a set of samples f(x,y,z,d) with d representing the data property at a location determined by (x,y,z). Timing varying volumetric data f(x, y, z, t, d)

Data Type d can take the form of scalar, vector, or even tensor.  Scalar, Single valued at each location in a dataset. Examples are temperature, pressure, density, and elevation etc. Simplest and most common form. i.e. f of type real, integer  Vector, data with magnitude and direction. In 3D, it is represented as a triplet of values ( u,v,w). Examples include flow velocity, particle trajectory, wind motion, and gradient function.  Tensor, complex mathematical generalizations of vectors and matrices. A tensor of rank 0 is a scalar. Rank 1 is vector, rank 2 is 3x3 matrix. E.g. stress and strain in FEM modeling, which represent the stress and strain at a point in an object under load

Data Elements Volumetric data is usually defined on a cartesian grid two alternative methods defining data elements.  Voxels: sample values are called voxel  Cells: a cuboidal region with voxels at 8 grid corners.

Regular and Irregular Structure A dataset consists of an organizing structure and associated attribute data Characterized according to whether its structure is regular or irregular. If there is a single mathematical relationship within the composing points and cells, a dataset is regular.  Regular data can be implicitly represented efficiently.  Irregular data must be explicitly represented since there is no inherent pattern that can be compactly described. Unstructured data tends to be more general, but requires greater memory and computational resources.

Grid and Lattice Cartesian grids: all elements are identical axis- aligned cubes Regular grid: identical rectangular elements aligned along the axes of the dataset. Rectilinear Grids: aligned along the axes of the dataset. However arbitrary spacing and the data elements themselves are no longer identical. curvilinear Grids: Elements are no longer axis aligned, and again the elements can be non- identical.

Grid Types uniformrectilinearregularcurvilinear Structured Grids: regularirregularhybridcurved Unstructured Grids:

Examples Regular grid Rectilinear grid

Methods The fundamental algorithms are of two types:  direct volume rendering (DVR) algorithms  surface-fitting (SF) algorithms. DVR methods map elements directly into screen space without using intermediate geometric primitives as an intermediate representation. SF methods are also called feature-extraction or iso-surfacing and fit planar polygons or surface patches to constant-value contour surfaces.

WeiWeb/research.htm gadget/hydrosims/ www-vis.lbl.gov/.../ ChomboVis99/sharedvrend.html

DVR versus SF Volume rendering is a process of creating a 2D image directly from 3D volumetric data  Mapping the entire 3D data into a 2D image SF is a process of creating an image of a surface contained within the volume data using geometric primitives  Marching Cubes algorithm (triangles as primitives)  Dividing Cubes algorithm (3D points as primitives) DVR conveys more information than surface rendering images at the cost of increased algorithm complexity and rendering times Volume rendering to display amorphous phenomena such as clouds, fog

Direct Volume Rendering Techniques Object-order technique  Uses a forward mapping scheme where the volume data is mapped into the image plane Image-order technique  Uses a backward mapping scheme where rays are cast from each pixel in the image plane through the volume data to determine the pixel value Hybrid technique  Combines the two approaches

Data Classification Threshold value (Iso-value) for an SF method or the color and opacity values (transfer function) for a DVR method. The DVR color table is used to map data values to meaningful colors. The opacity table is used to expose the part of the volume most interesting to the user and to make transparent the uninteresting parts.

Common Steps in SF Data acquisition either via empirical measurement or computer simulation. Put the data into a format that can be easily manipulated. This may entail scaling the data for a better value distribution, enhancing contrast, filtering out noise, and removing out- of-range data. The data is mapped onto geometric or display primitives. The primitives are stored, manipulated, and displayed.

Interpolation Interpolation assumes that the value of the data element varies across the element. some combination of the surrounding grid points. For example, with trilinear interpolation the value at a arbitrary point in the data element is calculated from the surrounding eight grid points.

Trilinear Interpolation

Trilinear interpolation is the process of taking a three-dimensional set of numbers and interpolating the values linearly, finding a point using a weighted average of eight values.

Shading To create a realistic image, shading with light define how much light each data point received. The gradient is used to approximate the surface normal to an imaginary surface touching the point. Central difference method: