Spectral Analysis of Function Composition and Its Implications for Sampling in Direct Volume Visualization Steven Bergner GrUVi-Lab/SFU Torsten Möller.

Slides:



Advertisements
Similar presentations
Advanced Piloting Cruise Plot.
Advertisements

1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Chapter 1 The Study of Body Function Image PowerPoint
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 1 Embedded Computing.
Author: Julia Richards and R. Scott Hawley
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
UNITED NATIONS Shipment Details Report – January 2006.
Comparative Visualization for Wave-based and Geometric Acoustics Eduard Deines 1, Martin Bertram 3, Jan Mohring 4, Jevgenij Jegorovs 4, Frank Michel 1,
Exploded Views for Volume Data Stefan Bruckner, M. Eduard Gröller Institute of Computer Graphics and Algorithms Vienna University of Technology.
MIT 2.71/2.710 Optics 10/25/04 wk8-a-1 The spatial frequency domain.
The imaging problem object imaging optics (lenses, etc.) image
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Summary of Convergence Tests for Series and Solved Problems
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
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions
2010 fotografiert von Jürgen Roßberg © Fr 1 Sa 2 So 3 Mo 4 Di 5 Mi 6 Do 7 Fr 8 Sa 9 So 10 Mo 11 Di 12 Mi 13 Do 14 Fr 15 Sa 16 So 17 Mo 18 Di 19.
1. 2 Unknown Backprojection usually produce a blurred version of the image.
Solve Multi-step Equations
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
Mathematics for Economics Beatrice Venturi 1 Economics Faculty CONTINUOUS TIME: LINEAR DIFFERENTIAL EQUATIONS Economic Applications LESSON 2 prof. Beatrice.
Digital Filter Banks The digital filter bank is set of bandpass filters with either a common input or a summed output An M-band analysis filter bank is.
DOROTHY Design Of customeR dRiven shOes and multi-siTe factorY Product and Production Configuration Method (PPCM) ICE 2009 IMS Workshops Dorothy Parallel.
Randomized Algorithms Randomized Algorithms CS648 1.
ABC Technology Project
5-1 Chapter 5 Theory & Problems of Probability & Statistics Murray R. Spiegel Sampling Theory.
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
2 |SharePoint Saturday New York City
VOORBLAD.
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
15. Oktober Oktober Oktober 2012.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
IPIM, IST, José Bioucas, Convolution Operators Spectral Representation Bandlimited Signals/Systems Inverse Operator Null and Range Spaces Sampling,
Constant, Linear and Non-Linear Constant, Linear and Non-Linear
BIOLOGY AUGUST 2013 OPENING ASSIGNMENTS. AUGUST 7, 2013  Question goes here!
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Squares and Square Root WALK. Solve each problem REVIEW:
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
© 2012 National Heart Foundation of Australia. Slide 2.
Universität Kaiserslautern Institut für Technologie und Arbeit / Institute of Technology and Work 1 Q16) Willingness to participate in a follow-up case.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
S Transmission Methods in Telecommunication Systems (5 cr)
25 seconds left…...
H to shape fully developed personality to shape fully developed personality for successful application in life for successful.
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.
Januar MDMDFSSMDMDFSSS
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Intracellular Compartments and Transport
PSSA Preparation.
Essential Cell Biology
1 Chapter 13 Nuclear Magnetic Resonance Spectroscopy.
Math Review with Matlab:
Presentation transcript:

Spectral Analysis of Function Composition and Its Implications for Sampling in Direct Volume Visualization Steven Bergner GrUVi-Lab/SFU Torsten Möller Daniel Weiskopf David J Muraki Dept. of Mathematics/SFU

Overview Frequency domain intuition Function Composition in Frequency Domain Application to Adaptive Sampling Future Directions

Frequency domain standard analysis tool Intuition Analysis Application Motivation Frequency domain standard analysis tool Assumption of band-limitedness we know how to sample in the spatial domain Given by Nyquist frequency f

Sampling in Frequency domain Intuition Analysis Application Sampling in Frequency domain  F f(x) f  F Wie komme ich mit den wenigsten samplen aus??  F x f

Convolution Theorem Spatial Domain: Frequency Domain:  F Convolution: Intuition Analysis Application Convolution Theorem Spatial Domain: Frequency Domain:  F Convolution: Multiplication:

Combining 2 different signals Intuition Analysis Application Combining 2 different signals Convolution / Multiplication: E.g. filtering in the spatial domain => multiplication in the frequency domain Compositing: What about

Opacity f Transfer Function g Map data value f to optical properties, such as opacity and colour Then shading+compositing g(f(x)) Opacity f g

Estimates for band-limit of h(x) Intuition Analysis Application Estimates for band-limit of h(x) Considering M. Kraus et al. Can be a gross over-estimation Our solution

