Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.

Slides:



Advertisements
Similar presentations
1 Manifold Alignment for Multitemporal Hyperspectral Image Classification H. Lexie Yang 1, Melba M. Crawford 2 School of Civil Engineering, Purdue University.
Advertisements

Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
2D/3D Shape Manipulation, 3D Printing
Surface Reconstruction From Unorganized Point Sets
Active Contours, Level Sets, and Image Segmentation
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.
A Geometric Perspective on Machine Learning 何晓飞 浙江大学计算机学院 1.
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction Keywords: Dimensionality reduction, manifold learning, subspace learning,
Presented by: Mingyuan Zhou Duke University, ECE April 3, 2009
Image Denoising using Locally Learned Dictionaries Priyam Chatterjee Peyman Milanfar Dept. of Electrical Engineering University of California, Santa Cruz.
2D/3D Shape Manipulation, 3D Printing
Discrete Geometry Tutorial 2 1
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Shape Space Exploration of Constrained Meshes Yongliang Yang, Yijun Yang, Helmut Pottmann, Niloy J. Mitra.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Graph Based Semi- Supervised Learning Fei Wang Department of Statistical Science Cornell University.
CS CS 175 – Week 2 Processing Point Clouds Local Surface Properties, Moving Least Squares.
1 GEOMETRIE Geometrie in der Technik H. Pottmann TU Wien SS 2007.
Correspondence & Symmetry
1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.
Manifold Learning: ISOMAP Alan O'Connor April 29, 2008.
Optimal Bandwidth Selection for MLS Surfaces
Three Algorithms for Nonlinear Dimensionality Reduction Haixuan Yang Group Meeting Jan. 011, 2005.
1 NHDC and PHDC: Local and Global Heat Diffusion Based Classifiers Haixuan Yang Group Meeting Sep 26, 2005.
Matthias Kawski “Curvature for everyone” Asian Technology Conf. Mathematics Taiwan Curvature for all Matthias.
Atul Singh Junior Undergraduate CSE, IIT Kanpur.  Dimension reduction is a technique which is used to represent a high dimensional data in a more compact.
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Robust Statistical Estimation of Curvature on Discretized Surfaces Evangelos Kalogerakis Patricio Simari Derek Nowrouzezahrai Karan Singh Symposium on.
NonLinear Dimensionality Reduction or Unfolding Manifolds Tennenbaum|Silva|Langford [Isomap] Roweis|Saul [Locally Linear Embedding] Presented by Vikas.
Nonlinear Dimensionality Reduction by Locally Linear Embedding Sam T. Roweis and Lawrence K. Saul Reference: "Nonlinear dimensionality reduction by locally.
Diffusion Maps and Spectral Clustering
Nonlinear Dimensionality Reduction Approaches. Dimensionality Reduction The goal: The meaningful low-dimensional structures hidden in their high-dimensional.
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Automatic Posing of a Meshed Human Model Using Point Clouds Lei Wang Joint work with Tamal K. Dey, Huamin.
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Modal Shape Analysis beyond Laplacian (CAGP 2012) Klaus Hildebrandt, Christian Schulz, Christoph von Tycowicz, Konrad Polthier (brief) Presenter: ShiHao.Wu.
TEMPLATE BASED SHAPE DESCRIPTOR Raif Rustamov Department of Mathematics and Computer Science Drew University, Madison, NJ, USA.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Graph Embedding: A General Framework for Dimensionality Reduction Dong XU School of Computer Engineering Nanyang Technological University
Finite Element Method.
IEEE TRANSSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
Discontinuous Galerkin Methods Li, Yang FerienAkademie 2008.
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
Computer Vision Lab. SNU Young Ki Baik Nonlinear Dimensionality Reduction Approach (ISOMAP, LLE)
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
GRASP Learning a Kernel Matrix for Nonlinear Dimensionality Reduction Kilian Q. Weinberger, Fei Sha and Lawrence K. Saul ICML’04 Department of Computer.
Manifold learning: MDS and Isomap
Nonlinear Dimensionality Reduction Approach (ISOMAP)
H. Lexie Yang1, Dr. Melba M. Crawford2
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Math 285 Project Diffusion Maps Xiaoyan Chong Department of Mathematics and Statistics San Jose State University.
Implicit Active Shape Models for 3D Segmentation in MR Imaging M. Rousson 1, N. Paragio s 2, R. Deriche 1 1 Odyssée Lab., INRIA Sophia Antipolis, France.
Energy-minimizing Curve Design Gang Xu Zhejiang University Ouyang Building, 20-December-2006.
Value Function Approximation with Diffusion Wavelets and Laplacian Eigenfunctions by S. Mahadevan & M. Maggioni Discussion led by Qi An ECE, Duke University.
Spectral Methods for Dimensionality
Intrinsic Data Geometry from a Training Set
3-D Point Clouds Cluster
Unsupervised Riemannian Clustering of Probability Density Functions
Machine Learning Basics
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Outline Nonlinear Dimension Reduction Brief introduction Isomap LLE
Local Feature Extraction Using Scale-Space Decomposition
Domain-Modeling Techniques
Object Modeling with Layers
3-D Point Clouds Cluster
Scale-Space Representation for Matching of 3D Models
Scale-Space Representation for Matching of 3D Models
Using Manifold Structure for Partially Labeled Classification
Presentation transcript:

Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami operator

 Motivation and problems  Solving PDEs on point clouds  Moving least square method  Local mesh method  Geometric understanding of point clouds  Conclusion Outlines

 Point Cloud is a set of points with no ordering and connection. It is the most basic, natural and intrinsic representation of geometric object and data with nonlinear structures in 3D and high dimension.  Point clouds can be ideally treated as data sampled from n-dimensional manifold in R^d. Motivation and Problems 3D modeling high dimension data global recognition intrinsic distance

