Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena.

Slides:



Advertisements
Similar presentations
Department of Computer Science and Engineering Normal Estimation for Point Clouds: A Comparison Study for a Voronoi Based Method Tamal K. DeyGang LiJian.
Advertisements

Department of Computer Science and Engineering Defining and Computing Curve-skeletons with Medial Geodesic Function Tamal K. Dey and Jian Sun The Ohio.
Alpha Shapes. Used for Shape Modelling Creates shapes out of point sets Gives a hierarchy of shapes. Has been used for detecting pockets in proteins.
Ter Haar Romeny, ICPR 2010 Introduction to Scale-Space and Deep Structure.
1 st Meeting, Industrial Geometry, 2005 Approximating Solids by Balls (in collaboration with subproject: "Applications of Higher Geometrics") Bernhard.
Tyler White MATH 493 Dr. Wanner
CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Shape Analysis (Part II) Fall 2014.
Surface Reconstruction From Unorganized Point Sets
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.
Center for Computational Visualization Institute of Computational and Engineering Sciences Department of Computer Sciences University of Texas at Austin.
Omer Bobrowski Mathematics Department Duke University Joint work with Sayan Mukherjee 6/19/13.
Proximity graphs: reconstruction of curves and surfaces
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
Computational Topology for Computer Graphics Klein bottle.
Topology-Based Analysis of Time-Varying Data Scalar data is often used in scientific data to represent the distribution of a particular value of interest,
Sampling conditions and topological guarantees for shape reconstruction algorithms Andre Lieutier, Dassault Sytemes Thanks to Dominique Attali for some.
Sample Shuffling for Quality Hierarchic Surface Meshing.
Discrete Geometry Tutorial 2 1
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
Provides mathematical tools for shape analysis in both binary and grayscale images Chapter 13 – Mathematical Morphology Usages: (i)Image pre-processing.
Computing Medial Axis and Curve Skeleton from Voronoi Diagrams Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Joint.
1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton.
Image Segmentation some examples Zhiqiang wang
T. J. Peters, University of Connecticut K. Abe, A. C. Russell, J. Bisceglio, E.. Moore, D. R. Ferguson, T. Sakkalis Topological.
Tamal K. Dey The Ohio State University Delaunay Meshing of Surfaces.
Docking of Protein Molecules
Data Analysis and Visualization Using the Morse-Smale complex
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Surface Reconstruction Some figures by Turk, Curless, Amenta, et al.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Delaunay Triangulations for 3D Mesh Generation Shang-Hua Teng Department of Computer Science, UIUC Work with: Gary Miller, Dafna Talmor, Noel Walkington.
1 Street Generation for City Modeling Xavier Décoret, François Sillion iMAGIS GRAVIR/IMAG - INRIA.
T. J. Peters, University of Connecticut K. Abe, J. Bisceglio, A. C. Russell Computational Topology on Approximated Manifolds.
Finding generators for H1.
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
Contributed Talk at the International Workshop on VISUALIZATION and MATHEMATICS 2002 Thomas Lewiner, Hélio Lopes, Geovan Tavares Math&Media Laboratory,
3D Thinning on Cell Complexes for Computing Curve and Surface Skeletons Lu Liu Advisor: Tao Ju Master Thesis Defense Dec 18 th, 2008.
1/61 Department of Computer Science and Engineering Tamal K. Dey The Ohio State University Delaunay Refinement and Its Localization for Meshing.
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
Multi-Scale Dual Morse Complexes for Representing Terrain Morphology E. Danovaro Free University of Bolzano, Italy L. De Floriani University of Genova,
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Department of Computer Science and Engineering Practical Algorithm for a Large Class of Domains Tamal K. Dey and Joshua A. Levine The Ohio State University.
Top-points in Image Matching Bram Platel Evgenya Balmashnova Luc Florack Bart ter Haar Romeny.
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Extended Grassfire Transform on Medial Axes of 2D Shapes
Approximate Convex Decomposition of Polygons Reporter: Hong guang Zhou Math Dept. ZJU May 17th, 2007 Jyh-Ming Lien Nancy M. Amato Computational Geometry:
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.
CSE554SkeletonsSlide 1 CSE 554 Lecture 2: Shape Analysis (Part I) Fall 2015.
Bart M. ter Haar Romeny.  Question: can top-points be used for object- retrieval tasks?
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
Detecting Undersampling in Surface Reconstruction Tamal K. Dey and Joachim Giesen Ohio State University.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
Medial Axis Extraction of 3D Objects Through Radial Basis Functions Ming Ouhyoung, Professor Communication and Multimedia Lab Dept. of CSIE, National Taiwan.
A New Voronoi-based Reconstruction Algorithm
Intelligent Database Systems Lab Presenter : YAN-SHOU SIE Authors : MARCO PIASTRA NN Self-organizing adaptive map: Autonomous learning of curves.
Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.
With Tamal Dey, Qichao Que, Issam Safa, Lei Wang, Yusu Wang Computer science and Engineering The Ohio State University Xiaoyin Ge.
Introduction to Scale Space and Deep Structure. Importance of Scale Painting by Dali Objects exist at certain ranges of scale. It is not known a priory.
Regularized Least-Squares and Convex Optimization.
Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.
Lecture 9 : Point Set Processing
Decimating Samples for Mesh Simplification
CSE 554 Lecture 2: Shape Analysis (Part I)
Shape Dimension and Approximation from Samples
René Vidal and Xiaodong Fan Center for Imaging Science
Localized Delaunay Refinement For Piecewise-Smooth Complexes
Introduction to Algebraic Topology and Persistent Homology
Presentation transcript:

Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena

Points

Surface reconstruction

Proteins: feature extraction

The Flow Complex joint work with Matthias John

Distance function

x d(x) x

Distance function

Gradient flow

Critical points maxima saddle points

Flow and critical points

Stable manifolds

Flow complex

Back to three dimensions

Stable manifolds

Surface Reconstruction (first attempt) joint work with Matthias John

Surface Reconstruction Flow complex Surface reconstruction

Pairing and cancellation Pairing of maxima and saddle points

Pairing and cancellation Pairing of maxima and saddle points Cancellation of pair with minimal difference between distance values

Pairing and cancellation Pairing of maxima and saddle points Cancellation of pair with minimal difference between distance values

Pairing and cancellation Pairing of maxima and saddle points Cancellation of pair with minimal difference between distance values Until “topologically” correct surface

Pairing and cancellation Pairing of maxima and saddle points Cancellation of pair with minimal difference between distance values Until “topologically” correct surface

Pairing and cancellation Pairing of maxima and saddle points Cancellation of pair with minimal difference between distance values Until “topologically” correct surface

Pairing and cancellation Pairing of maxima and saddle points Until “topologically” correct surface Cancellation of pair with minimal difference between distance values

Pairing and cancellation Result is a (possibly pinched) closed surface

Experimental results Buddha 144,647 pts Hip 132,538 pts

Experimental results Dragon 100,250 pts Noise added

Pockets in Proteins joint work Matthias John

Pockets in proteins Weighted flow complex Pockets in molecules

Power distance Let (p,w) be a weighted point. Power distance: |x-p|² - w x √w p

Distance to weighted points

The weighted flow complex The weighted flow complex is also defined as the collection of stable manifolds.

Pockets in proteins

Growing balls model

Pockets in proteins Topological events correspond to critical points of the distance function Pocket: connected component of union of stable manifolds of positive critical points

Visualization Pocket visualization: stable manifolds of negative critical points in the boundary Mouth: (connected component of) stable manifolds of positive critical points in the boundary of a pocket

Examples Void (no mouth) Ordinary pocket (one mouth) Tunnel (two or more)

Examples Alphatoxin

Surface Reconstruction joint work with Tamal Dey, Edgar Ramos and Bardia Sadri

For a dense sample of a smooth surface the critical points are either close to the surface or close to the medial axis of the surface. Theorem

Medial axis Distance function is not differentiable on medial axis.

Sampling condition

Theorem For a dense  -sample of a smooth surface the reconstruction is homeomorphic and geometrically close to the original surface.

Medial Axis Approximation joint work with Edgar Ramos and Bardia Sadri

Gradient flow

Unstable manifolds of medial axis critical points.

For a dense  -sample of a smooth surface the union of the unstable manifolds of medial axis critical points is homotopy equivalent to the medial axis. Theorem

The medial axis core

Shape Segmentation / Matching joint work with Tamal Dey and Samrat Goswami

Gradient flow and critical points Anchor hulls and drivers of the flow.

Segmentation (2D)

Segmentation (3D)

Matching (2D)

Matching (3D)

Flow Shapes and Alpha Shapes joint work with Matthias John and Tamal Dey

Flow Shapes Flow Shapes: inserting the stable manifolds in order of increasing values of the distance function at the critical points

Flow Shapes Flow Shapes: inserting the stable manifolds in order of increasing values of the distance function at the critical points

Flow Shapes Flow Shapes: inserting the stable manifolds in order of increasing values of the distance function at the critical points

Flow Shapes Flow Shapes: inserting the stable manifolds in order of increasing values of the distance function at the critical points

Flow Shapes Flow Shapes: inserting the stable manifolds in order of increasing values of the distance function at the critical points

Flow Shapes: inserting the stable manifolds in order of increasing values of the distance function at the critical points Flow Shapes Finite Sequence C¹…Cⁿ of cell complexes. C¹ = P (point set) Cⁿ = Flow complex

Alpha Shapes Alpha Shapes: Delaunay complex restricted to a union of balls centered at the sample points

Alpha Shapes Alpha Shapes: Delaunay complex restricted to a union of balls centered at the sample points

Alpha Shapes Alpha Shapes: Delaunay complex restricted to a union of balls centered at the sample points

Alpha Shapes Alpha Shapes: Delaunay complex restricted to a union of balls centered at the sample points

Alpha Shapes Alpha Shapes: Delaunay complex restricted to a union of balls centered at the sample points Finite Sequence C¹…Cⁿ´ of cell complexes, n´ ≥ n. C¹ = P (point set) Cⁿ´ = Delaunay triangulation

Theorem For every α ≥ 0 the flow shape corresponding to the distance value α and the alpha shape corresponding to balls of radius α are homotopy equivalent.

Comparison of the shapes Flow shapeAlpha shape

Comparison of the shapes Flow shapeAlpha shape

Comparison of the shapes Flow shapeAlpha shape

Comparison of the shapes Flow shapeAlpha shape

The End Thank you!