Poisson Surface Reconstruction M Kazhdan, M Bolitho & H Hoppe

Slides:



Advertisements
Similar presentations
My PhD Thesis Work l With: n Tony DeRose (Computer Science) n Tom Duchamp (Mathematics) n John McDonald (Statistics) n Werner Stuetzle (Statistics) n...
Advertisements

Reconstruction from Voxels (GATE-540)
L1 sparse reconstruction of sharp point set surfaces
Multilevel Streaming for Out-of-Core Surface Reconstruction
Surface Reconstruction From Unorganized Point Sets
VECTOR CALCULUS 1.10 GRADIENT OF A SCALAR 1.11 DIVERGENCE OF A VECTOR
Text Scaffolds for Effective Surface Labeling Gregory Cipriano and Michael Gleicher.
Numerical Simulation of Wave-Seawall Interaction Clive Mingham, Derek Causon, David Ingram and Stephen Richardson Centre for Mathematical Modelling and.
An Efficient Multigrid Solver for (Evolving) Poisson Systems on Meshes Misha Kazhdan Johns Hopkins University.
Unconstrained Isosurface Extraction on Arbitrary Octrees
Screened Poisson Surface Reconstruction
COMPUTER GRAPHICS CS 482 – FALL 2014 OCTOBER 13, 2014 IMPLICIT REPRESENTATIONS IMPLICIT FUNCTIONS IMPLICIT SURFACES MARCHING CUBES.
Discrete Geometry Tutorial 2 1
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
Fourier-based and Poisson surface reconstruction Reporter: Lincong Fang 24th Dec, 2008.
Robust Repair of Polygonal Models Tao Ju Rice University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
??? Eyes Brain (Inside) Conclusion: Ideally Suited for Image Processing.
Feature Sensitive Surface Extraction from Volume Data Leif P. Kobbelt Mario Botsch Ulrich Schwanecke Hans-Peter Seidel Computer Graphics Group, RWTH-Aachen.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Consolidation of Unorganized Point Clouds for Surface Reconstruction Hui Huang 1 Dan Li 1 Hao Zhang 2 Uri Ascher 1 Daniel Cohen-Or 3 1 University of British.
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
3D object capture Capture N “views” (parts of the object) –get points on surface of object –create mesh (infer connectivity) Hugues Hoppe –filter data.
Tracking Surfaces with Evolving Topology Morten Bojsen-Hansen IST Austria Hao Li Columbia University Chris Wojtan IST Austria.
National Center for Supercomputing Applications University of Illinois at Urbana-Champaign Image Features Kenton McHenry, Ph.D. Research Scientist.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Surface Reconstruction Using RBF Reporter : Lincong Fang
Dynamic Meshing Using Adaptively Sampled Distance Fields
Estimating the Laplace-Beltrami Operator by Restricting 3D Functions Ming Chuang 1, Linjie Luo 2, Benedict Brown 3, Szymon Rusinkiewicz 2, and Misha Kazhdan.
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
Reporter: Zhonggui Chen
Interactive surface reconstruction on triangle meshes with subdivision surfaces Matthias Bein Fraunhofer-Institut für Graphische Datenverarbeitung IGD.
Point Set Processing and Surface Reconstruction (
2D/3D Shape Manipulation, 3D Printing Shape Representations Slides from Olga Sorkine February 20, 2013 CS 6501.
Global Parametrization of Range Image Sets Nico Pietroni, Marco Tarini, Olga Sorkine, Denis Zorin.
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
TEMPLATE DESIGN © We presented a simple and effective orienter for defective raw point sets. By seamlessly combining the.
Senior Project Poster Day 2005, CIS Dept. University of Pennsylvania Surface Reconstruction from Feature Based Stereo Mickey Mouse, Donald Duck Faculty.
Temporally Coherent Completion of Dynamic Shapes AUTHORS:HAO LI,LINJIE LUO,DANIEL VLASIC PIETER PEERS,JOVAN POPOVIC,MARK PAULY,SZYMON RUSINKIEWICZ Presenter:Zoomin(Zhuming)
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
Citations & Acknowledgments Kazhdan, Michael, Matthew Bolitho, and Hugues Hoppe. "Poisson surface reconstruction." Proceedings of the fourth Eurographics.
INFORMATIK A Multi-scale Approach to 3D Scattered Data Interpolation with Compactly Supported Basis Functions Yutaka Ohtake Yutaka Ohtake Alexander Belyaev.
A New Voronoi-based Reconstruction Algorithm
Skuller: A volumetric shape registration algorithm for modeling skull deformities Yusuf Sahillioğlu 1 and Ladislav Kavan 2 Medical Image Analysis 2015.
Surface Reconstruction using Radial Basis Functions Michael Kunerth, Philipp Omenitsch and Georg Sperl 1 Institute of Computer Graphics and Algorithms.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Outline ● Introduction – What is the problem ● Generate stochastic textures ● Improve realism ● High level approach - Don't just jump into details – Why.
Lecture 04 Edge Detection Lecture 04 Edge Detection Mata kuliah: T Computer Vision Tahun: 2010.
Outline ● Introduction – What is the problem ● Generate stochastic textures ● Improve realism ● High level approach - Don't just jump into details – Why.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Solid Modeling Dr. Scott Schaefer.
Implementing Finite Volume Methods 1.  Continue on Finite Volume Methods for Elliptic Equations  Finite Volumes in Two-Dimensions  Poisson’s Equation.
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
Wavelets for Surface Reconstruction
Domain-Modeling Techniques
Learning with information of features
Lectures on Discrete Differential Geometry – Week 10
Lecture 3 : Isosurface Extraction
A Volumetric Method for Building Complex Models from Range Images
Three Step Geometric Pipeline
Robust Moving Least-squares Fitting with Sharp Features
Presentation transcript:

Poisson Surface Reconstruction M Kazhdan, M Bolitho & H Hoppe Ankit Vijay Nimit Acharya Ramji Gupta 1

Poisson Reconstruction How it works? Evaluation Results Conclusions Outline Introduction Poisson Reconstruction How it works? Evaluation Results Conclusions 2

Surface Reconstruction After scanning an object into a point cloud, we want to get a mesh from those points. Method should be able to infer the topology of the unknown surface, accurately fit the noisy data, and fill holes reasonably. Poisson Surface Reconstruction is one of the approaches to obtain smooth and watertight surface. 3

Practical Difficulties The point samples may not be uniformly distributed over the model surface. The positions and normals are generally noisy due to sampling inaccuracy and scan misregistration. And, accessibility constraints during scanning may leave some surface regions devoid of data. 4

Poisson Reconstruction - Approach It computes a 3D indicator function X(defined as 1 at points inside the model, and 0 at points outside). The gradient of the indicator function is non- zero only at points near the surface, At such points, it is taken(proven) to be equal to the inward surface normal. 5

Approach (contd.) Thus, the oriented point samples can be viewed as samples of the gradient of the model’s indicator function The problem reduces to finding X whose gradient best approximates a vector field V defined by the input points. ∇X = V 6

Approach (contd.) If we apply the divergence operator, this problem transforms into a standard Poisson problem: compute the scalar function X whose Laplacian (divergence of gradient) equals the divergence of the vector field V, ΔX ≡ ∇·∇X = ∇·V The implicit function X is represented using an adaptive octree rather than a regular 3D grid. 7

How it works? ∇X = V ΔX ≡ ∇·∇X = ∇·V 8

(contd.) The output scalar function X, represented in an adaptive octree, is then isocontoured using an adaptive marching cubes to obtain the mesh. 9

Example 10

We have used Meshlab for experimentation. Evaluation We have used Meshlab for experimentation. The generated mesh is affected by- Octree Depth: tree-depth that is used for the reconstruction. SamplesPerNode: specifies the maximum number of sample points that should fall within an octree node. For noise-free data: [1.0, 5.0], noisy data: [15.0, 20.0] 11

higher value => more detailed results. Effect of Octree Depth higher value => more detailed results. Lower value => smoothing.(for noisy data) Higher value => more vertices in mesh. 12

Expects a sufficiently dense cloud. Effect of Dataset Sparse Sampling Expects a sufficiently dense cloud. May not reconstruct the thin sampled features. 13

Fill holes where data are missing. Effect of Dataset 2. Large Holes Fill holes where data are missing. But, may use coarser triangulation for filling holes. 14

3. Wrongly Oriented Normals => incorrect implicit function Effect of Dataset 3. Wrongly Oriented Normals => incorrect implicit function => topological distortion. 15

Effect of Dataset 4. Sharp Creases May not recover the sharp creases and corners present in the inferred surface. 16

Results Results are available for download in the Links Section. 17

Conclusion Poisson reconstruction attempts to approximate the indicator function of an inferred solid. It is fairly robust in filling small holes and dealing with non-uniform data. 18

References Poisson Surface Reconstruction- Michael Kazhdan, Matthew Bolitho and Hugues Hoppe CGAL Manual http://vr.tu-freiberg.de/scivi/ 19

Thank you! 20