Challenges  Highly unstructured geometric objects. Global mesh based approaches or implicit approaches can not be applied.  No natural basis for representation.  Non-uniform sampling  Solve geometric PDEs and variation problems on point clouds. Need to approximate differential operators and integrals on point clouds.  Obtain global structure and geometric understanding of point clouds then underlying nonlinear structures. Questions ?

Previous methods  PDEs on point clouds PCD Laplacian: M Blkin, J. Sun, Y. Wang, 2009 o Use heat diffusion in the ambient space R^d o Lower order approximation o Only restricted on Laplacian  Integral approximation on point clouds o Statistical approach, Monte carlo integration o Cauchy- Crofton formula. X. Li et. al o Voronoi weight scheme. C. Liu et. al 2009

Solving PDEs on point clouds Two systematic methods are developed to solve PDEs on point clouds. Key features of our methods:  No global mesh or global parameterization is needed.  Only local information such as K nearest neighbors are needs.  Our methods works for manifolds with point clouds sampled from manifold with any dimension and co-dimension.  The complexity scales well with the total number of points and the true dimension of the underlying manifold. Moreover, we would like to have geometric understanding of point clouds using the results of PDEs on point clouds.

Differential operators on manifolds  Surface gradient operator  Laplace-Beltrami operator

Moving Least square method  K nearest neighbor (KNN)  Locally principle component analysis (PCA) Local Coordinate system construction

Moving Least square method  KNN of have local coordinate  Find a local degree two polynomial by minimizing the following weighted sum: Local manifold approximation is a smooth representation of the surface near

Moving Least square method Local function approximation  Similarly, locally approximate function by minimizing the following weighted sum:  In the local coordinate system, manifolds and functions are smoothly defined.  Then standard definition of differential operators in differential geometry can be applied. Key points:

Local mesh method  K nearest neighbor (KNN)  Locally principle component analysis (PCA)  Global triangle Mesh structures are hard to have, in particular in high dimension case.  local mesh structures are relatively easy to have in the flat tangent space.  Local Delaunay triangulation can be applied on the tangent space, then local connectivity are adapted to the neighbor of each point. Local Mesh construction

Local mesh method Differential operators approximation

Local mesh method Integral approximation Mass Matrix : Stiffness Matrix :

Point clouds from n-dimension manifolds in R^d  Using local PCA on KNN can find local dimension of the manifold as well as the tangent and normal spaces.  Local approximation of manifolds and functions can be parameterized on tangent spaces.  Local mesh structures on tangent space can be also obtained. The complexity of our methods scales well with the true dimension of the manifold

Integrals on point clouds C. Luo, J. Sun, Y. Wang. Integral estimation from point cloud in d-dimensional space: a geometric view. SCG. 2009

The heat diffusion using both methods

The Ekinoal equation

Geodesic tracking

The Helmholtz equation M Blkin, J. Sun, Y. Wang, Constructing Laplace operator from point clouds in R^d. ACM-SIAM SDA, 2009

The Helmholtz equation

Relation between LB Eigen-system and surface geometry  Sturm-Liouville: Heat kernel:  Heat trace asymptotic expansion:  LB eigenfunctions are Morse functions.  LB spectral embedding. where B is the boundary of M, K is the Gauss curvature of M and J is the mean curvature of B in M. Moreover, if M is a closed surface with euler number (M), then c 2 = 2 (M)/3

From local to global: Laplace-Beltrami operator Reeb graphs and Skeleton structures Generically, LB eigenfunctions are a Morse function for most of surfaces

Point clouds comparison/registration

Point clouds clustering/segmentation/

Global information: conformal structures extraction

Conclusions: ◦ Two systematic methods to solve PDEs on point clouds ◦ Solve problems on any dimension and co-dimension ◦ Computational complexity scales well with the number of points and the true dimension of the underlying manifolds. ◦ Has potential to extract geometric information for nonlinear structures. ◦ Explore more applications on 3D modeling and data science.

Thanks for your attention! For more computation about the LB eigenproblem on manifolds and applications, please check Rongjie Lai University of Southern California Our papers: Rongjie Lai, Jian Liang and Hongkai Zhao, A Local Mesh Method for Solving PDEs on Point Clouds, UCLA CAM Report, Jian Liang, Rongjie Lai, Tsz Wai Wong and Hongkai Zhao, Geometric Understanding of Point Clouds Using Laplace-Beltrami operator, CVPR, 2012 Jian Liang and Hongkai Zhao, Solving Partial Differential Equations on Point Clouds, UCLA CAM Report, 12-25