Wavelets for Surface Reconstruction

Slides:



Advertisements
Similar presentations
Isosurfaces Over Simplicial Partitions of Multiresolution Grids Josiah Manson and Scott Schaefer Texas A&M University.
Advertisements

Window Fourier and wavelet transforms. Properties and applications of the wavelets. A.S. Yakovlev.
Noise & Data Reduction. Paired Sample t Test Data Transformation - Overview From Covariance Matrix to PCA and Dimension Reduction Fourier Analysis - Spectrum.
Wavelets Fast Multiresolution Image Querying Jacobs et.al. SIGGRAPH95.
Compressive Sensing IT530, Lecture Notes.
Multilevel Streaming for Out-of-Core Surface Reconstruction
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
Surface Compression with Geometric Bandelets Gabriel Peyré Stéphane Mallat.
Poisson Surface Reconstruction M Kazhdan, M Bolitho & H Hoppe
Features u 9 discrete measurement volumes u Accelerated polarization - 12 sec in 6 sec u more robust electronics and new sonde Benefits u Single-pass,
Screened Poisson Surface Reconstruction
Extensions of wavelets
Compressed sensing Carlos Becker, Guillaume Lemaître & Peter Rennert
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
1 Free-Form Deformations Dr. Scott Schaefer. 2/28 Deformation.
Fourier-based and Poisson surface reconstruction Reporter: Lincong Fang 24th Dec, 2008.
Robust Repair of Polygonal Models Tao Ju Rice University.
Seminar in Foundations of Privacy 1.Adding Consistency to Differential Privacy 2.Attacks on Anonymized Social Networks Inbal Talgam March 2008.
HCI Final Project Robust Real Time Face Detection Paul Viola, Michael Jones, Robust Real-Time Face Detetion, International Journal of Computer Vision,
CS CS 175 – Week 2 Processing Point Clouds Local Surface Properties, Moving Least Squares.
Bivariate B-spline Outline Multivariate B-spline [Neamtu 04] Computation of high order Voronoi diagram Interpolation with B-spline.
Paul Heckbert Computer Science Department Carnegie Mellon University
Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.
Multi-Resolution Analysis (MRA)
TR32 time series comparison Victor Venema. Content  Jan Schween –Wind game: measurement and synthetic –Temporal resolution of 0.1 seconds  Heye Bogena.
Introduction to Wavelets
Methods of Image Compression by PHL Transform Dziech, Andrzej Slusarczyk, Przemyslaw Tibken, Bernd Journal of Intelligent and Robotic Systems Volume: 39,
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
Spectral Processing of Point-sampled Geometry
Not ClosedClosed Not Closed 4 5
What is Mathematics? Lee Peng Yee 21 November 2014.
One-Pass Wavelet Decompositions of Data Streams TKDE May 2002 Anna C. Gilbert,Yannis Kotidis, S. Muthukrishanan, Martin J. Strauss Presented by James Chan.
RACE: Time Series Compression with Rate Adaptivity and Error Bound for Sensor Networks Huamin Chen, Jian Li, and Prasant Mohapatra Presenter: Jian Li.
FACE DETECTION AND RECOGNITION By: Paranjith Singh Lohiya Ravi Babu Lavu.
ENG4BF3 Medical Image Processing
Image Representation Gaussian pyramids Laplacian Pyramids
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
WAVELET TRANSFORM.
Axial Flip Invariance and Fast Exhaustive Searching with Wavelets Matthew Bolitho.
Wavelet Synopses with Predefined Error Bounds: Windfalls of Duality Panagiotis Karras DB seminar, 23 March, 2006.
Efficient Elastic Burst Detection in Data Streams Yunyue Zhu and Dennis Shasha Department of Computer Science Courant Institute of Mathematical Sciences.
Review Questions Jyun-Ming Chen Spring Wavelet Transform What is wavelet? How is wavelet transform different from Fourier transform? Wavelets are.
The Haar + Tree: A Refined Synopsis Data Structure Panagiotis Karras HKU, September 7 th, 2006.
An Enhanced Splatting Method Graphics and Visualization Group Department of Computer Science The University of Auckland Peter Kulka & Richard Lobb.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
Blood Vessel Modeling using 2D/3D Level Set Method
Analytic Rasterization of Curves with Polynomial Filters Josiah Manson and Scott Schaefer Texas A&M University.
Inferring Reflectance Functions from Wavelet Noise Pieter Peers Philip Dutré Pieter Peers Philip Dutré June 30 th 2005 Department of Computer Science.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
S.Klimenko, LSC March, 2001 Update on Wavelet Compression Presented by S.Klimenko University of Florida l Outline Ø Wavelet compression concept E2 data.
Wavelet Rasterization Josiah Manson and Scott Schaefer.
In The Name of God The Compassionate The Merciful.
By Poornima Balakrishna Rajesh Ganesan George Mason University A Comparison of Classical Wavelet with Diffusion Wavelets.
Wavelets Chapter 7 Serkan ERGUN. 1.Introduction Wavelets are mathematical tools for hierarchically decomposing functions. Regardless of whether the function.
 presented by- ARPIT GARG ISHU MISHRA KAJAL SINGHAL B.TECH(ECE) 3RD YEAR.
