Progressive Encoding of Complex Iso-Surfaces Peter Schröder Caltech ASCI Alliance Center for Simulation of Dynamic Response of Materials Joint work with:

Slides:



Advertisements
Similar presentations
Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Advertisements

Multilevel Streaming for Out-of-Core Surface Reconstruction
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Surface Compression with Geometric Bandelets Gabriel Peyré Stéphane Mallat.
T h e U n i v e r s i t y o f B r i t i s h C o l u m b i a Bi-Level Image Compression EECE 545: Data Compression by Dave Tompkins.
Angle-Analyzer: A Triangle-Quad Mesh Codec Haeyoung Lee USC Mathieu Desbrun USC Pierre Alliez INRIA.
Robust Repair of Polygonal Models Tao Ju Rice University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
Efficient Sparse Voxel Octrees
Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
Progressive Encoding of Complex Isosurfaces Haeyoung Lee Mathieu Desbrun Peter Schröder USC USC Caltech.
Frédéric Payan PhD Thesis Supervisor : Marc Antonini
Spherical Parameterization and Remeshing Emil Praun, University of Utah Hugues Hoppe, Microsoft Research.
1 Displaced Subdivision Surfaces Aaron Lee Princeton University Henry Moreton Nvidia Hugues Hoppe Microsoft Research.
Compressing Texture Coordinates Martin IsenburgJack Snoeyink University of North Carolina at Chapel Hill with h Selective Linear Predictions.
Application of Generalized Representations for Image Compression Application of Generalized Representations for Image Compression using Vector Quantization.
Max-Plank Institut für Informatik systematic error parallelogram rule polygonal rules exact prediction Geometry Prediction for High Degree Polygons Martin.
Compressing Hexahedral Volume Meshes Martin Isenburg UNC Chapel Hill Pierre Alliez INRIA Sophia-Antipolis.
Department of Computer Engineering University of California at Santa Cruz Data Compression (3) Hai Tao.
Martin Isenburg University of North Carolina at Chapel Hill Triangle Fixer: Edge-based Connectivity Compression.
Surface Simplification & Edgebreaker Compression for 2D Cel Animations Vivek Kwatra & Jarek Rossignac GVU Center, College of Computing Georgia Institute.
Lossless Compression of Floating-Point Geometry Martin Isenburg UNC Chapel Hill Peter Lindstrom LLNL Livermore Jack Snoeyink UNC Chapel Hill.
With Parallelogram Prediction Compressing Polygon Mesh Geometry Martin Isenburg UNC Chapel Hill Pierre Alliez INRIA Sophia-Antipolis.
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Robust Adaptive Meshes for Implicit Surfaces Afonso Paiva Hélio Lopes Thomas Lewiner Matmidia - Departament of Mathematics – PUC-Rio Luiz Henrique de Figueiredo.
Compressing the Property Mapping of Polygon Meshes Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill.
Compressing Polygon Mesh Connectivity
Frederic Payan, Marc Antonini
JPEG Still Image Data Compression Standard
Image deblocking using local segmentation By Mirsad Makalic Supervisor: Dr. Peter Tischer.
Seminar 1 Surface Rendering, Decimation Presented By Sonali Barua Date:10/31/2005.
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
Smooth Geometry Images Frank Losasso, Hugues Hoppe, Scott Schaefer, Joe Warren.
Embedded Zerotree Wavelet Embedded Zerotree Wavelet - An Image Coding Algorithm Shufang Wu Friday, June 14,
Clustering Vertices of 3D Animated Meshes
Still Image Conpression JPEG & JPEG2000 Yu-Wei Chang /18.
Context-Based Adaptive Entropy Coding Xiaolin Wu McMaster University Hamilton, Ontario, Canada.
Erik de Jong & Willem Bouma.  Arithmetic Coding  Octree  Compression  Surface Approximation  Child Cells Configurations  Single Child cell configurations.
Compressing Multiresolution Triangle Meshes Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo Department of Computer and Information Sciences.
 Coding efficiency/Compression ratio:  The loss of information or distortion measure:
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
Estimation-Quantization Geometry Coding using Normal Meshes
Wavelet Transform-Based Data Compression and its Application to the Meteorological Data Sets Dr. Ning Wang and Dr. Renate Brummer 7 May 2003.
So far we have covered … Basic visualization algorithms Parallel polygon rendering Occlusion culling They all indirectly or directly help understanding.
A hardware-Friendly Wavelet Entropy Codec for Scalable video Hendrik Eeckhaut ELIS-PARIS Ghent University Belgium.
Semi-regular 3D mesh progressive compression and transmission based on an adaptive wavelet decomposition 21 st January 2009 Wavelet Applications in Industrial.
Click to edit Master title style HCCMeshes: Hierarchical-Culling oriented Compact Meshes Tae-Joon Kim 1, Yongyoung Byun 1, Yongjin Kim 2, Bochang Moon.
Interactive Rendering With Coherent Ray Tracing Eurogaphics 2001 Wald, Slusallek, Benthin, Wagner Comp 238, UNC-CH, September 10, 2001 Joshua Stough.
CSE554Fairing and simplificationSlide 1 CSE 554 Lecture 6: Fairing and Simplification Fall 2012.
Spectral Compression of Mesh Geometry (Karni and Gotsman 2000) Presenter: Eric Lorimer.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson
CSE554Contouring IISlide 1 CSE 554 Lecture 5: Contouring (faster) Fall 2015.
CSE554Contouring IISlide 1 CSE 554 Lecture 3: Contouring II Fall 2011.
CSE554Contouring IISlide 1 CSE 554 Lecture 5: Contouring (faster) Fall 2013.
CASA 2006 CASA 2006 A Skinning Approach for Dynamic Mesh Compression Khaled Mamou Titus Zaharia Françoise Prêteux.
Fifth International Conference on Curves and Surfaces Incremental Selective Refinement in Hierarchical Tetrahedral Meshes Leila De Floriani University.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Reducing Artifacts in Surface Meshes Extracted from Binary Volumes R. Bade, O. Konrad and B. Preim efficient smoothing of iso-surface meshes Plzen - WSCG.
Streaming Compressed 3D Data on the Web using JavaScript and WebGL Université de Lyon, INSA-Lyon LIRIS UMR CNRS 5205 Guillaume Lavoué Florent Dupont Velvet.
A novel approach to visualizing dark matter simulations
CSE 554 Lecture 5: Contouring (faster)
IMAGE COMPRESSION.
FHTW Wavelet Based Video Compression Using Long Term Memory Motion-Compensated Prediction and Context-based Adaptive Arithmetic Coding D.Marpe, H.L.Cycon,
So far we have covered … Basic visualization algorithms
A Brief History of 3D MESH COMPRESSION ORAL, M. ELMAS, A.A.
Embedded Zerotree Wavelet - An Image Coding Algorithm
Modified advanced image coding
Pyramid coder with nonlinear prediction
Wavelet-based Compression of 3D Mesh Sequences
Presentation transcript:

