Progressive Transmission and Rendering of Foveated Volume Data

Slides:



Advertisements
Similar presentations
A Graduate Course on Multimedia Technology 3. Multimedia Communication © Wolfgang Effelsberg Media Scaling and Media Filtering Definition of.
Advertisements

CSCE 643 Computer Vision: Template Matching, Image Pyramids and Denoising Jinxiang Chai.
The Lossless JPEG standard y=(a+b)/2 = 145 r= =-35 Category (r) = 6, Magnitude (r) = ’s complement of cat (r) = Rep(35)={6,011100}
Wavelets Fast Multiresolution Image Querying Jacobs et.al. SIGGRAPH95.
A Coherent Grid Traversal Algorithm for Volume Rendering Ioannis Makris Supervisors: Philipp Slusallek*, Céline Loscos *Computer Graphics Lab, Universität.
Progressive Transmission of Appearance Preserving Octree-Textures Camille Perin Web3D 2008 August 9, 2008 Julien LacosteBruno Jobard LIUPPA University.
The Discrete Ray-casting Algorithm Qiang Xue Jiaoying Shi State Key Lab Of CAD&CG Zhejiang University.
1 Symmetrical Pair Scheme: a Load Balancing Strategy to Solve Intra- movie Skewness for Parallel Video Servers Song Wu and Hai Jin Huazhong University.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Error detection and concealment for Multimedia Communications Senior Design Fall 06 and Spring 07.
SWE 423: Multimedia Systems
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Lecture05 Transform Coding.
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
A New Scheme for Progressive Image Transmission and Flexible Reconstruction with DCT Minqing Xing and Xue Dong Yang Department of Computer Science University.
Page 1 CS Department Parallel Design of JPEG2000 Image Compression Xiuzhen Huang CS Department UC Santa Barbara April 30th, 2003.
T.Sharon-A.Frank 1 Multimedia Image Compression 2 T.Sharon-A.Frank Coding Techniques – Hybrid.
Multimedia Data The DCT and JPEG Image Compression Dr Mike Spann Electronic, Electrical and Computer.
E.G.M. PetrakisBinary Image Processing1 Binary Image Analysis Segmentation produces homogenous regions –each region has uniform gray-level –each region.
1 Motivation Video Communication over Heterogeneous Networks –Diverse client devices –Various network connection bandwidths Limitations of Scalable Video.
Fractal Image Compression By Cabel Sholdt and Paul Zeman.
ENG4BF3 Medical Image Processing
Navigating and Browsing 3D Models in 3DLIB Hesham Anan, Kurt Maly, Mohammad Zubair Computer Science Dept. Old Dominion University, Norfolk, VA, (anan,
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
1 Image Compression. 2 GIF: Graphics Interchange Format Basic mode Dynamic mode A LZW method.
: Chapter 12: Image Compression 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Image Segmentation Seminar III Xiaofeng Fan. Today ’ s Presentation Problem Definition Problem Definition Approach Approach Segmentation Methods Segmentation.
Wavelet-based Coding And its application in JPEG2000 Monia Ghobadi CSC561 final project
Efficient Elastic Burst Detection in Data Streams Yunyue Zhu and Dennis Shasha Department of Computer Science Courant Institute of Mathematical Sciences.
Lev Weisfeiler Aware, Inc. Streaming and JPEG2000 Compression for use in Uncompressed Image Archives.
Stylization and Abstraction of Photographs Doug Decarlo and Anthony Santella.
1 Kyung Hee University Chapter 18 Domain Name System.
1 Image Formats. 2 Color representation An image = a collection of picture elements (pixels) Each pixel has a “color” Different types of pixels Binary.
Lecture 7: Intro to Computer Graphics. Remember…… DIGITAL - Digital means discrete. DIGITAL - Digital means discrete. Digital representation is comprised.
3/16/04James R. McGirr1 Interactive Rendering of Large Volume Data Sets Written By : Stefan Guthe Michael Wand Julius Gonser Wolfgang Straβer University.
JPEG.
CS654: Digital Image Analysis
Image Processing A Study in Pixel Averaging Building a Resolution Pyramid With Parallel Computing Denise Runnels and Farnaz Zand.
JPEG. Introduction JPEG (Joint Photographic Experts Group) Basic Concept Data compression is performed in the frequency domain. Low frequency components.
Recall: Gaussian smoothing/sampling G 1/4 G 1/8 Gaussian 1/2 Solution: filter the image, then subsample Filter size should double for each ½ size reduction.
Dense-Region Based Compact Data Cube
Lab 4 HW/SW Compression and Decompression of Captured Image

Catalogs contain hundreds of millions of objects
JPEG Compression What is JPEG? Motivation
Binary Notation and Intro to Computer Graphics
Fractal image compression
JPEG.
Data Compression.
UZAKTAN ALGIILAMA UYGULAMALARI Segmentasyon Algoritmaları
3D Object Representations
Chapter III, Desktop Imaging Systems and Issues: Lesson IV Working With Images
User-Oriented Approach in Spatial and Temporal Domain Video Coding
Copyright © Cengage Learning. All rights reserved.
Representing Moving Images with Layers
Craig Schroeder October 26, 2004
Representing Moving Images with Layers
Introduction To Wavelets
KMeans Clustering on Hadoop Fall 2013 Elke A. Rundensteiner
Fractal Image Compression
Image Processing, Leture #16
JPEG Still Image Data Compression Standard
Image Compression Purposes Requirements Types
Image Coding and Compression
Analysis of Algorithms
Hung, K. -L. and Chang, C. -C. , IEE Image and Signal Processing, vol
Hung, K. -L. and Chang, C. -C. , IEE Image and Signal Processing, vol
A Cell-by-Cell AMR Method for the PPM Hydrodynamics Code
Scalable light field coding using weighted binary images
Presentation transcript:

Progressive Transmission and Rendering of Foveated Volume Data Chen Chen, Zhiyong Huang, Hang Yu, Ee-Chien Chang School of Computing National University of Singapore

Introduction - motivation Problem Large volume data provided by modern scanners like CT and MRI Slow network speed comparing to the large size of volume data Solution Wavelet foveation Progressive transmission and rendering coarse-to-fine region-based 2018/11/19 grapp 2006

Introduction - wavelet foveated volume Foveated volume is a non-uniform sampled volume whose resolution is highest at the fovea (user specified ROI) and falls off as the distance to the fovea increases – priority selection Wavelet foveated volume is constructed by select ROI at each level of details in the volume’s wavelet form - compression 2018/11/19 grapp 2006

Proposed method - overview Transform to Wavelet Form Divide into 83 block, run-length encode (RLE) each block Client request = ROI {(x,y,z),s} Generate Fw Reorder data blocks of Fw Progressive transmission Progressive Rendering 2018/11/19 grapp 2006

Proposed method - overview Client-server volume rendering system Server Side: Input: Cw & ROI{(x,y,z),s} Output: Fw Client Side: Input: Fw Output: Iw1 -> Iw2 -> … -> Iwfinal Two transmission and rendering schemes 2018/11/19 grapp 2006

Proposed method - overview Server Site Client Site Wavelet Transform Cw request Generate Fw from Cw and ROI User Input ROI={(x,y,z),r} Reorder data blocks in Fw according to the schemes Progressive Render RB or CTF Progressive transmission Progressive rendering Display 2018/11/19 grapp 2006

Wavelet transform Divide the volume into blocks of size 2k3 Apply generic Haar wavelet transform on each block to obtain 7 detail blocks and 1 average block Group 8 adjacent blocks to again obtain a block of size 2k3 Repeat this procedure until the average volume reaches size m3 2018/11/19 grapp 2006

Wavelet transform - run-length encoding (RLE) A more compact representation RLE is performed block by block Compressed block will be a list of value(v) and length(l) pairs v= Integer value of a coefficient l = Number of successive v Example: L=1,1,1,1,0,0,5,0,0,0,0,0,0,0,0 R=(1,4),(0,2),(5,1),(0,8) 2018/11/19 grapp 2006

Derive foveated volume Cw, ROI{(x,y,z),s} => Fw Layer 0 image = average image of Cw Layer i image = IWT(layer i-1 image, 7 layer i-1 detail images) ROI in ith layer = ROI in Layer i image 2018/11/19 grapp 2006

Derive foveated volume Center of ROI in ith layer is Size of ROI in ith layer is s3 Boundary of ROI in ith layer can be defined as 2018/11/19 grapp 2006

Derive foveated volume 4th ROI = {(9,9),6} = {[6,11],[6,11]} Layer 3 details (i,j) =([3,5],[3,5]) 2018/11/19 grapp 2006

Progressive transmission - motivation Data size = 10243, Fovea size = 483, Average image size = 163 Maxlayer=Log2(1024/16)=6 Total amount of data = 243*(5*7+1)=497,664 coefficients Reorder data blocks Progressive transfer 2018/11/19 grapp 2006

Progressive transmission - two schemes Coarse-to-fine Description: Transmit a rough average image first and refine the fovea from outer ROIi to inner ROIi+1 Implementation: Send the wavelet foveated data from inner layer to outer layer progressively Region-based Description: Transmit full resolution ROImaxlayer first and expand the image from ROImaxlayer-1 to ROI0 with decreasing resolution Implementation: Data blocks and parent data blocks of ROImaxlayer-i+1 will be sent in ith iteration 2018/11/19 grapp 2006

Progressive transmission - illustration in 2D 2D image size= 128*128, m=16, k=8, ROI={(86,86),45}, maxlayer=3 ROI0={(10,10),45}=[0,15] blk_index=[0,1] ROI1={(21,21),45}=[0,31] blk_index=[0,1] ROI2={(43,43),45}=[20,63] blk_index=[1,3] ROI3={(86,86),45}=[64,107] blk_index=[4,6] 2018/11/19 grapp 2006

Progressive transmission - illustration in 2D 2018/11/19 grapp 2006

Progressive transmission - coarse-to-fine 2018/11/19 grapp 2006

Progressive transmission - coarse-to-fine 2018/11/19 grapp 2006

Progressive transmission - region-based 2018/11/19 grapp 2006

Progressive rendering - rendering equation For each voxel: intensity value opacity value The final intensity result reaches the viewer of each pixel will be Eulerian Sum over accumulated opacity Rendering equation to render a subvolume with same intensity and opacity value 2018/11/19 grapp 2006

Progressive rendering - rendering equation For 2 subvolumes Sa and Sb with size na and nb, voxels in Sa and Sb have , , and , respectively. Sa is in front of Sb, that is, Sa is “over” Sb. The intensity of Sa and Sb and Sfinal can be defined as 2018/11/19 grapp 2006

Region-based - partial volume reconstruction Starting coefficient: Ending coefficient: Wavelet coefficients at ith layer detail image begin: end: Reconstruction starts from layer 0, that is, the average image and move out to higher level of details until the desired resolution is reached 2018/11/19 grapp 2006

Region-based Center fovea is reconstructed using partial volume reconstruction and rendered at iteration 1 6 subvolumes are rendered: Top, Bottom, Left, Right, Front, Back with resolution scale 2(1-i), i is the number of iteration 6 sub volumes are rendered separately and combine the rendered result to the previous rendering image 2018/11/19 grapp 2006

Region-based - image composition Top, bottom, left and right are added to the previous rendering result image at their right position Front and back image needs image composition with the previous rendering result image: (front) over (inner) over (back) “over” operator can be defined as: given image pixel A(da, αa) and B(db, αb) C = A over B dc = da + αa*db αc = αa* αb 2018/11/19 grapp 2006

Region-based - image composition 2018/11/19 grapp 2006

Coarse-to-fine Start rendering from ROI0 to ROImaxlayer Each ROIi except ROImaxlayer can be divided into 7 subvolumes: top, bottom, left, right, front, back and center Center subvolume is the average image of the inner ROI and its rendering result, accumulated density value and opacity value will be kept for next iteration 2018/11/19 grapp 2006

Coarse-to-fine ROIi is constructed by center part of ROIi-1 and level i detail coefficients Number of voxels each coefficient in ROIi represent is 2maxlayer-i Rendering equation for each voxel in ROIi is Rendering result of front and back subvolume RFi and RBi will be take down for next iteration Rendering result of iteration i+1 will be combined with RFi and RBi in iteration i+1 2018/11/19 grapp 2006

Results - direct rendering 2018/11/19 grapp 2006

Results - region-based 2018/11/19 grapp 2006

Results - region-based 2018/11/19 grapp 2006

Results - coarse-to-fine 2018/11/19 grapp 2006

Results - coarse-to-fine 2018/11/19 grapp 2006

Results - time 2018/11/19 grapp 2006

Results - coarse-to-fine 2018/11/19 grapp 2006

Results - coarse-to-fine 2018/11/19 grapp 2006

Results - region-based 2018/11/19 grapp 2006

Results - region-based 2018/11/19 grapp 2006

Results - coarse-to-fine 2018/11/19 grapp 2006

Results - coarse-to-fine 2018/11/19 grapp 2006

Results - region-based 2018/11/19 grapp 2006

Results - region-based 2018/11/19 grapp 2006

Conclusion and future work Two progressive transmission and rendering schemes, region-based and coarse-to-fine Blockwise RLE used in wavelet compression Wavelet foveation Image composition Large memory is still needed cut the data set exceeding a certain amount into smaller data sets and build location map to indicate actual position of each data segments Cache can be used to store frequently used blocks, for example, those high level details 2018/11/19 grapp 2006