LOD Map – A Visual Interface for Navigating Multiresolution Volume Visualization Chaoli Wang and Han-Wei Shen The Ohio State University Presented at IEEE.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

Elastic Hierarchies: Combining Treemaps and Node-Link Diagrams
Point-based Graphics for Estimated Surfaces
Visible-Surface Detection(identification)
1 DATA STRUCTURES USED IN SPATIAL DATA MINING. 2 What is Spatial data ? broadly be defined as data which covers multidimensional points, lines, rectangles,
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
ARIN Public Policy Meeting
Dynamic View Selection for Time-Varying Volumes Guangfeng Ji* and Han-Wei Shen The Ohio State University *Now at Vital Images.
Comparative Visualization for Wave-based and Geometric Acoustics Eduard Deines 1, Martin Bertram 3, Jan Mohring 4, Jevgenij Jegorovs 4, Frank Michel 1,
Multi-variate, Time-varying, and Comparative Visualization with Contextual Cues Jon Woodring and Han-Wei Shen The Ohio State University.
(1) Scalable WIM by Li, Fu and Hanson Yinggang Li *, Chi-Wing Fu +, Andrew Hanson * Department of Computer Science * Indiana University + Hong Kong University.
Importance-Driven Focus of Attention and Meister Eduard Gröller 1 1 Vienna University of Technology, Austria 2 University of Girona, Spain 3 University.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Iterative Equalization and Decoding
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
1GR2-00 GR2 Advanced Computer Graphics AGR Lecture 18 Image-based Rendering Final Review of Rendering What We Did Not Cover Learning More...
15.1 Vis_04 Data Visualization Lecture 15 Information Visualization : Part 3.
GR2 Advanced Computer Graphics AGR
ENV 2006 CS4.1 Envisioning Information: Case Study 4 Focus and Context for Volume Visualization.
ZMQS ZMQS
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
SC05 Time-Varying Visualization Workshop Toward Effective Visualization of Ultra-scale Time-Varying Data Han-Wei Shen Associate Professor The Ohio State.
ABC Technology Project
-Based Workload Estimation for Mobile 3D Graphics
Capacity-Approaching Codes for Reversible Data Hiding Weiming Zhang, Biao Chen, and Nenghai Yu Department of Electrical Engineering & Information Science.
© S Haughton more than 3?
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
Squares and Square Root WALK. Solve each problem REVIEW:
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Fast Depth-of-Field Rendering with Surface Splatting Jaroslav Křivánek CTU Prague IRISA – INRIA Rennes Jiří Žára CTU Prague Kadi Bouatouch IRISA – INRIA.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
Technische Universität München Fakultät für Informatik Computer Graphics SS 2014 Sampling Rüdiger Westermann Lehrstuhl für Computer Graphik und Visualisierung.
Week 1.
We will resume in: 25 Minutes.
1 Unit 1 Kinematics Chapter 1 Day
University of Minnesota Optimizing MapReduce Provisioning in the Cloud Michael Cardosa, Aameek Singh†, Himabindu Pucha†, Abhishek Chandra
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
Mani Srivastava UCLA - EE Department Room: 6731-H Boelter Hall Tel: WWW: Copyright 2003.
How Cells Obtain Energy from Food
1 Zi Yang, Wei Li, Jie Tang, and Juanzi Li Knowledge Engineering Group Department of Computer Science and Technology Tsinghua University, China {yangzi,
Adaptive Segmentation Based on a Learned Quality Metric
Visibility Culling using Hierarchical Occlusion Maps Hansong Zhang, Dinesh Manocha, Tom Hudson, Kenneth E. Hoff III Presented by: Chris Wassenius.
A Multiresolution Volume Rendering Framework for Large-Scale Time- Varying Data Visualization Chaoli Wang 1, Jinzhu Gao 2, Liya Li 1, Han-Wei Shen 1 1.
Interactive Time-Dependent Tone Mapping Using Programmable Graphics Hardware Nolan GoodnightGreg HumphreysCliff WoolleyRui Wang University of Virginia.
Euro-Par, A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments Qian Zhu and Gagan Agrawal Department of.
Tone Mapping on GPUs Cliff Woolley University of Virginia Slides courtesy Nolan Goodnight.
BARCODE IDENTIFICATION BY USING WAVELET BASED ENERGY Soundararajan Ezekiel, Gary Greenwood, David Pazzaglia Computer Science Department Indiana University.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
FlowGraph: A Compound Hierarchical Graph for Flow Field Exploration Jun Ma, Chaoli Wang, Ching-Kuang Shene Michigan Technological University Presented.
PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson
Large Scale Time-Varying Data Visualization Han-Wei Shen Department of Computer and Information Science The Ohio State University.
3/16/04James R. McGirr1 Interactive Rendering of Large Volume Data Sets Written By : Stefan Guthe Michael Wand Julius Gonser Wolfgang Straβer University.
Electronic Visualization Laboratory University of Illinois at Chicago “Time-Critical Multiresolution Volume Rendering using 3D Texture Mapping Hardware”
ITree: Exploring Time-Varying Data using Indexable Tree Yi Gu and Chaoli Wang Michigan Technological University Presented at IEEE Pacific Visualization.
Comp 15 - Usability & Human Factors Unit 12b - Information Visualization This material was developed by Columbia University, funded by the Department of.
On the Death of SciVis Han-Wei Shen
Presentation transcript:

LOD Map – A Visual Interface for Navigating Multiresolution Volume Visualization Chaoli Wang and Han-Wei Shen The Ohio State University Presented at IEEE Visualization 2006

2 Large Data Sets –The Visible Woman 512 * 512 * 1728 Short integer (16 bits) 864MB –Richtmyer-Meshkov Instability (RMI) 2048 * 2048 * 1920 Byte integer (8 bits) 7.5 GB per time step, 2TB in total

3 Motivation Large data size makes interactive visualization difficult –High main / texture memory requirement –Slower rendering speed Multiresolution volume visualization –Adaptive data exploration – Overview first, zoom and filter, and then details-on- demand [ Shneiderman 1992 ]

4 Multiresolution Data Representation low-pass filtered subblockwavelet coefficients The wavelet tree [Guthe et al. 2002] –Octree-based space partition –Block-wise wavelet transform and compression –Error metric calculation

5 Research Questions How to measure and compare the quality of different LOD selections? Are the computing resources effectively distributed? Can we visualize what are being selected and make changes?

6 Our Approach LOD entropy – LOD quality index –Employ information theory –Measure information contained in the LOD LOD map – visual representation of LOD quality –A single number vs. a visual interface –Immediate suggestions for LOD improvement –Interactive techniques for LOD adjustment

7 Shannon Entropy The source takes a sequence of finite symbols {a 1, a 2, a 3, …, a M } with probabilities {p 1, p 2, p 3, …, p M } The amount of information contained is defined as The entropy function is maximized when p i are all equal An example of 3D probability vector {p 1, p 2, p 3 } [Bordoloi and Shen 2005]

8 Probability Definition Entropy: where C i : contribution of data block i to the image D i : distortion of data block i with its child blocks M : total number of data blocks in the hierarchy A global quality index –Quality of rendered images –Probability distribution of all data blocks equal probability! C D

9 Contribution: : mean value : average thickness : screen projection area : estimated visibility Contribution

10 : mean value : standard deviation : covariance between b i and b j and : small constants Distortion: (a) covariance (b) luminance distortion (c) contrast distortion Distortion (a)(b)(c) i j

11 Treemap A space-filling method to visualize hierarchical information [Shneiderman et al. 1992] –Recursive subdivision of a given display area –Information of each individual node Color and size of its bounding rectangle …… …

12 LOD Map Treemap representation of a LOD –User interface for visual LOD selections –Observe individual blocks and make adjustments –Information mapping Distortion D : maps to the color of rectangle Contribution C : – maps to the size of rectangle – maps to its opacity

13 LOD Map – A First Look entropy = 0.238

14 How Can LOD Map Help? Balance probability distribution Large rectangles with bright red colors –Highly-visible –High contribution, large distortion –Split to increase resolutions (C D) Small blue rectangles –Low contribution, small distortion –Join to decrease resolutions (C D) Dark rectangles –Lowest visibility –Join to decrease resolutions (C D)

15 Results – LOD Comparison MSE-based 67 blocksentropy = 0.163level-based, 67 blocksentropy = 0.381

16 Results – LOD Comparison

17 Results – View Comparison entropy = 0.330entropy = 0.343entropy = 0.384entropy = 0.390

18 Results – LOD Adjustment entropy = 0.192entropy = 0.386entropy = 0.251entropy = before, 90 blocksafter, 90 blocksbefore, 108 blocksafter, 108 blocks

19 Results – Budget Control before, 365 blocks, entropy = after, 274 blocks, entropy = 0.476

20 Summary & Future Work Summary –LOD entropy – quality measure –LOD map – visual navigation interface –Effectiveness and efficiency Future work –Time-critical rendering –Eye-tracking application –Time-varying data visualization

21 Acknowledgements Data sets –National Library of Medicine –Lawrence Livermore National Laboratory Funding agencies –National Science Foundation –Department of Energy –Oak Ridge National Laboratory