3D Thinning on Cell Complexes for Computing Curve and Surface Skeletons Lu Liu Advisor: Tao Ju Master Thesis Defense Dec 18 th, 2008.

Slides:



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

CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Skeleton and Thinning (Part II) Fall 2013.
CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Shape Analysis (Part II) Fall 2014.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
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.
A Simple and Robust Thinning Algorithm on Cell Complexes
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
University of Houston Clear Lake Computer Applications UHCL Conference 2D & 3D Image Compression with Skeletonization Dr. Liwen Shih Sam Tran.
Computing Medial Axis and Curve Skeleton from Voronoi Diagrams Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Joint.
Image Segmentation some examples Zhiqiang wang
Robust Repair of Polygonal Models Tao Ju Rice University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
Complex Networks for Representation and Characterization of Object For CS790g Project Bingdong Li 11/9/2009.
GATE D Object Representations (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager SimBT.
Explaining High-Dimensional Data
Modeling and Deformation of Arms and Legs Based on Ellipsoidal Sweeping Speaker: Alvin Date:2/16/2004From:PG03.
Video Google: Text Retrieval Approach to Object Matching in Videos Authors: Josef Sivic and Andrew Zisserman University of Oxford ICCV 2003.
Chapter 3 2D AND 3D SPATIAL DATA REPRESENTATIONS 김 정 준.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
T-Snake(2) Reference: Tim McInerney, Demetri Terzopoulos, T-snakes: Topology adaptive snakes, Medical Image Analysis, No ,pp73-91.
GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.
00/4/103DVIP-011 Part Three: Descriptions of 3-D Objects and Scenes.
Spatial data models (types)
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
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.
CS654: Digital Image Analysis Lecture 3: Data Structure for Image Analysis.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 11 Representation & Description Chapter 11 Representation.
8. Geographic Data Modeling. Outline Definitions Data models / modeling GIS data models – Topology.
Digital Image Processing CSC331
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Digital Image Processing CCS331 Relationships of Pixel 1.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 14/15 – TP8 Segmentation Miguel Tavares Coimbra.
Extended Grassfire Transform on Medial Axes of 2D Shapes
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Representation & Description.
Ground Truth Free Evaluation of Segment Based Maps Rolf Lakaemper Temple University, Philadelphia,PA,USA.
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.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
CSE554SkeletonsSlide 1 CSE 554 Lecture 2: Shape Analysis (Part I) Fall 2015.
Thinning & Distance Field Advisor : Ku-Yaw Chang Speaker : Jhen-Yu Yang.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
Outline Introduction Research Project Findings / Results
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
1 Overview (Part 1) Background notions A reference framework for multiresolution meshes Classification of multiresolution meshes An introduction to LOD.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Chapter 6 Skeleton & Morphological Operation. Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post.
Sheng-Fang Huang Chapter 11 part I.  After the image is segmented into regions, how to represent and describe these regions? ◦ In terms of its external.
Lecture 9 : Point Set Processing
Course : T Computer Vision
CSE 554 Lecture 2: Shape Analysis (Part I)
Image Representation and Description – Representation Schemes
Visual exploratory data analysis:
Miguel Tavares Coimbra
Range Image Segmentation for Modeling and Object Detection in Urban Scenes Cecilia Chen & Ioannis Stamos Computer Science Department Graduate Center, Hunter.
Introduction to Graphics Modeling
Visual exploratory data analysis:
Discrete Surfaces and Manifolds: A Potential tool to Image Processing
CSE 554 Lecture 3: Shape Analysis (Part II)
Handwritten Characters Recognition Based on an HMM Model
Descriptions of 3-D Objects and Scenes
Presentation transcript:

3D Thinning on Cell Complexes for Computing Curve and Surface Skeletons Lu Liu Advisor: Tao Ju Master Thesis Defense Dec 18 th, 2008

Outline Motivation Goal and Rationale Cell Complex Our thinning algorithm Conclusion & Future work

Thin geometric structure lying in the center Skeleton as a Shape Descriptor Curve (1D) 1D Skeleton2D Object Elongated Part Tube Plate Curve (1D) Surface (2D) 1D/2D Skeleton 3D Object Dimension Reduction

Skeleton as a Shape Descriptor Thin geometric structure lying in the center Applications – Handwritten character recognition – Shape matching and retrieval – Shape segmentation – Shape deformation – Medical image visualization homepages.inf.ed.ac.uk/rbf/HIPR2/thin.htm

Skeleton as a Shape Descriptor Thin geometric structure lying in the center Applications – Handwritten character recognition – Shape matching and retrieval – Shape segmentation – Shape deformation – Medical image visualization based_image_retrieval.html

Thin geometric structure lying in the center Applications – Handwritten character recognition – Shape matching and retrieval – Shape segmentation – Shape deformation – Medical image visualization Skeleton as a Shape Descriptor ublication

Skeleton as a Shape Descriptor Thin geometric structure lying in the center Applications – Handwritten character recognition – Shape matching and retrieval – Shape segmentation – Shape deformation – Medical image visualization Item.do?contentType=Article&hdAction=lnkhtml&c ontentId=

Skeleton as a Shape Descriptor Thin geometric structure lying in the center Applications – Handwritten character recognition – Shape matching and retrieval – Shape segmentation – Shape deformation – Medical image visualization Bone MatrixProtein VesselsNerve cells

Goal Thinness – Definition of skeleton (1-dimension reduction) – Easy to detect curve and surface components Topology preservation – Genus, connectivity – Handwritten character recognition, shape matching Shape preservation – Curve skeleton for tube-like shape components – Surface skeleton for plate-like shape components – Shape segmentation, shape deformation

Computing Skeletons On continuous models – As simplified Medial Axes [Sud et. al., 2005] On digital models – As a subset of lattice points 1. In many applications, such as medical imaging, data come as a collection of digital points 2. Computing skeleton on digital model is simple to implement and stable to perform

Computing Skeletons Digital model is represented as a set of points on a spatial grid Geometry and topology – Adjacency relation 2D 4-connectivity 2D 8-connectivity 3D 6-connectivity 3D 26-connectivity

Computing Skeletons Thinning on point based representation – Peeling off boundary points – Topology preservation: simple points – Shape preservation: curve/surface enpoints – Local operations: simple

Computing Skeletons Obstacles – Topology preservation under parallel thinning – Thinness 4 points joints – Shape preservation Endpoints detection is sensitive to noise A fundamental different representation

Cell Complexes In N-D, a set of k-cells (k<=N) – A closed set: the facets of each k-cell (e.g., edges of a square) also belong to the same set Point (0-cell)Edge (1-cell)Square (2-cell)Cube (3-cell)

Cell Complexes Construction: – All those k-cells whose boundary points are in the “points on a spatial grid” representation – Result in a closed set – Any grid, any dimension

Cell Complexes – Simplicial Collapse Removal of k-simple pair – Dimension, – is only on the boundary of Topology preserving Local operation δσδσ A k-cell σ and a (k-1)-cell δ, so that δ is not contained in another k-cell than σ.

Proposition 1 (Topology-preservation): Simultaneous removal of multiple simple pairs preserves the homotopy of a cell complex. Proposition 2 (Thinness): Removal of all simple N-simple pairs deletes all N-cells in a for a N dimensional cell complex. Cell Complexes – Simplicial Collapse

Our Thinning Algorithm Simplicial collapse – Topology preservation – Thinness Significance measures – Shape preservation Our thinning algorithm

Significance Measures Shape elongation(dimension awareness): – k-D skeleton is elongated in k directions: curve-skeleton: 1; surface skeleton: 2 D, d measures, significance measures S1, S2 – cells with large significance measures are preserved (1)S1 = d – D (2) S2 = 1 – D/d 1-D skeleton 2-D shape

Significance measures computation – Approximation of D,d Significance Measures – Approximation

Significance measures – approximation D of a cell is the index of the iteration in which the cell becomes isolated d of a cell is the index of iteration in which the cell becomes simple

Significance Measures – Approximation D measure d measure S1 measure S2 measure

T1 = 5; T2 = 0.5 S1 measure S2 measure Significance Measure – Approximation

Our Thinning Algorithm Parallel thinning Approximate D Approximate d Significance measures

Our Thinning Algorithm Algorithm is simple to implement Skeleton is thin, topology preserving, and shape preserving

Results - T Shape Model t1 = 5, t2 = 0.5

Results – Rocker Arm Model t1 = 5, t2 = 0.5

Results – Hip Bone Model t1 = 5, t2 = 0.5

Results – Hip Bone Model t1 = 9, t2 = 0.5

Results – Fertility Model t1 = 5, t2 = 0.5

Results – Dragon Model t1 = 5, t2 = 0.5

Results – Protein tim Model t1 = 5, t2 = 0.5

Performance Model Before ThinningAfter ThinningTime(s) pointedgequadcubepointedgequad Tshape Rocker arm Hip Hip(t2=9) Dragon Fertility Protein Tim X 3 X * 128 * 128 uniform grid

Performance

Future Work Queue structure for outmost layer in thinning – To overcome time consuming Adaptive thinning algorithm on octree grid – To overcome memory consuming Other topology preserving operators – ? Growing operator: skinning – Growing operator + simplicial collapse: topology preserving and volume preserving deformation

Conclusion Present and prove two properties of simplicial collapse on cell complexes – Thinness – Topology preservation under parallel thinning Propose two significant measures – Shape preservation Develop a simple thinning algorithm

Acknowledgement Great thanks goes to – My advisor: Professor Tao Ju – My committee members: Professor Cindy Grimm Professor Robert Pless

Q & A