Department of Computer Science and Engineering Normal Estimation for Point Clouds: A Comparison Study for a Voronoi Based Method Tamal K. DeyGang LiJian.

Slides:

Advertisements

Similar presentations

An Adaptive MLS Surface for Reconstruction with Guarantees

Advertisements

Point-based Graphics for Estimated Surfaces

Department of Computer Science and Engineering Defining and Computing Curve-skeletons with Medial Geodesic Function Tamal K. Dey and Jian Sun The Ohio.

C82MST Statistical Methods 2 - Lecture 2 1 Overview of Lecture Variability and Averages The Normal Distribution Comparing Population Variances Experimental.

Tables, Figures, and Equations

Simulating Decorative Mosaics Alejo Hausner University of Toronto [SIGGRAPH2001]

Primal Dual Combinatorial Algorithms Qihui Zhu May 11, 2009.

Linear Time Methods for Propagating Beliefs Min Convolution, Distance Transforms and Box Sums Daniel Huttenlocher Computer Science Department December,

DTAM: Dense Tracking and Mapping in Real-Time

Comparing Two Population Parameters

Surface normals and principal component analysis (PCA)

An approach to the SN ratios based on

K-MEANS ALGORITHM Jelena Vukovic 53/07

Copyright (c) 2004 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 9 Inferences Based on Two Samples.

Medical Image Registration Kumar Rajamani. Registration Spatial transform that maps points from one image to corresponding points in another image.

The Ellipsoid Faculty of Applied Engineering and Urban Planning

Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.

Surface Reconstruction From Unorganized Point Sets

Surface normals and principal component analysis (PCA)

Probability and Statistics Mat 271E

Basic geostatistics Austin Troy.

Discrete Geometry Tutorial 2 1

Computing Medial Axis and Curve Skeleton from Voronoi Diagrams Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Joint.

Estimating Surface Normals in Noisy Point Cloud Data Niloy J. Mitra, An Nguyen Stanford University.

IMA Tutorial, Instantaneous Motions - Applications to Problems in Reverse Engineering and 3D Inspection H. Pottmann.

Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.

reconstruction process, RANSAC, primitive shapes, alpha-shapes

Surface Reconstruction with MLS Tobias Martin CS7960, Spring 2006, Feb 23.

Statistics 800: Quantitative Business Analysis for Decision Making Measures of Locations and Variability.

Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.

ECS 289L A Survey of Mesh-Based Multiresolution Representations Ken Joy Center for Image Processing and Integrated Computing Computer Science Department.

Curve fit noise=randn(1,30); x=1:1:30; y=x+noise ………………………………… [p,s]=polyfit(x,y,1);

Normal Estimation in Point Clouds 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine.

Domain decomposition in parallel computing Ashok Srinivasan Florida State University COT 5410 – Spring 2004.

Chapter 3 (continued) Nutan S. Mishra. Exercises Size of the data set = 12 for all the five problems In 3.11 variable x 1 = monthly rent of.

Planning Near-Optimal Corridors amidst Obstacles Ron Wein Jur P. van den Berg (U. Utrecht) Dan Halperin Athens May 2006.

Normal Distributions Z Transformations Central Limit Theorem Standard Normal Distribution Z Distribution Table Confidence Intervals Levels of Significance.

Scalable and Fully Distributed Localization With Mere Connectivity.

1 10 Statistical Inference for Two Samples 10-1 Inference on the Difference in Means of Two Normal Distributions, Variances Known Hypothesis tests.

Review of Building Multiple Regression Models Generalization of univariate linear regression models. One unit of data with a value of dependent variable.

Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.

© Copyright McGraw-Hill 2000

Spatial Interpolation Chapter 13. Introduction Land surface in Chapter 13 Land surface in Chapter 13 Also a non-existing surface, but visualized as a.

1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.

Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.

Medical Image Analysis Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.

Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.

Chapter 18: Sampling Distribution Models

Detecting Undersampling in Surface Reconstruction Tamal K. Dey and Joachim Giesen Ohio State University.

CPE 619 One Factor Experiments Aleksandar Milenković The LaCASA Laboratory Electrical and Computer Engineering Department The University of Alabama in.

