VOTS VOlume doTS as Point-based Representation of Volumetric Data S. Grimm, S. Bruckner, A. Kanitsar and E. Gröller Institute of Computer Graphics and.

Slides:



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

Real-Time Template Tracking
Non-Gaussian Statistical Timing Analysis Using Second Order Polynomial Fitting Lerong Cheng 1, Jinjun Xiong 2, and Lei He 1 1 EE Department, UCLA *2 IBM.
DETC ASME Computers and Information in Engineering Conference ONE AND TWO DIMENSIONAL DATA ANALYSIS USING BEZIER FUNCTIONS P.Venkataraman Rochester.
Adapting Ocean Surveys to the Observed Fields Characteristics Maria-João Rendas I3S, CNRS-UNSA.
Szirmay-Kalos László Magdics Milán Tóth Balázs
Patch-based Image Deconvolution via Joint Modeling of Sparse Priors Chao Jia and Brian L. Evans The University of Texas at Austin 12 Sep
CS 551 / CS 645 Antialiasing. What is a pixel? A pixel is not… –A box –A disk –A teeny tiny little light A pixel is a point –It has no dimension –It occupies.
Robust Object Tracking via Sparsity-based Collaborative Model
MATHIEU GAUTHIER PIERRE POULIN LIGUM, DEPT. I.R.O. UNIVERSITÉ DE MONTRÉAL GRAPHICS INTERFACE 2009 Preserving Sharp Edges in Geometry Images.
Semi-Automatic Topology Independent Contour-Based 2 1/2 D Segmentation Using Live-Wire Semi-Automatic Topology Independent Contour-Based 2 1/2 D Segmentation.
Classification and Prediction: Regression Via Gradient Descent Optimization Bamshad Mobasher DePaul University.
GeomCell Design of Cell Geometry Július Parulek 1,2, Miloš Šrámek 2,3 and Ivan Zahradník 1 (1) Institute of Molecular Physiology and Genetics, Slovak Academy.
GATE D Object Representations (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager SimBT.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Efficient Multidimensional Packet Classification with Fast Updates Author: Yeim-Kuan Chang Publisher: IEEE TRANSACTIONS ON COMPUTERS, VOL. 58, NO. 4, APRIL.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
Final Gathering on GPU Toshiya Hachisuka University of Tokyo Introduction Producing global illumination image without any noise.
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
Memory Efficient Acceleration Structures and Techniques for CPU-based Volume Raycasting of Large Data S. Grimm, S. Bruckner, A. Kanitsar and E. Gröller.
Optimized Subdivisions for Preprocessed Visibility Oliver Mattausch, Jiří Bittner, Peter Wonka, Michael Wimmer Institute of Computer Graphics and Algorithms.
Feature Screening Concept: A greedy feature selection method. Rank features and discard those whose ranking criterions are below the threshold. Problem:
Hardware-Based Nonlinear Filtering and Segmentation using High-Level Shading Languages I. Viola, A. Kanitsar, M. E. Gröller Institute of Computer Graphics.
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
Spectral Processing of Point-sampled Geometry
Lecture 07: Terrain Analysis Geography 128 Analytical and Computer Cartography Spring 2007 Department of Geography University of California, Santa Barbara.
CSE 681 Ray Tracing Implicit Surfaces. CSE 681 Overview Similar to CSG –Combine primitive objects to form complex object Primitives are “density fields”
Volumetric and Blobby Objects Lecture 8 (Modelling)
Tutorial 5: Numerical methods - buildings Q1. Identify three principal differences between a response function method and a numerical method when both.
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Target Tracking with Binary Proximity Sensors: Fundamental Limits, Minimal Descriptions, and Algorithms N. Shrivastava, R. Mudumbai, U. Madhow, and S.
Efficient Volume Visualization of Large Medical Datasets Stefan Bruckner Institute of Computer Graphics and Algorithms Vienna University of Technology.
DTU Medical Visionday May 27, 2009 Generative models for automated brain MRI segmentation Koen Van Leemput Athinoula A. Martinos Center for Biomedical.
CS 551/651 Advanced Computer Graphics Warping and Morphing Spring 2002.
V. Space Curves Types of curves Explicit Implicit Parametric.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Jeff Howbert Introduction to Machine Learning Winter Regression Linear Regression.
Statistical Sampling-Based Parametric Analysis of Power Grids Dr. Peng Li Presented by Xueqian Zhao EE5970 Seminar.
Transductive Regression Piloted by Inter-Manifold Relations.
Real-time Graphics for VR Chapter 23. What is it about? In this part of the course we will look at how to render images given the constrains of VR: –we.
Characteristic Point Maps Hongzhi Wu Julie Dorsey Holly Rushmeier (presented by Patrick Paczkowski) Computer Graphics Lab Yale University.
1 Complex Images k’k’ k”k” k0k0 -k0-k0 branch cut   k 0 pole C1C1 C0C0 from the Sommerfeld identity, the complex exponentials must be a function.
Lecture 4: Statistics Review II Date: 9/5/02  Hypothesis tests: power  Estimation: likelihood, moment estimation, least square  Statistical properties.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
AS-RIGID-AS-POSSIBLE SHAPE MANIPULATION
Evaluation of a Bricked Volume Layout for a Medical Workstation based on Java Peter Kohlmann, Stefan Bruckner, Armin Kanitsar, M. Eduard Gröller Institute.
Z TRANSFORM AND DFT Z Transform
Scene Completion Using Millions of Photographs James Hays, Alexei A. Efros Carnegie Mellon University ACM SIGGRAPH 2007.
Hardware-accelerated Point-based Rendering of Surfaces and Volumes Eduardo Tejada, Tobias Schafhitzel, Thomas Ertl Universität Stuttgart, Germany.
Optimal Component Analysis Optimal Linear Representations of Images for Object Recognition X. Liu, A. Srivastava, and Kyle Gallivan, “Optimal linear representations.
Authors: I. Viola, A. Kanitsar, M. Gr ö ler Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria Importance Driven Volume.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Digital Signal Processing
Learning Photographic Global Tonal Adjustment with a Database of Input / Output Image Pairs.
Active Learning and the Importance of Feedback in Sampling Rui Castro Rebecca Willett and Robert Nowak.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Deutscher Wetterdienst Flux form semi-Lagrangian transport in ICON: construction and results of idealised test cases Daniel Reinert Deutscher Wetterdienst.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Contextual Snapshots: Enriched Visualization with Interactive Spatial Annotations Peter Mindek 1, Stefan Bruckner 2,1 and M. Eduard Gröller 1 1 Institute.
CHC ++: Coherent Hierarchical Culling Revisited Oliver Mattausch, Jiří Bittner, Michael Wimmer Institute of Computer Graphics and Algorithms Vienna University.
Jianchao Yang, John Wright, Thomas Huang, Yi Ma CVPR 2008 Image Super-Resolution as Sparse Representation of Raw Image Patches.
Dense-Region Based Compact Data Cube
Image Primitives and Correspondence
Chapter 12 Curve Fitting : Fitting a Straight Line Gab-Byung Chae
Filtering and State Estimation: Basic Concepts
Lecture # 2 MATHEMATICAL STATISTICS
Boolean Operations for Free-form Models Represented in Geometry Images
Uncertainty Propagation
Presentation transcript:

VOTS VOlume doTS as Point-based Representation of Volumetric Data S. Grimm, S. Bruckner, A. Kanitsar and E. Gröller Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna, Austria

Sören GrimmVienna University of Technology Motivation (1/3) Volumetric data: Processing is sampled based Processing is sampled based Given on grid structure, e.g. regular grid Given on grid structure, e.g. regular gridAdvantages: Efficient spatial addressing Efficient spatial addressing Efficient processing, such as rendering, segmentation, etc. Efficient processing, such as rendering, segmentation, etc.

Sören GrimmVienna University of Technology Motivation (2/3) Rigid shape of grids is a limitation factor: Sizes are enormously increasing Sizes are enormously increasing Often just parts are of interest Often just parts are of interest Difficult to perform deformations Difficult to perform deformations Difficult to analytically analyze the data Difficult to analytically analyze the data

Sören GrimmVienna University of Technology Motivation (3/3) Information dependent storage requirement Information dependent storage requirement Allow to leverage resources Allow to leverage resources Inhomogeneous → grid is efficient Partially inhomogeneous → grid is inefficient

Sören GrimmVienna University of Technology What is a VOT (1/2) A VOT is basically a thick Volumetric Point Represents a region by polynomial Represents a region by polynomial It consists of: It consists of:  Coefficients of Taylor series, position, and a validity area 100 samples 7 VOTS

Sören GrimmVienna University of Technology What is a VOT (2/2) VOT Evaluation: Evaluation of Taylor series expansion

Sören GrimmVienna University of Technology Outline

Sören GrimmVienna University of Technology Generation of a VOT Taylor series expansion: For practical reasons: N = 3

Sören GrimmVienna University of Technology Cell to VOT conversion Cell

Sören GrimmVienna University of Technology Point cloud to VOT conversion (1/4) m scattered data points VOT: Function Fitting?

Sören GrimmVienna University of Technology Point cloud to VOT conversion (2/4) Original data values Reconstructed values by Taylor series Linear regression: Minimizing sum-of-squares 20 unknowns, due to symmetry →

Sören GrimmVienna University of Technology Taking the partial derivatives with respect to the 20 unknowns Point cloud to VOT conversion (3/4)

Sören GrimmVienna University of Technology Point cloud to VOT conversion (4/4) Setting derivatives to zero, leads to a system of linear equations: Inversion of M produces the coefficients

Sören GrimmVienna University of Technology Outline

Sören GrimmVienna University of Technology Grid to VOTS conversion (1/2) Growing approach: For all sample positions grow a VOT For all sample positions grow a VOT  Size of VOT bounded by specified max error Outcome: VOT candidates Outcome: VOT candidates A small subset of these VOTS is chosen, so that they completely cover the underlying volumetric data A small subset of these VOTS is chosen, so that they completely cover the underlying volumetric data

Sören GrimmVienna University of Technology Grid to VOTS conversion (2/2) Goal: small number of large VOTS covering entire volume (small overlap) Goal: small number of large VOTS covering entire volume (small overlap) Sort VOT candidates according to size While space not covered Select largest VOT candidate Update size of remaining candidates Re-sort VOT candidates

Sören GrimmVienna University of Technology Outline

Sören GrimmVienna University of Technology Maximum Intensity Projection (1/2) Maximum value along a ray: Regular grid→ sample based determined Regular grid→ sample based determined VOTS → analytically determined VOTS → analytically determined

Sören GrimmVienna University of Technology Maximum Intensity Projection (2/2) For all VOTS For all VOTS  MIP textures are created  Send to graphics hardware Graphics hardware is used to perform maximum-blending Graphics hardware is used to perform maximum-blending Viewing direction

Sören GrimmVienna University of Technology Results  -error 0.01%0.1%1%10% Head: #VOTs 570 K 538 K 333 K 35 K Lobster: #VOTs 114 K 112 K 60 K Head 1.7 M samples Lobster 500K samples VOTS Distribution & Maximum Intensity Projection

Sören GrimmVienna University of Technology Conclusion We proposed a new representation of volumetric data: VOTS Intuitive and constructive representation Intuitive and constructive representation Allow user-centric importance sampling Allow user-centric importance sampling Allow to leverage resources Allow to leverage resources Information dependent storage requirement Information dependent storage requirement Allow to analytically process the data Allow to analytically process the data No connectivity for reconstruction is needed No connectivity for reconstruction is needed

Sören GrimmVienna University of Technology Future Work Conversion of other grid/data structures Conversion of other grid/data structures Sparse volumes Sparse volumes More sophisticated conversion technique More sophisticated conversion technique Blending between VOTS Blending between VOTS Efficient rendering method Efficient rendering method Exploit derivative information Exploit derivative information New visualization techniques New visualization techniques Investigate filter possibilities Investigate filter possibilities

Thank you for your attention Institute of Computer Graphics and Algorithms Sponsored by: Tiani MedGraph AG