Progressive Encoding of Complex Iso-Surfaces Peter Schröder Caltech ASCI Alliance Center for Simulation of Dynamic Response of Materials Joint work with: Haeyoung Lee & Mathieu Desbrun (USC) Review October 28, 2003

2 Motivation Big simulations produce big data… –many times relevant results given as iso-surface Many other applications –MRI, CT, Laser Scan science, medicine, industry, art history…

3 Background on Compression Mesh Encoding vs. Geometry Encoding –Connectivity + Geometry, or Geometry only Single-rate vs. Progressive Compression –Progressivity is essential for very large datasets T r a n s m i s s i o n Single-rate Progressive

4 Our Context High genus and many components –Remeshing impractical best known coders unusable! Extracted from volume data –Very special mesh structure V: CC:183 Genus: 425 Skull, extracted from 257x257x257 MRI volume data

5 Previous Work Single-rate Isosurface Compression –Connectivity: locate piercing edges Saupe & Kuska ’01,’02: Octree Zhang et al ’01: Binary sign and cell map Yang & Wu ’02: 3D chessboard Taubin ’02 (BLIC): Binary Sign map –Geometry: displacements along piercing edges Progressive Isosurface Compression –Laney et al Distance transformation & wavelet decomposition –Samet and Kochut 2002 Octree encoding, without explicit geometry –Far worse rates than general mesh encoders

6 Our Contributions Progressive Isosurface Codec –Connectivity Encoding Novel octree encoding of binary bitmaps –Geometry Encoding Dual contouring for crack-free visualization Best bitrates so far –even better than any single-rate isosurface encoders

7 Definitions Volume data Binary Sign Isosurface Piercing edge Homogeneous Inhomogeneous

8 Our Design Choices Adaptive Octree for Connectivity Encoding –Enable progressive localization –Provide contexts for entropy coding –Avoid redundancy Dual Contouring [Ju et al 02, SW02] –Watertight meshes –Sharp features for hermite data –Vertices in cells, not on edges

9 Our Encoder at a Glance Read in & Process volume data Build Octree Create Isosurface by DC Encode Geometry Encode Connectivity during a breadth-first traversal

10 Connectivity Encoding Sign bits (Inside/Outside) –Encode binary signs at grid vertices Cells with children: encode necessary signs Cells without children: deduce from parent Leaf bits (Leaf/Non-leaf) –Encode the presence of children Identify non-empty cells Context modeling in coder –Sign bitstream: 15-bit context (best bit rates): 7 neighbors + 8 of parent –Leaf bitstream: 1-bit context: previous bit (best bit rates)

11 Geometry Encoding? Sometimes, octree bits enough! –Octree provides coarse geometry during decoding Barycenters of midpoints of the piercing edges w/o geo w/ geo w/o geo w/ geo

12 Center P Implementation Details Local Coordinate System –Least-square fitted plane through midpoints of piercing edges –Two passes normal(z) & tangential(x,y) –Context : 8 signs of the cell Beware of Memory Footprint! –Octree data structure can be overkill grids use up more than 1Gb –We use a “linearized” data structure Unfolds the octree in a bitmap No pointers, no recursive calls Allows grids (or bigger) on your PC Center P

13 Results Total: 6.10b/v on average out of 10 models Connectivity: –0.65 b/v on average –24% better than Taubin’s single-rate BLIC Geometry: –5.45 b/v on average –For a distortion similar to 12-bit quantization

14 Results Oct. level Bytes Distort (10 -4 ) , , % geo. 145,

15 Results Octree level Bytes passed Distortion(10 -4 ) bytes % geo. 92,156 bytes % geo. 226,554 bytes ,605 bytes 22.02

16 Results For High Genus, High Complexity Geometry 30Kb 115Kb 602Kb

17 Results Encoding a raw mesh often requires > 15b/v 3.95 b/v ( ) 3.21 b/v ( ) 3.45 b/v ( )

18 Conclusion & Future Work Progressive isosurface compression – Progressive coding of binary octree – Encoding of dual contouring mesh vertices – Context modeling with arithmetic coding Competitive compression ratios –24% better than the leading single-rate on connectivity alone Reducing bit rate further –Sophisticated binary valued wavelet? View-dependent compression –View-dependent encoding –View-dependent decoding Volume compression –Neighboring isosurfaces