Department of Computer Science and Engineering Defining and Computing Curve-skeletons with Medial Geodesic Function Tamal K. Dey and Jian Sun The Ohio.

Slides:



Advertisements
Similar presentations
An Adaptive MLS Surface for Reconstruction with Guarantees
Advertisements

Slide 1 Insert your own content. Slide 2 Insert your own content.
Department of Computer Science and Engineering Normal Estimation for Point Clouds: A Comparison Study for a Voronoi Based Method Tamal K. DeyGang LiJian.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
On the properties of relative plausibilities Computer Science Department UCLA Fabio Cuzzolin SMC05, Hawaii, October
1 Two dimensional thining Let P =(V, m, n, B) and P ' = (V, m, n, B - D) be digital pictures, where D B. Then we say that P' is obtained from P by deleting.
A Minimum Cost Path Search Algorithm Through Tile Obstacles Zhaoyun Xing and Russell Kao Sun Microsystems Laboratories.
CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Skeleton and Thinning (Part II) Fall 2013.
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
1 Motion and Manipulation Configuration Space. Outline Motion Planning Configuration Space and Free Space Free Space Structure and Complexity.
Properties of Exponents
Computer Graphics- SCC 342
Addition 1’s to 20.
Test B, 100 Subtraction Facts
Week 1.
1 st Meeting, Industrial Geometry, 2005 Approximating Solids by Balls (in collaboration with subproject: "Applications of Higher Geometrics") Bernhard.
Anna Yershova 1, Steven M. LaValle 2, and Julie C. Mitchell 3 1 Dept. of Computer Science, Duke University 2 Dept. of Computer Science, University of Illinois.
13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Shape Analysis (Part II) Fall 2014.
Problems in curves and surfaces M. Ramanathan Problems in curves and surfaces.
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.
Proximity graphs: reconstruction of curves and surfaces
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
1/20 Using M-Reps to include a-priori Shape Knowledge into the Mumford-Shah Segmentation Functional FWF - Forschungsschwerpunkt S092 Subproject 7 „Pattern.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Computational Topology for Computer Graphics Klein bottle.
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
The Voronoi Diagram David Johnson. Voronoi Diagram Creates a roadmap that maximizes clearance –Can be difficult to compute –We saw an approximation in.
Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Discrete Geometry Tutorial 2 1
1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.
A Simple and Robust Thinning Algorithm on Cell Complexes
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
The generic model of a modular machine vision system
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.
Segmentation Reporter: Xiaoqun Wu Date: 2008/10/30.
By Dor Lahav. Overview Straight Skeletons Convex Polygons Constrained Voronoi diagrams and Delauney triangulations.
Tamal K. Dey The Ohio State University Delaunay Meshing of Surfaces.
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
3D Thinning on Cell Complexes for Computing Curve and Surface Skeletons Lu Liu Advisor: Tao Ju Master Thesis Defense Dec 18 th, 2008.
Junjun Pan 1, Xiaosong Yang 1, Xin Xie 1, Philip Willis 2, Jian J Zhang 1
Statistical analysis of pore space geometry Stefano Favretto Supervisor : Prof. Martin Blunt Petroleum Engineering and Rock Mechanics Research Group Department.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
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.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Extended Grassfire Transform on Medial Axes of 2D Shapes
Chapter 3 cont’d. Binary Image Analysis. Binary image morphology (nonlinear image processing)
Computing a Family of Skeletons of Volumetric Models for Shape Description Tao Ju Washington University in St. Louis.
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
Shape Reconstruction From Planar Cross Sections CAI Hongjie | May 28, 2008.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
CSE554SkeletonsSlide 1 CSE 554 Lecture 2: Shape Analysis (Part I) Fall 2015.
A New Voronoi-based Reconstruction Algorithm
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
References Books: Chapter 11, Image Processing, Analysis, and Machine Vision, Sonka et al Chapter 9, Digital Image Processing, Gonzalez & Woods.
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
Department of Computer Science and Engineering On Computing handles and tunnels for surfaces Tamal K. DeyKuiyu LiJian Sun.
Lecture 9 : Point Set Processing
CSE 554 Lecture 2: Shape Analysis (Part I)
Neutrosophic Mathematical Morphology for Medical Image
CSE 554 Lecture 3: Shape Analysis (Part II)
Neutrosophic approach for mathematical morphology.
Presentation transcript:

Department of Computer Science and Engineering Defining and Computing Curve-skeletons with Medial Geodesic Function Tamal K. Dey and Jian Sun The Ohio State University

2/16 Department of Computer Science and Engineering 1D representation of 3D shapes, called curve-skeleton, useful in many application Geometric modeling, computer vision, data analysis, etc Reduce dimensionality Build simpler algorithms Desirable properties [Cornea et al. 05] centered, preserving topology, stable, etc Issues No formal definition enjoying most of the desirable properties Existing algorithms often application specific Motivation

3/16 Department of Computer Science and Engineering Give a mathematical definition of curve-skeletons for 3D objects bounded by connected compact surfaces Enjoy most of the desirable properties Give an approximation algorithm to extract such curve- skeletons Practically plausible Contributions

4/16 Department of Computer Science and Engineering Roadmap

5/16 Department of Computer Science and Engineering Medial axis: set of centers of maximal inscribed balls The stratified structure [Giblin-Kimia04]: g enerically, the medial axis of a surface consists of five types of points based on the number of tangential contacts. M 2 : inscribed ball with two contacts, form sheets M 3 : inscribed ball with three contacts, form curves Others: Medial axis

6/16 Department of Computer Science and Engineering Medial geodesic function (MGF)

7/16 Department of Computer Science and Engineering Properties of MGF Property 1 (proved): f is continuous everywhere and smooth almost everywhere. The singularity of f has measure zero in M 2. Property 2 (observed): There is no local minimum of f in M 2. Property 3 (observed): At each singular point x of f there are more than one shortest geodesic paths between a x and b x.

8/16 Department of Computer Science and Engineering Defining curve-skeletons Sk 2 =Sk Å M 2 : the set of singular points of MGF or points with negative divergence w.r.t. r f Sk 3 =Sk Å M 3 : A point of other three types is on the curve-skeleton if it is the limit point of Sk 2 [ Sk 3

9/16 Department of Computer Science and Engineering Defining curve-skeletons Sk 2 =Sk Å M 2 : set of singular points of MGF or points with negative divergence w.r.t. r f Sk 3 =Sk Å M 3 : extending the view of divergence A point of other three types is on the curve-skeleton if it is the limit point of Sk 2 [ Sk 3 Sk=Cl(Sk 2 [ Sk 3 )

10/16 Department of Computer Science and Engineering Computing curve-skeletons MA approximation [Dey-Zhao03] : subset of Voronoi facets MGF approximation: f(F) and (F) Marking: E is marked if (F) ² n < for all incident Voronoi facets Erosion: proceed in collapsing manner and guided by MGF

11/16 Department of Computer Science and Engineering Examples

12/16 Department of Computer Science and Engineering Properties of curve-skeletons Thin (1D curve) Centered Homotopy equivalent Junction detective Stable Prop1: set of singular points of MGF is of measure zero in M 2 Medial axis is in the middle of a shape Prop3: more than one shortest geodesic paths between its contact points Medial axis homotopy equivalent to the original shape Curve-skeleton homotopy equivalent to the medial axis

13/16 Department of Computer Science and Engineering Effect of

14/16 Department of Computer Science and Engineering Shape eccentricity and computing tubular regions Eccentricity: e(E)=g(E) / c(E) Compute tubular regions classify skeleton edges and mesh faces based on a given threshold depth first search

15/16 Department of Computer Science and Engineering Shape eccentricity and computing tubular regions Eccentricity: e(E)=g(E) / c(E)

16/16 Department of Computer Science and Engineering Timing

Department of Computer Science and Engineering Thank you!