Example of g(f(x)) Original function f(x) g(f(x)) sampled by Intuition Analysis Application Example of g(f(x)) Original function f(x) g(f(x)) sampled by Transfer function g(y) g(f(x)) sampled by The actual sampling rate is actual four times as much - that’s good for doing linear interpolation …

Analysis of Composition in Frequency Domain

Composition in Frequency Domain Intuition Analysis Application Composition in Frequency Domain y y

Composition as Integral Kernel Intuition Analysis Application Composition as Integral Kernel

Intuition Analysis Application Visualizing P(k,l)

Slopes of lines in P(k,l) are related to 1/f‘(x) Intuition Analysis Application Visualizing P(k,l) Slopes of lines in P(k,l) are related to 1/f‘(x) Extremal slopes bounding the wedge are 1/max(f’)

Contribution insignificant for rapidly changing Intuition Analysis Application Analysis of P(k,l) For general Contribution insignificant for rapidly changing Contributions large when These points are called points of stationary phase: The largest such k is of interest:

Second order Taylor expansion Exponential drop-off Intuition Analysis Application Exponential decay Second order Taylor expansion Exponential drop-off

Adaptive Sampling for Raycasting Application Adaptive Sampling for Raycasting

Compute the gradient-magnitude volume Intuition Analysis Application Adaptive Raycasting Compute the gradient-magnitude volume For each point along a ray - determine max|f’| in a local neighborhood Use this to determine stepping distance

Adaptive sampling - 25% less samples Intuition Analysis Application Adaptive Raycasting Adaptive sampling - 25% less samples Uniform sampling Fig. 5. Examples of hipiph data set sampled at a fixed rate (0.5) (a) and sampled with adaptive stepping (b). The adaptive method in (b) uses about 25% fewer samples than (a) only measuring in areas of non-zero opacity to not account for effects of empty-space skipping. The similarity of both images indicates that visual quality is preserved in the adaptive, reduced sampling.

Adaptive Raycasting Same number of samples Intuition Analysis Application Adaptive Raycasting Same number of samples

Adaptive Raycasting SNR Intuition Analysis Application Adaptive Raycasting SNR Ground-truth: computed at a fixed sampling distance of 0.06125 unit grid point spacing of 1. The result of the evaluation is shown in Figure 6. The error plot is based on the signal to noise ratio (SNR), computed as Fig. 6. Quality vs. performance, where quality is measured using signal to noise ratio (SNR) and performance is indicated by the number of samples taken along all rays cast into the volume. Adaptive sampling clearly outperforms the uniform (fixed) sampling. Only samples in areas of non-zero opacity are taken into account, i.e., both sampling schemes equally make use of empty space skipping.

Pre-integration approach Intuition Analysis Application Pre-integration approach Standard fix for high-quality rendering Assumes linearity of f between sample points Fails for High-dynamic range data Multi-dimensional transfer function Shading approximation between samples A return to direct computation of integrals is possible

Future directions Exploit statistical measures of the data contained in P(k,l) Combined space-frequency analysis Other interpretations of g(f(x)) change in parametrization of g activation function in artificial neural networks Fourier Volume Rendering

Proper sampling of combined signal g(f(x)): Intuition Analysis Applications Summary Proper sampling of combined signal g(f(x)): Solved a fundamental problem of rendering Applicable to other areas Use the ideas for better algorithms

Acknowledgements NSERC Canada BC Advanced Systems Institute Canadian Foundation of Innovation

Thanks… … for your attention! Any Questions?

Transfer Functions (TFs) Intuition Analysis Application Transfer Functions (TFs) a(g) RGB(g) a Simple (usual) case: Map data value g to color and opacity g Shading, Compositing… Human Tooth CT For the most part, TFs map from the data values to color and opacity:RGBa. So in this TF, I have three ranges of values which receive opacity, according to these tents, And within those ranges I’m assigning constant colors: red, cyan, yellow. Here’s a sample dataset. When we map the values through the transfer function, we get Colors and opacities, since, the data values are the DOMAIN of the transfer function, and the Colors and opacities are the range. But the important thing is that color and opacity are something tangible, as far as graphics operations, So then we can apply shading and compositing algorithms to produce a final rendering. This is a volume rendering of this dataset, using this transfer function.

Motivation - Volume Rendering Intuition Analysis Application Motivation - Volume Rendering Convolution used all the time: interpolation ray-casting multi-resolution pyramids gradient estimation Compositing used all the time: transfer functions Given Needed

Assume a linear function f(x) = ax Intuition Analysis Application Analysis of P(k,l) Assume a linear function f(x) = ax If phase is zero - integral infinite Non-zero - integral is zero

Intuition Analysis Application Analysis of P(k,l)

Proper sampling of g(f(x)) Intuition Analysis Application Proper sampling of g(f(x)) Our solution: