Presentation is loading. Please wait.

Presentation is loading. Please wait.

Projecting points onto a point cloud with noise Speaker: Jun Chen Mar 26, 2008.

Published byLaureen Alexander Modified over 9 years ago

Similar presentations

Presentation on theme: "Projecting points onto a point cloud with noise Speaker: Jun Chen Mar 26, 2008."— Presentation transcript:

1 Projecting points onto a point cloud with noise Speaker: Jun Chen Mar 26, 2008

2 Data Acquisition

3 Point clouds 25893

4 Point clouds 56194

5 Unorganized, connectivity-free topological

6 Surface Reconstruction

7 Noise

8 Definition of “onto” Close? Which?

9 Applications Rendering Parameterization Simplification Reconstruction Area computation

10 References An extension on robust directed projection of points onto point clouds Ming-Cui Du, Yu-Shen Liu (CAD, In press) Parameterization-free Projection for Geometry Reconstruction Yaron Lipman, Daniel Cohen-Or, David Levin, Hillel Tal-Ezer (SIGGRAPH ’07)

11 An extension on robust directed projection of points onto point clouds Ming-Cui Du, Yu-Shen Liu CAD, In press

12 About the author ( 刘玉身 ) Postdoctor of Purdue University, Ph.D. in Tsinghua University. 3 CAD, 1 The Visual Computer. CAD, DGP.

13

14 Result

15 Previous work Parameterization of clouds of unorganized points using dynamic base surfaces (CAD, 04) Drawing curves onto a cloud of points for point-based Modeling (CAD, 05) Automatic least-squares projection of points onto point clouds with applications in reverse engineering (CAD, 06)

16 Weighted squared distances error

17

18 Proposition Terminating criterion: Simple, direct

19 Error analysis (Robustness) True location Independent of the cloud of points

20 Improved weight distance between p m and the axis stability

21 Improved weight

22 Reduce cloud Setting the threshold: 1.

23

24 Reduce cloud Setting the threshold: 1. 2. Sort the weights in a decreasing order, then choose the nth weight as threshold. (n=N/100).

25 References Robust diagnostic regression analysis. Atkinson A, Riani M. (Springer;2000) Robust Moving Least-squares Fitting with Sharp Features Shachar Fleishman, Daniel Cohen-Or, Claudio T. Silva (SIGGRAPH ’05)

26 Forward vs. backward Backward: Start from the entire sample set, then delete bad samples. Forward: Begins with a small outlier-free subset, then refining by adding one good sample at a time. (robust) Adding of multiple points.

27 Algorithm 1. Choose a small outlier-free subset Q. 2. The solution is computed to the current subset Q. 3. The point with the lowest residual in the remaining points is added into Q. (Forward) 4. Repeat steps 2 and 3 until the error is larger than a predefined threshold. 5. Compute the projection position for the final Q.

28 Least median of squares

29 LMS algorithm

30 Random sampling algorithm

31 Robustness P: Probability of success. g: Probability of selecting good sample. k: Number of points are selected at random. (k = p) T: Number of iteration. (T = 1000)

32 Forward search

33

34

35

36 Disturbing points

37

38 Limitations

39 Use the first quartile (25%) instead of the median (50%)

40 Parameterization-free Projection for Geometry Reconstruction Yaron Lipman, Daniel Cohen-Or, David Levin, Hillel Tal-Ezer (SIGGRAPH ’07)

41 About the author ( Yaron Lipman) Ph.D. student at Tel-Aviv University. His supervisors are Prof. David Levin and Prof. Daniel Cohen-Or. SIGGRAPH, TOG, EG, SGP

42 About the author (Daniel Cohen-Or) Professor at the School of Computer Science, Tel Aviv University. Outstanding Technical Contributions Award 2005(EG) TOG(19), CGF,TVCG, SGP, VC

43 About the author (David Levin) Professor of Applied Mathematics, Tel-Aviv University. Major interests: Subdivision Moving Least Squares Numerical Integration CAGD Computer Graphics

44 About the author (David Levin) Professor of Applied Mathematics, Tel-Aviv University. Major interests: Subdivision Moving Least Squares Numerical Integration CAGD Computer Graphics

45 Results

