Presentation is loading. Please wait.

Presentation is loading. Please wait.

Wiener Subdivision Presented by Koray KAVUKCUOGLU Geometric Modeling Spring 2004.

Similar presentations


Presentation on theme: "Wiener Subdivision Presented by Koray KAVUKCUOGLU Geometric Modeling Spring 2004."— Presentation transcript:

1 Wiener Subdivision Presented by Koray KAVUKCUOGLU Geometric Modeling Spring 2004

2 May 05, 20042 Introduction – Concepts Wiener Filtering – Theory Wiener Subdivision – Midpoint Subdivision – Application of Filter – Parameters Results Outline

3 May 05, 20043 aim – Derive and Implement a subdivison scheme Based on Marc Alexa’s Wiener Filtering of Meshes methodology – Midpoint Linear Subdivision – Create refined mesh – Wiener Filtering – Relocate vertices to obtain a smooth surface Introduction

4 May 05, 20044 – Filtering of Irregular Meshes using Wiener Filter – Recovering original smooth geometry from noisy data Wiener Filtering

5 May 05, 20045 Mesh – Triangular domain  (K,V) connectivity infovertices in R 3 –Topological Distance (  ) Wiener Filtering - Theory

6 May 05, 20046 – Neighborhood Definition m-ring neighborhood Collection of rings, with radius up to m – Expectation linear operator – Correlation Distance between two vertices Wiener Filtering - Theory

7 May 05, 20047 Representation of Vertex Locations vertex position in noisy mesh true vertex position random noise contribution Estimate each point as a linear sum of given noisy points Find coefficients that minimize square of discrepancy Wiener Filtering - Theory

8 May 05, 20048 Wiener Filtering - Theory Linear System Solution of this system gives, coefficients a ij Need to define distance and correlation functions i 1 2 d d d

9 May 05, 20049 Wiener Subdivision development environment – Language C++ – Mesh format GTS – Windows XP – Cygwin external libs / tools – TNT (template numerical toolkit) Supersedes Lapack++ – Jama/C++ (uses TNT - linear system solution) – Mesh Viewer for visualization

10 May 05, 200410 Wiener Subdivision mesh data structure – Tree  each triangle divided into 4 childs – Triangles – Edge Sharing

11 May 05, 200411 Wiener Subdivision mesh refinement – Linear midpoint subdivision

12 May 05, 200412 Wiener Subdivision filtering – computing Topology – compute m-ring neighborhood BFS over vertices – compute distance and correlation x is parameterized for smoothness control

13 May 05, 200413 filtering – solve linear system – LU decomposition method – Jama/C++ Wiener Subdivision

14 May 05, 200414 Wiener Subdivision parameters – size of m-ring neighborhood (1, 2, …) – smoothness parameter – fraction of old vertex location in new location

15 May 05, 200415 results -m1 / -n3 / -sp2

16 May 05, 200416 results -m1 / -n3 / -sp0-m2 / -n3 / -sp2

17 May 05, 200417 results -m1 / -n3 / -sp0 -m2 / -n3 / -sp2 -m1 / -n3 / -sp2

18 May 05, 200418 results -m1 / -n3 / -sp2-m1 / -n3 / -sp2 / -p0.3

19 May 05, 200419 results -m1 / -n3 / -sp2 / -p0.3 -m2 / -n3 / -sp2

20 May 05, 200420 results

21 May 05, 200421 results

22 May 05, 200422 Questions?


Download ppt "Wiener Subdivision Presented by Koray KAVUKCUOGLU Geometric Modeling Spring 2004."

Similar presentations


Ads by Google