Convolution.
k is the frequency index
WAVELET VIDEO PROCESSING TECHNOLOGY
Lattice Struture.
Fast Approximate Query Answering over Sensor Data with Deterministic Error Guarantees Chunbin Lin Joint with Etienne Boursier, Jacque Brito, Yannis Katsis,
Lattice Histograms: A Resilient Synopsis Structure
Spectral processing of point-sampled geometry
Positive Gordon–Wixom Coordinates
Introduction To Wavelets
Convolution.
Conversation between Analogue and Digital System
k is the frequency index
PANN Testing.
Author: Minoru Kuribayashi, Hatsukazu Tanaka
Wavelet Analysis Objectives: To Review Fourier Transform and Analysis
Presentation transcript:

Wavelets for Surface Reconstruction Josiah Manson Guergana Petrova Scott Schaefer

Convert Points to an Indicator Function

Data Acquisition

Properties of Wavelets Fourier Series Wavelets Represents all functions Locality Depends on wavelet Smoothness

Wavelet Bases Haar D4

Example of Function using Wavelets

Example of Function using Wavelets

Example of Function using Wavelets

Example of Function using Wavelets

Example of Function using Wavelets

Strategy Estimate wavelet coefficients of indicator function Use only local combination of samples to find coefficients

Computing the Indicator Function [Kazhdan 2005]

Computing the Indicator Function [Kazhdan 2005]

Computing the Indicator Function [Kazhdan 2005]

Computing the Indicator Function [Kazhdan 2005] Divergence Theorem

Computing the Indicator Function [Kazhdan 2005] Divergence Theorem

Computing the Indicator Function [Kazhdan 2005]

Computing the Indicator Function [Kazhdan 2005]

Finding

Finding

Finding

Extracting the surface Coefficients Indicator function Dual marching cubes Surface

Smoothing the Indicator Function Haar unsmoothed

Smoothing the Indicator Function Haar unsmoothed Haar smoothed

Comparison of Wavelet Bases Haar D4

Advantages of Wavelets Coefficients calculated only near surface Fast, Low memory Trade quality for speed Multi-resolution representation Out of core calculation is possible

Streaming Pipeline Output Input

Results Michelangelo’s Barbuto 329 million points (7.4 GB of data), 329MB memory, 112 minutes

Results Michelangelo’s Awakening 381 million points (8.5 GB), 573MB memory, 81 minutes Produced 590 million polygons

Results Michelangelo’s Atlas 410 million points (9.15 GB), 1188MB memory, 98 minutes Produced 642 million polygons

Results Michelangelo’s Atlas 410 million points (9.15 GB), 1188MB memory, 98 minutes Produced 642 million polygons

Robustness to Noise in Normals 0° 30° 60° 90°

Comparison of Methods MPU 551 sec 750 MB Poisson 289 sec 57 MB Haar

Relative Hausdorff Errors

Conclusions Works with all orthogonal wavelets Wavelets provide trade-off between speed/quality Guarantees closed, manifold surface Out of core

Future Work Better estimates of dσ Compress surfaces Wedgelets and higher order versions thereof

Overview

Getting locality Always in memory Streamed tree

Smooth, but large error A B

Jagged, but low error A B

Hausdorf error on points – pointless