A Volumetric Method for Building Complex Models from Range Images

Slides:



Advertisements
Similar presentations
Reconstruction from Voxels (GATE-540)
Advertisements

11/11/02 IDR Workshop Dealing With Location Uncertainty in Images Hasan F. Ates Princeton University 11/11/02.
Surface Reconstruction From Unorganized Point Sets
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
Direct Volume Rendering. What is volume rendering? Accumulate information along 1 dimension line through volume.
Extended Gaussian Images
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
Contour Tree and Small Seed Sets for Isosurface Traversal Marc van Kreveld Rene van Oostrum Chandrajit Bajaj Valerio Pascucci Daniel R. Schikore.
Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
Shape from Contours and Multiple Stereo A Hierarchical, Mesh-Based Approach Hendrik Kück, Wolfgang Heidrich, Christian Vogelgsang.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
Asst. Prof. Yusuf Sahillioğlu
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Filling Holes in Complex Surfaces using Volumetric Diffusion James Davis, Stephen Marschner, Matt Garr, Marc Levoy Stanford University First International.
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 4: 3D Objects and Meshes Ravi Ramamoorthi
Surface Reconstruction Some figures by Turk, Curless, Amenta, et al.
Surface Reconstruction Using Volumetric Implicit Functions Some figures by Curless et al.
3D object capture Capture N “views” (parts of the object) –get points on surface of object –create mesh (infer connectivity) Hugues Hoppe –filter data.
Accurate, Dense and Robust Multi-View Stereopsis Yasutaka Furukawa and Jean Ponce Presented by Rahul Garg and Ryan Kaminsky.
CSE554SimplificationSlide 1 CSE 554 Lecture 7: Simplification Fall 2014.
The Story So Far The algorithms presented so far exploit: –Sparse sets of images (some data may not be available) –User help with correspondences (time.
Volumetric and Blobby Objects Lecture 8 (Modelling)
Polygon Shading. Assigning color to a shape to make graphical scenes look realistic, or artistic, or whatever effect we’re attempting to achieve But first.
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Quadric Error Metrics 1/20 Quadric Error Metrics.
KinectFusion : Real-Time Dense Surface Mapping and Tracking IEEE International Symposium on Mixed and Augmented Reality 2011 Science and Technology Proceedings.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
COLLEGE OF ENGINEERING UNIVERSITY OF PORTO COMPUTER GRAPHICS AND INTERFACES / GRAPHICS SYSTEMS JGB / AAS 1 Shading (Shading) & Smooth Shading Graphics.
Exploitation of 3D Video Technologies Takashi Matsuyama Graduate School of Informatics, Kyoto University 12 th International Conference on Informatics.
Reporter: Zhonggui Chen
Sparse Shape Representation using the Laplace-Beltrami Eigenfunctions and Its Application to Modeling Subcortical Structures Xuejiao Chen.
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.
CSE554SimplificationSlide 1 CSE 554 Lecture 7: Simplification Fall 2013.
CSE554Fairing and simplificationSlide 1 CSE 554 Lecture 6: Fairing and Simplification Fall 2012.
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
1 Polygonal Techniques 이영건. 2 Introduction This chapter –Discuss a variety of problems that are encountered within polygonal data sets The.
Volume Visualization Presented by Zhao, hai. What’ volume visualization Volume visualization is the creation of graphical representations of data sets.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
(c) 2000, 2001 SNU CSE Biointelligence Lab Finding Region Another method for processing image  to find “regions” Finding regions  Finding outlines.
Greg Humphreys CS445: Intro Graphics University of Virginia, Fall 2003 Subdivision Surfaces Greg Humphreys University of Virginia CS 445, Fall 2003.
Image-Based Rendering CS 446: Real-Time Rendering & Game Technology David Luebke University of Virginia.
Image-Based Rendering Geometry and light interaction may be difficult and expensive to model –Think of how hard radiosity is –Imagine the complexity of.
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.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Faculty of Sciences and Technology from University of Coimbra Generating 3D Meshes from Range Data [1] Graphic Computation and Three-dimensional Modeling.
Electronic Visualization Laboratory University of Illinois at Chicago “Fast And Reliable Space Leaping For Interactive Volume Rendering” by Ming Wan, Aamir.
Combining Edges and Points for Interactive High-Quality Rendering
Recognizing Deformable Shapes
Real Time Dense 3D Reconstructions: KinectFusion (2011) and Fusion4D (2016) Eleanor Tursman.
3D Graphics Rendering PPT By Ricardo Veguilla.
3D Object Representations
CSc4730/6730 Scientific Visualization
Acknowledgement: some content and figures by Brian Curless
3D Rendering Pipeline Hidden Surface Removal 3D Primitives
Domain-Modeling Techniques
Craig Schroeder October 26, 2004
Finite Element Surface-Based Stereo 3D Reconstruction
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Semi-Automatic Generation of Transfer Functions
Three Step Geometric Pipeline
Edge Detection Today’s readings Cipolla and Gee Watt,
Computer Graphics (Fall 2003)
Presentation transcript:

A Volumetric Method for Building Complex Models from Range Images Brian Curless Marc Levoy speaker:Cui Yunpeng 2017/5/16

Introduction Reconstruct from scan’s application: Industry Hospital Art

Introduction Input: a set of range images from scanner Output:a closely range surface of the model

Goal: A surface reconstruction algorithm owns such properties Representation of range uncertainty Utilization of all range data Incremental updates Time and space efficiency Robustness No restrictions on topological type Ability to fill holes in the reconstruction

Previous work Two dircetions: 1. unorganized points ①.parametric surfaces ②.implicit function(SDF) 2. exploits the underlying structure of the acquired data ②.implicit function(SDF) VRIP: use samples of a continuous function to combine structured data

Volumetric integration For a set range images, R1, R2, R3,…,Rn, construct signed distance funchtions(SDF) d1(x),d2(x),d3(x),…d4(x). Combine these functions to generate cumulative function,D(x).(In fact, combine the volume) Extract the disired manifold as isosurface, D(x)=0.

Volumetric integration The weight depend on the dot product between each vertex normal and the viewing direction. Now to prove: Isosurface of the weighted SDF = Minimization of squared distances between points on the range surfaces and points on the desired surfaces

Proof Assumption: 1.The range sensor is orthographic. 2.The range errors are independently distributed along sensor lines of sight. With the assumption, this is proved in another article: 𝐸 𝑓 = 𝑖=1 𝑁 𝑑 𝑖 2(𝑥,𝑦,𝑧,𝑓) ⅆ𝑥𝑑𝑦𝑑𝑧

Proof x,y,z is postion of surface point, v is directions of sensor, w is weight, s,t is the position of sensor.

Volumetric integration Result: Incremental calculation:

Volumetric integration Signed distance and weight functions in one dimension and their combine

Volumetric integration Signed distance and weight functions in two dimension and their combine

Volumetric integration Update voxel in three dimension 1. Set all voxel weights to zero 2. Tessellate each range image by constructing triangles 3. Compute a weight at each vertex 4. Cast a ray from the sensor to compute signed distance contribution of each voxel near the surface and intersect it by the triangles mesh 5. The weight is computed by linearly interpolating the weights stored at the intersection triangle’s vertices.

Volumetric integration d is the distance, each voxel has the distance from one range surface

Hole filling Unseen portions of the surface will appear as holes in the reconstruction. Fill them for continuous meshes and esthetics.

Hole filling Classifying all points in the volume as being in one of three states: unseen, empty, or near the surface.

Hole filling Extension of the algorithm in Update voxel in three dimension 1.Initialize the voxel space to the “unseen” state. 2. Update the voxels near the surface, and mark them as “near surface”. 3.Follow the lines of sight back from the observed surface and mark the corresponding voxels as “empty”. (space carving) 4. Perform an isosurface extraction at the zero-crossing of the signed distance function. Additionally, extract a surface between empty regions and unseen regions.

Implementation Software optimzations 1.Run-length encoding 2. Fast volume traversal 3. Fast surface extraction

Result Range surface Unorganized point Zippered mesh Volumetric mesh Scanning a 1.6 mm drill bit from 12 orientations at a 30 degree spacing using traditional optical triangulation methods

Result Zippered surface Volumetric surface

Result Hole filling without backdrop No hole filling Hole filling with backdrop Smoothed

Result Painted Original Range surface Before hole filling After hole filling Hardcopy

Result Statistics for the reconstruction of the dragon and Buddha models, with and without space carving. 

Limitation Optical scanning Volumetric algorithm 1.Surface points must be accessible 2.Surface reflectance affects results Volumetric algorithm Thin surfaces and sharp corners

Future work Carving from video/image silhouettes Next best view, including backdrops Large-scale scenes Surface color acquisition

Question 1.Why the weight change in page11? The weight function taper off behind the range points for reasons discussed below. 2.What does the color line mean in page19 (b) figure? It means we get the range surface from different angle view . taper off behind

Question 3.How does it distinguish hole and back-ground when doing hole filling? By input a backdrop, the hole of surface don’t have backdrop’s color. We can see the different in page 21.

Question 4.The transition between unseen and empty is discontinuous. How does the paper get a better surface? In fact, they did post-filtering the mesh after reconstruction using weighted averages of nearest vertex neighbors. It can get a smooth surface.