Optimal Dimensionality of Metric Space for kNN Classification Wei Zhang, Xiangyang Xue, Zichen Sun Yuefei Guo, and Hong Lu Dept. of Computer Science &

Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.

PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson

A New Voronoi-based Reconstruction Algorithm

Lecture 6: Point Interpolation

Domain decomposition in parallel computing Ashok Srinivasan Florida State University.

Special Topics in Geo-Business Data Analysis Week 3 Covering Topic 6 Spatial Interpolation.

Scale Selection for Classification of Point-sampled 3-D Surfaces Jean-François Lalonde, Ranjith Unnikrishnan, Nicolas Vandapel and Martial Hebert Carnegie.

Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.

RiskTeam/ Zürich, 6 July 1998 Andreas S. Weigend, Data Mining Group, Information Systems Department, Stern School of Business, NYU 2: 1 Nonlinear Models.

Decimating Samples for Mesh Simplification

Data Science Algorithms: The Basic Methods

Data Mining: Concepts and Techniques

Core-Sets and Geometric Optimization problems.

Psychology 202a Advanced Psychological Statistics

Chapter 18: Sampling Distribution Models

CSC461: Lecture 23 Shading Computation

Principal Components Analysis

Propagation of Error Berlin Chen

Presentation transcript:

Department of Computer Science and Engineering Normal Estimation for Point Clouds: A Comparison Study for a Voronoi Based Method Tamal K. DeyGang LiJian Sun (presenting)

2/10 Department of Computer Science and Engineering The normal estimation problem and some existing methods Problem: given a possibly noisy point cloud sampled from a surface, estimate the surface normals from input points Methods: Numerical methods: plane fitting [HDD*92] and its variations [PKKG03][MNG04] Combinatorial methods: Voronoi based [AB99] [DG04, DS05]

3/10 Department of Computer Science and Engineering Plane fitting method [HDD*92] Assume the best fitting plane at point p: Minimize the error term under the constraint Reduce to an eigenvalue problem:

4/10 Department of Computer Science and Engineering Weighted plane fitting method (WPF) [PKKG03] Observation: the best fitting plane should respect the nearby points than the distant points Define the error term: Weighting function:

5/10 Department of Computer Science and Engineering Adaptive plane fitting method (APF) [MNG04] Consider the points within a ball of radius Noise assumption mean:, standard deviation: An optimal radius Compute in an iterative manner

6/10 Department of Computer Science and Engineering Voronoi based method Noise-free Point Cloud [AB99] The line through p and its pole, the furthest Voronoi vertex of Voronoi cell of p, approximates the normal line at p Noisy Point Cloud Big Delaunay ball method (BDB) [DG04, DS05] The line through p and its pole, the furthest Voronoi vertex of Voronoi cell of p whose dual Delaunay ball is big, approximates the normal at p A Delaunay ball is big if

7/10 Department of Computer Science and Engineering Normal lemmas

8/10 Department of Computer Science and Engineering Experimental setup Add noise to the original noise-free point cloud The x, y and z components of the noise are independent and uniformly distributed Noise level Global scale: the amplitude is a factor (0, 0.005, 0.01, 0.02) of the largest side of the axis parallel bounding box Local scale: the amplitude is a factor (0, 0.5, 1, 2) of the average distance to the five nearest neighbors Compute a referential normal from the original noise-free point cloud Estimation error = Specially sampled point clouds

9/10 Department of Computer Science and Engineering Mean error plot

10/10 Department of Computer Science and Engineering Standard deviation and timing for global scale noise

11/10 Department of Computer Science and Engineering Standard deviation and timing for local scale noise

12/10 Department of Computer Science and Engineering Special Case I: uneven sampling Sample the surface densely along some curves

13/10 Department of Computer Science and Engineering Special Case II: the surface with high curvature A very thin ellipsoid

14/10 Department of Computer Science and Engineering Summary In case where the noise level is low, all three methods works almost equally well though WPF gives the best result. In case where the noise level is high or the sample is skewed along some curves, BDB method gives the best result. Timing When #pts ~ million, BDB is safer to use. Otherwise WPF or APF is preferred.