46 Locally Optimal Projection (LOP) θ(r), η(r) are fast decreasing functions.

47 Regularization

48 Multivariate L 1 median

49 Optimization

50

51

52 The iterative LOP algorithm

53 Theorem If the data set P is sampled from a C 2 -smooth surface S, LOP operator has an O(h 2 ) approximation order to S, provided that Λ is carefully chosen.

54 Initial guess

55

56

57 Results

58 Parameters: h

59 Parameters: μ

60 Efficient simplification of point- sampled surfaces Mark Pauly, Markus Gross, Leif P. Kobbelt IEEE Visualization, 2002

61 Particle Simulation 1.Spreading Particles. 2.Repulsion.(SIG.92) 3.Projection.(MLS)

62 Thank you!

Download ppt "Projecting points onto a point cloud with noise Speaker: Jun Chen Mar 26, 2008."

Similar presentations

Computational Statistics. Basic ideas  Predict values that are hard to measure irl, by using co-variables (other properties from the same measurement.

Computational Statistics. Basic ideas  Predict values that are hard to measure irl, by using co-variables (other properties from the same measurement.
Automated Regression Modeling Descriptive vs. Predictive Regression Models Four common automated modeling procedures Forward Modeling Backward Modeling.

Automated Regression Modeling Descriptive vs. Predictive Regression Models Four common automated modeling procedures Forward Modeling Backward Modeling.
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September 20. 2007.

Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
CMPUT 466/551 Principal Source: CMU

CMPUT 466/551 Principal Source: CMU
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2011 –47658 Determining ODE from Noisy Data 31 th CIE, Washington.

P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2011 –47658 Determining ODE from Noisy Data 31 th CIE, Washington.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.

INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
x – independent variable (input)

x – independent variable (input)
Multiple View Geometry

Multiple View Geometry
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.

Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Www.geometrie.tuwien.ac.at IMA Tutorial, 20. 4. 2001 Instantaneous Motions - Applications to Problems in Reverse Engineering and 3D Inspection H. Pottmann.

IMA Tutorial, Instantaneous Motions - Applications to Problems in Reverse Engineering and 3D Inspection H. Pottmann.
Fitting. We’ve learned how to detect edges, corners, blobs. Now what? We would like to form a higher-level, more compact representation of the features.

Fitting. We’ve learned how to detect edges, corners, blobs. Now what? We would like to form a higher-level, more compact representation of the features.
Pointshop 3D An Interactive System for Point-based Surface Editing

Pointshop 3D An Interactive System for Point-based Surface Editing
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.

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

Geometric Optimization Problems in Computer Vision.
Optimal Bandwidth Selection for MLS Surfaces

Optimal Bandwidth Selection for MLS Surfaces
Drawing Parametric Curves Jean-Paul Mueller. Curves - The parametric form of a curve expresses the value of each spatial variable for points on the curve.

Drawing Parametric Curves Jean-Paul Mueller. Curves - The parametric form of a curve expresses the value of each spatial variable for points on the curve.
Bioinformatics Challenge  Learning in very high dimensions with very few samples  Acute leukemia dataset: 7129 # of gene vs. 72 samples  Colon cancer.

Bioinformatics Challenge  Learning in very high dimensions with very few samples  Acute leukemia dataset: 7129 # of gene vs. 72 samples  Colon cancer.
KNN, LVQ, SOM. Instance Based Learning K-Nearest Neighbor Algorithm (LVQ) Learning Vector Quantization (SOM) Self Organizing Maps.

KNN, LVQ, SOM. Instance Based Learning K-Nearest Neighbor Algorithm (LVQ) Learning Vector Quantization (SOM) Self Organizing Maps.
Efficient simplification of point-sampled geometry Mark Pauly Markus Gross Leif Kobbelt ETH Zurich RWTH Aachen.

Efficient simplification of point-sampled geometry Mark Pauly Markus Gross Leif Kobbelt ETH Zurich RWTH Aachen.
Fitting. Choose a parametric object/some objects to represent a set of tokens Most interesting case is when criterion is not local –can’t tell whether.

Fitting. Choose a parametric object/some objects to represent a set of tokens Most interesting case is when criterion is not local –can’t tell whether.

Similar presentations

Ads by Google