Construction of Manifolds via Compatible Sparse Representations Ruimin Wang, Ligang Liu , Zhouwang Yang, Kang Wang, Wen Shan, Jiansong Deng, Falai Chen University of Science and Technology of China
Problem: Fitting Data with Smooth Surface Point Cloud A Smooth Surface
Problem: Fitting Data with Smooth Surface β’ Challenging: capturing sharp features
Problem: Data Fitting β’ Input: A set of points π¦ π , π§ π , π = 0, β¦ , π β’ Output: A function which fits the point set π§ = π ( π¦ ) ( π¦ π , π§ π ) ( π¦ π , π§ π ) ( π¦ 0 , π§ 0 )
Data Fitting: What Function? β’ What type of functions for π ( π¦ ) ? π§ = π ( π¦ ) ( π¦ π , π§ π ) ( π¦ π , π§ π ) ( π¦ 0 , π§ 0 )
Data Fitting: Function Space β’ Assuming: basis functions { π π π¦ , π = 0, β¦ , π } β’ Finding a member in a family of functions: π π ( π¦ ) = οΏ½ π½ π π π ( π¦ ) π=0 i.e., representing π ( π¦ ) as a (coefficient) point π½ = ( π½ 0 , π½ 1 ,β¦, π½ π ) in π π+1 β’ Finding optimal ( π½ 0 , π½ 1 ,β¦, π½ π ) by minimizing the fitting error: π½ ( π§ π β π ( π¦ π )) 2 min
Data Fitting: Function Space β’ Basis functions { π π π¦ , π = 0, β¦ , π } β Polynomial function basis {1, π¦ , π¦ 2 , β¦ , π¦ π } β Trigonometric function basis {1, sin π¦ , cos π¦ , sin 2π¦ , cos 2π¦ , β¦ } β Exponential function basis {1, π π¦ , π 2π¦ , β¦ , π ππ¦ } β β¦ β’ If we choose enough number of basis ( π = π ) , the fitting error can be 0! β the fitting function π ( π¦ ) is an interpolation
Overfitting Problem β’ How to choose appropriate number of basis? π½ 0 + π½ 1 π¦ + π½ 2 π¦ 2 + π½ 3 π¦ 3 + π½ 4 π¦ 4 π½ 0 + π½ 1 π¦ π½ 0 + π½ 1 π¦ + π½ 2 π¦ 2 High bias βJust rightβ High variance (underfitting) (overfitting)
Sparse Representation β’ An over-complete dictionary (atom functions) β Finding a βbestβ fit from larger family of functions β’ Choose as least number of basis as possible β most of the elements of π½ = ( π½ 0 , π½ 1 ,β¦, π½ π ) are 0 β i.e., π½ 0 (number of non-zero elements) is less than some threshold π π½ ( π§ π β π ( π¦ π )) 2 π½ ( π§ π β π ( π¦ π )) 2 min min s.t. π½ 0 β€ π
3D Surface Case
Parameterization of Local Patch
Representing Sharp Features? β’ Smooth functions cannot represent π· 0 sharp features cusp crease dart
Idea: π· 0 Atom Functions β’ Introduce π· 0 atom functions in the dictionary β Shape functions representing non-smooth finite elements in FEM β’ Each atom function β A bilinear quadrilateral element shape function defined on one edge A π· 0 atom function defined on the edge (in red) of a vertex (in green) with valence 5
π· 0 Atom Functions β’ A total of 55 shape functions for vertices with valence 3-7 β Add more atom functions for vertices with valence > 7
Dictionary: Total Atom Functions β’ 120 polynomial functions with degree up to 14 β’ 55 π· 0 atom functions Underfitting Overfitting Result by A patch with sparse fitting sharp features
How to stitch local patches?
Manifold Representation
Previous Works on Manifold Construction β’ [Grimm and Hughes 1995] β’ [Ying and Zorin 2004] β’ [Gu et al. 2006] β’ [Wang et al. 2008] β’ [Della Vecchia and Juettler 2009] β’ [Tosun and Zorin 2011] β’ β¦
Application 1: Approximating Subdivision Surface
Problem β’ Construct manifolds to approximate subdivision surfaces with sharp features β Orange lines are specified as sharp features Input Mesh Manifold Surface
Construction of the Charts [Ying and Zorin 2004]
Incompatible Local Patches π€ π π€ π
Global Fitting Error
Global Fitting Error
Optimization Solver Forward error evaluation
Optimization Solver Forward error evaluation Backward Update
Optimization Solver Final Result Local sparse optimization and Global sparse optimization iteratively
Example Control mesh Result Top 5 selected atoms ( π· 0 in red) Close-up
Different Subdivision Rules Control Mesh Different Geometry
More Examples
Application 2: Manifold from Curve Network
Sampling Points on Curves Input curve network Domain manifold Result manifold Sampled points Parameterization
Results Domain mesh Different manifold surfaces from different geometries
Results
Conclusions β’ A novel manifold construction method β’ Sparse representation for local geometry β’ Global compatibility β’ Representing sharp features
Future Work β’ No guarantee to capture all geometric features β Learning geometry features β’ Slow sparsity optimization β Speed up β’ Other applications β Surface reconstruction, denoising, and compression
Thank you! Ligang Liu, http://staff.ustc.edu.cn/~lgliu
Recommend
More recommend