construction of manifolds via compatible sparse
play

Construction of Manifolds via Compatible Sparse Representations - PowerPoint PPT Presentation

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


  1. 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

  2. Problem: Fitting Data with Smooth Surface Point Cloud A Smooth Surface

  3. Problem: Fitting Data with Smooth Surface β€’ Challenging: capturing sharp features

  4. Problem: Data Fitting β€’ Input: A set of points 𝑦 𝑗 , 𝑧 𝑗 , 𝑗 = 0, … , π‘œ β€’ Output: A function which fits the point set 𝑧 = 𝑔 ( 𝑦 ) ( 𝑦 π‘œ , 𝑧 π‘œ ) ( 𝑦 𝑗 , 𝑧 𝑗 ) ( 𝑦 0 , 𝑧 0 )

  5. Data Fitting: What Function? β€’ What type of functions for 𝑔 ( 𝑦 ) ? 𝑧 = 𝑔 ( 𝑦 ) ( 𝑦 π‘œ , 𝑧 π‘œ ) ( 𝑦 𝑗 , 𝑧 𝑗 ) ( 𝑦 0 , 𝑧 0 )

  6. 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

  7. 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

  8. 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)

  9. 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 ≀ πœ€

  10. 3D Surface Case

  11. Parameterization of Local Patch

  12. Representing Sharp Features? β€’ Smooth functions cannot represent 𝐷 0 sharp features cusp crease dart

  13. 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

  14. 𝐷 0 Atom Functions β€’ A total of 55 shape functions for vertices with valence 3-7 – Add more atom functions for vertices with valence > 7

  15. 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

  16. How to stitch local patches?

  17. Manifold Representation

  18. 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] β€’ …

  19. Application 1: Approximating Subdivision Surface

  20. Problem β€’ Construct manifolds to approximate subdivision surfaces with sharp features – Orange lines are specified as sharp features Input Mesh Manifold Surface

  21. Construction of the Charts [Ying and Zorin 2004]

  22. Incompatible Local Patches 𝑀 𝑗 𝑀 π‘˜

  23. Global Fitting Error

  24. Global Fitting Error

  25. Optimization Solver Forward error evaluation

  26. Optimization Solver Forward error evaluation Backward Update

  27. Optimization Solver Final Result Local sparse optimization and Global sparse optimization iteratively

  28. Example Control mesh Result Top 5 selected atoms ( 𝐷 0 in red) Close-up

  29. Different Subdivision Rules Control Mesh Different Geometry

  30. More Examples

  31. Application 2: Manifold from Curve Network

  32. Sampling Points on Curves Input curve network Domain manifold Result manifold Sampled points Parameterization

  33. Results Domain mesh Different manifold surfaces from different geometries

  34. Results

  35. Conclusions β€’ A novel manifold construction method β€’ Sparse representation for local geometry β€’ Global compatibility β€’ Representing sharp features

  36. Future Work β€’ No guarantee to capture all geometric features – Learning geometry features β€’ Slow sparsity optimization – Speed up β€’ Other applications – Surface reconstruction, denoising, and compression

  37. Thank you! Ligang Liu, http://staff.ustc.edu.cn/~lgliu

Recommend


More recommend