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.

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

Department of Computer Science and Engineering Normal Estimation for Point Clouds: A Comparison Study for a Voronoi Based Method Tamal K. DeyGang LiJian.
L1 sparse reconstruction of sharp point set surfaces
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Continuous Projection for Fast L1 Reconstruction Reinhold Preiner*Oliver Mattausch†Murat Arikan* Renato Pajarola†Michael Wimmer* * Institute of Computer.
Surface Reconstruction From Unorganized Point Sets
Junjie Cao 1, Andrea Tagliasacchi 2, Matt Olson 2, Hao Zhang 2, Zhixun Su 1 1 Dalian University of Technology 2 Simon Fraser University Point Cloud Skeletons.
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
Poisson Surface Reconstruction M Kazhdan, M Bolitho & H Hoppe
Screened Poisson Surface Reconstruction
May 16, 2015 Sparse Surface Adjustment M. Ruhnke, R. Kümmerle, G. Grisetti, W. Burgard.
Visibility of noisy point cloud data Ravish Mehra 1,2 Pushkar Tripathi 1,3 Alla Sheffer 4 Niloy Mitra 1,5 1 IIT Delhi 2 UNC Chapel Hill 3 GaTech 4 UBC.
Middle Term Exam 03/01 (Thursday), take home, turn in at noon time of 03/02 (Friday)
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
Segmentation into Planar Patches for Recovery of Unmodeled Objects Kok-Lim Low COMP Computer Vision 4/26/2000.
Estimating Surface Normals in Noisy Point Cloud Data Niloy J. Mitra, An Nguyen Stanford University.
Uncertainty and Variability in Point Cloud Surface Data Mark Pauly 1,2, Niloy J. Mitra 1, Leonidas J. Guibas 1 1 Stanford University 2 ETH, Zurich.
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Tamal K. Dey The Ohio State University Delaunay Meshing of Surfaces.
Overview Of Clustering Techniques D. Gunopulos, UCR.
Human Posture Recognition with Convex Programming Hao Jiang, Ze-Nian Li and Mark S. Drew School of Computing Science Simon Fraser University Burnaby, BC,
Andrei Sharf Dan A. Alcantara Thomas Lewiner Chen Greif Alla Sheffer Nina Amenta Daniel Cohen-Or Space-time Surface Reconstruction using Incompressible.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Optimal Bandwidth Selection for MLS Surfaces
Feature Sensitive Surface Extraction from Volume Data Leif P. Kobbelt Mario Botsch Ulrich Schwanecke Hans-Peter Seidel Computer Graphics Group, RWTH-Aachen.
Surface Reconstruction with MLS Tobias Martin CS7960, Spring 2006, Feb 23.
Point Set Silhouettes via Local Reconstruction Matt Olson 1, Ramsay Dyer 2, Hao (Richard) Zhang 1, and Alla Sheffer
P. Rodríguez, R. Dosil, X. M. Pardo, V. Leborán Grupo de Visión Artificial Departamento de Electrónica e Computación Universidade de Santiago de Compostela.
Voronoi diagrams of “nice” point sets Nina Amenta UC Davis “The World a Jigsaw”
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
Robust Statistical Estimation of Curvature on Discretized Surfaces Evangelos Kalogerakis Patricio Simari Derek Nowrouzezahrai Karan Singh Symposium on.
Robust Moving Least-squares Fitting with Sharp Features Shachar Fleishman* Daniel Cohen-Or § Claudio T. Silva* * University of Utah § Tel-Aviv university.
Jinhui Tang †, Shuicheng Yan †, Richang Hong †, Guo-Jun Qi ‡, Tat-Seng Chua † † National University of Singapore ‡ University of Illinois at Urbana-Champaign.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Feature-Aware Filtering for Point-Set Surface Denoising Min Ki Park*Seung.
Symmetry Hierarchy of Man-Made Objects Yanzhen Wang 1,2, Kai Xu 1,2, Jun Li 2, Hao Zhang 1, Ariel Shamir 3, Ligang Liu 4, Zhiquan Cheng 2, Yueshan Xiong.
Informatik VIII Computer Graphics & Multimedia Martin Marinov and Leif Kobbelt Direct Quad-Dominated Anisotropic Remeshing Martin Marinov and Leif Kobbelt.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Improved Search for Local Optima in Particle Swarm Optimization May 6, 2015 Huidae Cho Water Resources Engineer, Dewberry Consultants Part-Time Assistant.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Reconstruction of Water-tight Surfaces through Delaunay Sculpting Jiju Peethambaran and Ramanathan Muthuganapathy Advanced Geometric Computing Lab, Department.
Point Set Processing and Surface Reconstruction (
Scalable and Fully Distributed Localization With Mere Connectivity.
Projecting points onto a point cloud with noise Speaker: Jun Chen Mar 26, 2008.
Organizing Heterogeneous Scene Collections through Contextual Focal Points Kai Xu, Rui Ma, Hao Zhang, Chenyang Zhu, Ariel Shamir, Daniel Cohen-Or, Hui.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
Effective Optical Flow Estimation
TEMPLATE DESIGN © We presented a simple and effective orienter for defective raw point sets. By seamlessly combining the.
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.
Project 11: Determining the Intrinsic Dimensionality of a Distribution Okke Formsma, Nicolas Roussis and Per Løwenborg.
Detecting Undersampling in Surface Reconstruction Tamal K. Dey and Joachim Giesen Ohio State University.
A New Voronoi-based Reconstruction Algorithm
Bilateral Mesh Denoising Shachar Fleishman Iddo Drori Daniel Cohen-Or Tel Aviv University.
Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.
With Tamal Dey, Qichao Que, Issam Safa, Lei Wang, Yusu Wang Computer science and Engineering The Ohio State University Xiaoyin Ge.
Reflectance Function Estimation and Shape Recovery from Image Sequence of a Rotating object Jiping Lu, Jim Little UBC Computer Science ICCV ’ 95.
Locations. Soil Temperature Dataset Observations Data is – Correlated in time and space – Evolving over time (seasons) – Gappy (Due to failures) – Faulty.
A Part-aware Surface Metric for Shape Analysis Rong Liu 1, Hao Zhang 1, Ariel Shamir 2, and Daniel Cohen-Or 3 1 Simon Fraser University, Canada 2 The Interdisciplinary.
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
A Globally Optimal Algorithm for Robust TV-L 1 Range Image Integration Christopher Zach VRVis Research Center Thomas Pock, Horst Bischof.
Fast edge-directed single-image super-resolution
Geometrically Stable Sampling for the ICP Algorithm
Probabilistic Models for Linear Regression
Lecture 10: Observers and Kalman Filters
3D Scan Alignment Using ICP
Robust Moving Least-squares Fitting with Sharp Features
Presentation transcript:

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 Columbia 2 Simon Fraser University 3 Tel-Aviv University 1

2 Raw Scan Data

3 Data Consolidation

4 Surface Reconstruction Delaunay techniques [Amenta & Bern 1998], Power-crust [Amenda et al. 2001], Cocone [Dey & Giesen 2001], [Cazals & Giesen 2006] …… Approximate reconstructions [Hoppe et al. 1992], RBF [Carr et al. 2001], Poisson [Kazhdan et al. 2006] ……

5 Raw Scan Data

6 RBF Reconstruction

7 Difficulties Direct surface reconstruction may fail on challenging datasets Normals are crucial for surface reconstruction noise outliers close-by surface sheets missing normal information  not always available  not always reliable

8 Unsigned Directions by PCA Thick cloudNon-uniform distribution Close-by surface sheets

9 Normal Consistency [Hoppe et al. 1992] Based on angles between unsigned normals May produce errors on close-by surface sheets

10 Point Cloud Consolidation Unorganized Noisy Thick Outliers Non-uniform Un-oriented Input Consolidated Clean Thin Outlier-free Uniform Oriented Output InputOutput

11 Contributions Weighted locally optimal projection operator (WLOP) To consolidate point clouds: Robust normal estimation

12 Locally Optimal Projection LOP operator [Lipman et al. 2007] defines a point set by a fixed point iteration where, for each point x, given the current iterate, the next iterate is to minimize The repulsion function here is

13 New Repulsion Function More locally regular point distribution

14 New Repulsion Function Better convergence behavior

15 Non-uniformity The first term of LOP, an L 1 median, tends to follow the trend of non-uniformity if input is highly non-uniform. Raw scan LOP (old η)LOP (new η) σ = 0.24 σ = 0.18

16 Improved Weighted LOP Define the weighted local densities for each point in the input set and projection set as Then the projection becomes

17 WLOP vs. LOP More globally regular point distribution Raw ScanLOP (old η)LOP (new η)WLOP σ = 0.24 σ = 0.18 σ = 0.09

18 WLOP vs. LOP Better convergence

19 Normal Propagation Select a source Detect thin surface features Normal flipping Propagate

20 Source Selection 

21 Distance Measure

22 Thin Features and Normal Flipping Outside the convex hull Limitation: cannot distinguish between flat and concave Remedy: normal flipping

23 Orientation-aware PCA Propagate Predictor Corrector Loop OPCA PCA

24 Noisy inputTraditional result Without flip With flip After correction One Example

25 Up-sampling Raw scanWith consolidationWithout consolidation

26 Surface Generation LOP WLOP RBF

27 RBFPoisson

28 NormFet+AMLS+Cocone [Dey et al.] TraditionalOur

29 TraditionalWith OPCAWithout iteration

30 Limitations

31 Back-cullingFront-cullingSparse setPoisson surface

32 Theoretical guarantee for the correctness of normal estimation under sampling Rigorous theoretical analysis of the predictor- corrector iteration Better handling of missing data Recovery and enhancement of sharp features Future Work

33 Federico Ponchio Anonymous Reviewers NSERC (No and No ) The Israel Science Foundation Acknowledgements

34 Point-Consolidation API is available