Curve fitting to point clouds Reporter: Lincong Fang Oct 18, 2006.

Slides:



Advertisements
Similar presentations
1 DATA STRUCTURES USED IN SPATIAL DATA MINING. 2 What is Spatial data ? broadly be defined as data which covers multidimensional points, lines, rectangles,
Advertisements

Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
L1 sparse reconstruction of sharp point set surfaces
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
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
Interpolation and elevation zhu ping zhu ping
Interactive Inverse 3D Modeling James Andrews Hailin Jin Carlo Séquin.
MATHIEU GAUTHIER PIERRE POULIN LIGUM, DEPT. I.R.O. UNIVERSITÉ DE MONTRÉAL GRAPHICS INTERFACE 2009 Preserving Sharp Edges in Geometry Images.
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
Image Segmentation and Active Contour
Segmentation into Planar Patches for Recovery of Unmodeled Objects Kok-Lim Low COMP Computer Vision 4/26/2000.
Kernel Methods for De-noising with Neuroimaging Application
Offset of curves. Alina Shaikhet (CS, Technion)
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
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 ¹.
Topological Data Analysis MATH 800 Fall Topological Data Analysis (TDA) An ε-chain is a finite sequence of points x 1,..., x n such that |x i –
Normal based subdivision scheme for curve and surface design 杨勋年
Development of Empirical Models From Process Data
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Interactive Hairstyle Modeling Using a Sketching Interface Xiaoyang Mao Kouichi Kashio Hiroyuki Kato Atsumi Imamiya CGGM 2002.
1/36 Gridless Method for Solving Moving Boundary Problems Wang Hong Department of Mathematical Information Technology University of Jyväskyklä
Efficient simplification of point-sampled geometry Mark Pauly Markus Gross Leif Kobbelt ETH Zurich RWTH Aachen.
1 Street Generation for City Modeling Xavier Décoret, François Sillion iMAGIS GRAVIR/IMAG - INRIA.
Quadtrees and Mesh Generation Student Lecture in course MATH/CSC 870 Philipp Richter Thursday, April 19 th, 2007.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
A Hybrid Self-Organizing Neural Gas Network James Graham and Janusz Starzyk School of EECS, Ohio University Stocker Center, Athens, OH USA IEEE World.
Improved Error Estimate for Extraordinary Catmull-Clark Subdivision Surface Patches Zhangjin Huang, Guoping Wang School of EECS, Peking University, China.
Accurate, Dense and Robust Multi-View Stereopsis Yasutaka Furukawa and Jean Ponce Presented by Rahul Garg and Ryan Kaminsky.
Projecting points onto a point cloud Speaker: Jun Chen Mar 22, 2007.
B-spline curve approximation zhu ping Outline 1. Application 2. Some works 3. Discussion.
Evolving Curves/Surfaces for Geometric Reconstruction and Image Segmentation Huaiping Yang (Joint work with Bert Juettler) Johannes Kepler University of.
Dual Evolution for Geometric Reconstruction Huaiping Yang (FSP Project S09202) Johannes Kepler University of Linz 1 st FSP-Meeting in Graz, Nov ,
IMAM Institute of Mechanics and Advanced Materials
Computing the shortest path on a polyhedral surface Presented by: Liu Gang
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Surface Reconstruction Using RBF Reporter : Lincong Fang
V. Space Curves Types of curves Explicit Implicit Parametric.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Cut-based & divisive clustering Clustering algorithms: Part 2b Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern.
11 July 2002 Reverse Engineering 1 Dr. Gábor Renner Geometric Modelling Laboratory, Computer and Automation Research Institute.
Point Set Processing and Surface Reconstruction (
Projecting points onto a point cloud with noise Speaker: Jun Chen Mar 26, 2008.
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
T-splines Speaker : 周 联 Mian works Sederberg,T.W., Zheng,J.M., Bakenov,A., Nasri,A., T-splines and T-NURCCS. SIGGRAPH Sederberg,T.W.,
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Image Registration with Hierarchical B-Splines Z. Xie and G. Farin.
ECE-7000: Nonlinear Dynamical Systems Overfitting and model costs Overfitting  The more free parameters a model has, the better it can be adapted.
Ship Computer Aided Design MR 422. Geometry of Curves 1.Introduction 2.Mathematical Curve Definitions 3.Analytic Properties of Curves 4.Fairness of Curves.
Bundle Adjustment A Modern Synthesis Bill Triggs, Philip McLauchlan, Richard Hartley and Andrew Fitzgibbon Presentation by Marios Xanthidis 5 th of No.
Knot placement in B-spline curve approximation Reporter:Cao juan Date:
High Resolution Surface Reconstruction from Overlapping Multiple-Views
Meshless parameterization and surface reconstruction Reporter: Lincong Fang 16th May, 2007.
1 CSIS 7101: CSIS 7101: Spatial Data (Part 1) The R*-tree : An Efficient and Robust Access Method for Points and Rectangles Rollo Chan Chu Chung Man Mak.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Recent Progress in Mesh Parameterization Speaker : ZhangLei.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Detection of closed sharp edges in point clouds Speaker: Liuyu Time:
Reverse Engineering of Point Clouds to Obtain Trimmed NURBS Lavanya Sita Tekumalla Advisor: Prof. Elaine Cohen School of Computing University of Utah Masters.
SIAM Conference on Geometric Desing & Computing Approximation of spatial data with shape constraints Maria Lucia Sampoli University of Siena, Italy.
Registration and Alignment Speaker: Liuyu
Subdivision Schemes. Center for Graphics and Geometric Computing, Technion What is Subdivision?  Subdivision is a process in which a poly-line/mesh is.
Lecture 22: B Spline Curve Properties
Fast nearest neighbor searches in high dimensions Sami Sieranoja
Local Feature Extraction Using Scale-Space Decomposition
From Point Clouds To Trimmed NURBS
Structuring Interactive Cluster Analysis
Mesh Parameterization: Theory and Practice
PPT10: Global and local approximation
Presentation transcript:

Curve fitting to point clouds Reporter: Lincong Fang Oct 18, 2006

Curve fitting The data points are ordered.

Curve fitting to point clouds The data points are unorganized.

Applications Some applications: Reverse engineering Curve design Surface reconstruction Etc.

Approaches overview Preprocess the point clouds Thin the point clouds (Levin98, Lee00) Point clusters (Lin 04) Map into a digital image (Goshtasby00) Mathematical model Parameteric curves Implicit curves Other methods

Curve Reconstruction from unorganized points In-Kwon Lee CAGD 2000

Least squares

Moving Least Squares

The choice of H

Improved Moving Least Squares Delaunay triangulation Euclidean minimum spanning tree (EMSP)

Correlation

Refining

Compare with and without EMST

Ordering points

Example

Approaches overview Preprocess the point clouds Thin the point clouds (Levin98, Lee00) Point clusters (Lin 04) Map into a digital image (Goshtasby00) Mathematical model Parameteric curves Implicit curves Other methods

Curve reconstruction based on interval B-spline curve Hongwei Lin, Wei Chen, Guojin Wang The Visual Computer,21(6), ,2005

Overview

Shape-based joining scheme

Sequence Joining Method

Boundary sequence

Example

Approaches overview Preprocess the point clouds Thin the point clouds (Levin98, Lee00) Point clusters (Lin 04) Map into a digital image (Goshtasby00) Mathematical model Parameteric curves Implicit curves Other methods

Grouping and parameterizing irregularly spaced points for curve fitting Ardeshir Goshtasby ACM Transactions on Graphics, 19: , 2000

Minor and major ridges

Map into a digital image

Minor and major ridges

Example

Approaches overview Preprocess the point clouds Thin the point clouds (Levin98, Lee00) Point clusters (Lin 04) Map into a digital image (Goshtasby00) Mathematical model Parameteric curves Implicit curves Other methods

Multidimensional curve fitting to unorganized data points by nonlinear minimization Lian Fang, David C Gossard CAD 95

Physical analogy

Error term

Example

Fitting B-spline curves to point clouds by curvature-based squared distance minimization Wenping Wang, Helmut Pottmann, Yang Liu ToG 2006

Point distance minimization

Tangent distance minimization

Squared distance minimization Pottman 2003

Squared distance minimization

Comparison PDM has slow convergence TDM has fast but unstable convergence SDM yields a more balanced performance between efficiency and stability

Comparison Initial curve The fitting curve generated by PDM, TDM, SDM in 50 iterations

Foot point computation

Open curves

Initial curves and control points Specify by user Compute a quadtree partition of the data points Automatic or specify by user, and adjustment (Yang 2004)

Example

Reconstructing B-spline curves from point clouds — A tangential flow approach using least squares minimization Yang Liu, Huaiping Yang, Wenping Wang Shape Modeling and Applications, 2005 International Conference

Input Unacceptable point clouds.

Data Analysis

Initialization and approximation Random point S I Fitting line L B-spline curve

Growing

Knot insertion All points are handled, add a knot where the maximum error occurs Else insert a knot and redistribute all the knots and make them equally spaced

Finding projection points Sharp corners

Filtering points T

Other cases Less control points EMST with wrong topologyVery sharp corner

Example

Approaches overview Preprocess the point clouds Thin the point clouds (Levin98, Lee00) Point clusters (Lin 04) Map into a digital image (Goshtasby00) Mathematical model Parameteric curves Implicit curves Other methods

Fitting unorganized point clouds with active implicit B-spline curves Zhouwang Yang, Jiansong Deng, Falai Chen Visual Computer 2005

Example

Approaches overview Preprocess the point clouds Thin the point clouds (Levin98, Lee00) Point clusters (Lin 04) Map into a digital image (Goshtasby00) Mathematical model Parameteric curves Implicit curves Other methods

Conclusion Complex topology Digital image Implicit curves Tangential flow Initial curves Parameteric curves Implicit curves

Problems and future work Knot insertion Foot point compute Singular points Surface reconstruction