CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Shape Analysis (Part II) Fall 2014.

Slides:



Advertisements
Similar presentations
Reconstruction from Voxels (GATE-540)
Advertisements

CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Skeleton and Thinning (Part II) Fall 2013.
1 RTL Example: Video Compression – Sum of Absolute Differences Video is a series of frames (e.g., 30 per second) Most frames similar to previous frame.
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Characteristics of 3-D Shapes
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
A Simple and Robust Thinning Algorithm on Cell Complexes
Dual Marching Cubes: An Overview
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
CSE351/ IT351 Modeling And Simulation Choosing a Mesh Model Dr. Jim Holten.
1 Lecture 4 Graphical primitives Rasterization: algorithmic approach Rasterization: geometric approach 2D discrete lines, triangles Discrete planes 3D.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
E.G.M. PetrakisBinary Image Processing1 Binary Image Analysis Segmentation produces homogenous regions –each region has uniform gray-level –each region.
3D Thinning on Cell Complexes for Computing Curve and Surface Skeletons Lu Liu Advisor: Tao Ju Master Thesis Defense Dec 18 th, 2008.
Focus on Can you spell each word correctly ?
Basic geometric FIGURES
CSE554Binary PicturesSlide 1 CSE 554 Lecture 1: Binary Pictures Fall 2013.
CSE554Binary PicturesSlide 1 CSE 554 Lecture 1: Binary Pictures Fall 2014.
Spatial data models (types)
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
Geometry The strand of math that deals with measurement and comparing figures, both plane and solid .
Attributes A quality that is characteristic of someone or something.
Two- and Three- Dimensional Figures
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Quadric Error Metrics 1/20 Quadric Error Metrics.
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Digital Image Processing Lecture 20: Representation & Description
3-d shapes. This is a cube. Eight corners Six faces cube.
Introduction Image geometry studies rotation, translation, scaling, distortion, etc. Image topology studies, e.g., (i) the number of occurrences.
3-DIMENSIONAL FIGURES WHAT ARE THEY? 3-Dimentional figures are shapes that have height, length, and depth.
CSE554SkeletonsSlide 1 CSE 554 Lecture 2: Shape Analysis (Part I) Fall 2015.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
What are these shapes? squarecircletrianglerectangle How many sides do each have? How many points do each have?
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
Attributes A quality that is characteristic of someone or something.
Polygons and Solids. Helix - Volume or solid of spiral shape that turns at a constant angle. cylinder -Volume or solid generated by the rotation.
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
Machine Vision ENT 273 Regions and Segmentation in Images Hema C.R. Lecture 4.
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
November 5, 2013Computer Vision Lecture 15: Region Detection 1 Basic Steps for Filtering in the Frequency Domain.
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Course 3 Binary Image Binary Images have only two gray levels: “1” and “0”, i.e., black / white. —— save memory —— fast processing —— many features of.
Chapter 6 Skeleton & Morphological Operation. Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post.
Francis González Shapes: 2 Dimensions Figures Rectangle, Square, Triangle, Circle, Arch 3 Dimensions Figures Cube, Pyramid, Sphere, Cylinder.
Detecting Image Features: Corner. Corners Given an image, denote the image gradient. C is symmetric with two positive eigenvalues. The eigenvalues give.
Fractals.
Chapter 10 Geometry Part 1. 1.Polygons on a Coordinate Grid 2.Nets of Polyhedrons 3.Surface Area of Polyhedrons 4.Surface Area Continued 5.Spring Break.
Vocabulary for the Common Core Sixth Grade.  base: The side of a polygon that is perpendicular to the altitude or height. Base of this triangle Height.
Sphere – any round object whose curved surface is the same distance to the center as all of its points.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
Machine Vision ENT 273 Lecture 4 Hema C.R.
CSE 554 Lecture 2: Shape Analysis (Part I)
Image Representation and Description – Representation Schemes
Cubes in a Skeleton Cuboid
CSE 554 Lecture 1: Binary Pictures
Digital Image Processing Lecture 20: Representation & Description
Unit 11: 3-Dimensional Geometry
Mean Shift Segmentation
Computer Vision Lecture 12: Image Segmentation II
Fitting Curve Models to Edges
Computer Vision Lecture 9: Edge Detection II
Unit 11: 3-Dimensional Geometry
Binary Image processing بهمن 92
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
Morphological Image Processing
CSE 554 Lecture 3: Shape Analysis (Part II)
Collision Detection.
Presentation transcript:

CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Shape Analysis (Part II) Fall 2014

CSE554Cell ComplexesSlide 2 Review Skeletons – Centered curves/surfaces Approximations of medial axes – Useful for shape analysis 2D skeletons 3D surface and curve skeletons

CSE554Cell ComplexesSlide 3 Review Thinning on binary pictures – Removable pixels (voxels) Whose removal does not alter the object’s shape or topology – Strategies Serial thinning or parallel thinning Removal pixels Thinning

CSE554Cell ComplexesSlide 4 Review Issues (with thinning on a binary picture) – Difficult to write a 3D thinning algorithm E.g., simple voxel criteria, surface-end voxel criteria – Skeletons can be noisy Requires pruning x

CSE554Cell ComplexesSlide 5 This lecture… Thinning on a cell complex – One algorithm that works for shapes in any dimensions (2D, 3D, etc.) – Integrates pruning with thinning

CSE554Cell ComplexesSlide 6 Cells Geometric elements with simple topology – k-cell: an element at dimension k 0-cell: point 1-cell: line segment, curve segment, … 2-cell: triangle, quad, … 3-cell: cube, tetrahedra, … – Formally: A k-cell has the topology of a closed k-dimensional ball 0-D ball: point 1-D ball: edge 2-D ball: disk 3-D ball: sphere 0-cell1-cell 2-cell3-cell Not a 2-cell Not a 3-cell

CSE554Cell ComplexesSlide 7 Cells The boundary of a k-cell (k>0) has dimension k-1 – Examples: A 1-cell is bounded by two 0-D points A 2-cell is bounded by a 1-D curve A 3-cell is bounded by a 2-D surface 0-cell1-cell 2-cell3-cell (boundary is colored blue)

CSE554Cell ComplexesSlide 8 Cell Complex Union of cells and their boundaries – The formal name is CW (closure-finite, weak-topology) Complex Precise definition can be found in algebraic topology books

CSE554Cell ComplexesSlide 9 Cell Complex Are these cell complexes? (this edge is not bounded) (the triangle is not bounded)

CSE554Cell ComplexesSlide 10 Example Cell Complexes 2D – Polyline – Triangulated polygon 3D – Triangulated surface – Tetrahedral volume 0-,1-cells0-,1-, 2-cells 0-,1-, 2-, 3-cells

CSE554Cell ComplexesSlide 11 Cell Complex from Binary Pic Representing the object as a cell complex – Approach 1: create a 2-cell (3-cell) for each object pixel (voxel), and add all boundary cells Reproducing 8-connectivity in 2D and 26-connectivity in 3D

CSE554Cell ComplexesSlide 12 Representing the object as a cell complex – Approach 2: create a 0-cell for each object pixel (voxel), and connect them to form higher dimensional cells. Reproducing 4-connectivity in 2D and 6-connectivity in 3D Cell Complex from Binary Pic

CSE554Cell ComplexesSlide 13 Algorithm: Approach 1 2D: – For each object pixel, create a 2-cell (square), four 1-cells (edges), and four 0- cells (points). 3D : – For each object voxel, create a 3-cell (cube), six 2-cells (squares), twelve 1-cells (edges), and eight 0-cells (points).

CSE554Cell ComplexesSlide 14 Algorithm: Approach 1 Handling cells shared by adjacent pixels (voxels) – Create an array of integers that keeps track of whether a cell is created (e.g., at a pixel, at a pixel’s edge, or at a pixel’s point), and if it is created, the index of the cell. – Look up this array before creating a new cell Index of 2-cell Index of 1-cell Index of 0-cell

CSE554Cell ComplexesSlide 15 Algorithm: Approach Index of 2-cell Index of 1-cell Index of 0-cell

CSE554Cell ComplexesSlide 16 Algorithm: Approach 2 2D: – Create a 0-cell at each object pixel, a 1-cell for two object pixels sharing a common edge, and a 2-cell for four object pixels sharing a common point 3D: – Create a 0-cell at each object voxel, a 1-cell for two object voxels sharing a common face, a 2-cell for four object voxels sharing a common edge, and a 3- cell for eight object voxels sharing a common point Follow the note in Approach 1 for storing cell indices

CSE554Cell ComplexesSlide 17 Thinning on Binary Pictures Remove simple pixels (voxels) – Whose removal does not affect topology Protect end pixels (voxels) of skeleton curves and surfaces – To prevent shrinking of skeleton

CSE554Cell ComplexesSlide 18 Thinning on Cell Complexes Remove simple pairs – Whose removal does not affect topology Protect medial cells – Which are important for describing shape Advantages: – Easy to detect in 2D and 3D (same code) – Medial cells are robust to boundary noise

CSE554Cell ComplexesSlide 19 Simple Pairs How can we remove cells from a complex without changing its topology?

CSE554Cell ComplexesSlide 20 Simple Pairs Definition – A pair {x, y} such that y is on the boundary of x, and there is no other cell in the complex with y on its boundary. x y {x, y} is a simple pair y {x,y} is not a simple pair x

CSE554Cell ComplexesSlide 21 Simple Pairs Definition – A pair {x, y} such that y is on the boundary of x, and there is no other cell in the complex with y on its boundary. x y {x, y} is a simple pair x y

CSE554Cell ComplexesSlide 22 Simple Pairs Definition – A pair {x, y} such that y is on the boundary of x, and there is no other cell in the complex with y on its boundary. – In a simple pair, x is called a simple cell, and y is called the witness of x. A simple cell can pair up with different witnesses x y {x, y} is a simple pair y y x y

CSE554Cell ComplexesSlide 23 Simple Pairs Removing a simple pair does not change topology – True even when multiple simple pairs are removed together As long as the pairs are disjoint x y x y x y x y x1x1 y1y1 x2x2 y2y2

CSE554Cell ComplexesSlide 24 Exhaustive Thinning Removing all simple pairs in parallel at each iteration – Only the topology of the cell complex is preserved – If a simple cell has multiple witnesses, an arbitrary choice is made // Exhaustive thinning on a cell complex C 1.Repeat: 1.Let S be all simple pairs in C 2.If S is empty, Break. 3.Remove all cells in S from C 2.Output C

CSE554Cell ComplexesSlide 25 Exhaustive Thinning Removing all simple pairs in parallel at each iteration – Only the topology of the cell complex is preserved 2D example

CSE554Cell ComplexesSlide 26 Exhaustive Thinning Removing all simple pairs in parallel at each iteration – Only the topology of the cell complex is preserved 3D example

CSE554Cell ComplexesSlide 27 Exhaustive Thinning Removing all simple pairs in parallel at each iteration – Only the topology of the cell complex is preserved A more interesting 2D shape

CSE554Cell ComplexesSlide 28 Exhaustive Thinning Removing all simple pairs in parallel at each iteration – Only the topology of the cell complex is preserved A 3D shape

CSE554Cell ComplexesSlide 29 Isolated cells A cell x is isolated if it is not on the boundary of other cells – A k-dimensional skeleton is made up of isolated k-cells Isolated cells are colored

CSE554Cell ComplexesSlide 30 Medial Cells (2D) “Meaningful” skeleton edges survive longer during thinning

CSE554Cell ComplexesSlide 31 Medial Cells (2D) Isolation iteration (I(x)): # thinning iterations before cell is isolated Removal iteration (R(x)): # thinning iterations before cell is removed Medial cells: isolated cells whose difference between R and I is greater than a threshold – Absolute difference: R(x) – I(x) – Relative difference: (R(x) – I(x)) / R(x) I R

CSE554Cell ComplexesSlide 32 Medial Cells (2D) Isolation iteration (I(x)): # thinning iterations before cell is isolated Removal iteration (R(x)): # thinning iterations before cell is removed Medial cells: isolated cells whose difference between R and I is greater than a threshold – Absolute difference: R(x) – I(x) – Relative difference: (R(x) – I(x)) / R(x) R-I 1-I/R

CSE554Cell ComplexesSlide 33 Medial Cells (2D) For a 1-cell x that is isolated during thinning: – I(x), R(x) measures the “thickness” and “length” of shape – A greater difference means the local shape is more “elongated” I R R-I 1-I/R

CSE554Cell ComplexesSlide 34 Medial Cells (3D) For a 2-cell x that is isolated during thinning: – I(x), R(x) measures the “thickness” and “width” of shape – A greater difference means the local shape is more “plate-like” I R R-I: face size 1-I/R: face color

CSE554Cell ComplexesSlide 35 Medial Cells (3D) For a 1-cell x that is isolated during thinning: – I(x), R(x) measures the “width” and “length” of shape – A greater difference means the local shape is more “tubular” R-I: edge length 1-I/R: edge color I R

CSE554Cell ComplexesSlide 36 Medial Cells and Thinning A cell x is a medial cell if it is isolated and the difference between R(x) and I(x) exceeds given thresholds – A pair of absolute/relative difference thresholds is needed for medial cells at each dimension 2D: thresholds for medial 1-cells – t1 abs, t1 rel 3D: thresholds for both medial 1-cells and 2-cells – t1 abs, t1 rel – t2 abs, t2 rel Thinning: removing simple pairs that are not medial cells – Note: only need to check the simple cell in a pair (the witness is never isolated)

CSE554Cell ComplexesSlide 37 Thinning Algorithm (2D) // Thinning on a 2D cell complex C // Thresholds t1 abs and t1 rel for medial 1-cells 1.k = 1 2.For all x in C, set I(x) be 0 if x is isolated, NULL otherwise 3.Repeat and increment k: 1.Let S be all simple pairs in C 2.Repeat for each pair {x,y} in S: 1.If x is 1-cell and ( k-I(x)>t1 abs and 1-I(x)/k>t1 rel ), exclude {x,y} from S. 3.If S is empty, Break. 4.Remove all cells in S from C 5.Set I(x) be k for newly isolated cells x in C 4.Output C Current iteration

CSE554Cell ComplexesSlide 38 Thinning Algorithm (3D) // Thinning on a 3D cell complex C // Thresholds t1 abs and t1 rel for medial 1-cells // Thresholds t2 abs and t2 rel for medial 2-cells 1.k = 1 2.For all x in C, set I(x) be 0 if x is isolated, NULL otherwise 3.Repeat and increment k: 1.Let S be all simple pairs in C 2.Repeat for each pair {x,y} in S: 1.If x is 1-cell and ( k-I(x)>t1 abs and 1-I(x)/k>t1 rel ), exclude {x,y} from S. 2.If x is 2-cell and ( k-I(x)>t2 abs and 1-I(x)/k>t2 rel ), exclude {x,y} from S. 3.If S is empty, Break. 4.Remove all cells in S from C 5.Set I(x) be k for newly isolated cells x in C 4.Output C Current iteration

CSE554Cell ComplexesSlide 39 Choosing Thresholds Higher thresholds result in smaller skeleton – Threshold the absolute difference at ∞ will generally purge all cells at that dimension Except those for keeping the topology – Absolute threshold has more impact on features at small scales (e.g., noise) – Relative threshold has more impact on rounded features (e.g., blunt corners) t1 abs = ∞ Skeletons computed at threshold

CSE554Cell ComplexesSlide 40 t1 rel = 0.5t1 rel = 0.6t1 rel = 0.7t1 rel = 0.8 T1 abs = 1 T1 abs = 3 T1 abs = 5 T1 abs = 7

CSE554Cell ComplexesSlide 41 More Examples 2D t1 abs = ∞ t1 rel = 1 t1 abs = 4 t1 rel =.4

CSE554Cell ComplexesSlide 42 More Examples 3D t1 abs =∞ t1 rel =1 t2 abs =∞ t2 rel =1 t1 abs =4 t1 rel =.4 t2 abs =∞ t2 rel =1 t1 abs =∞ t1 rel =1 t2 abs =4 t2 rel =.4 t1 abs =4 t1 rel =.4 t2 abs =4 t2 rel =.4

CSE554Cell ComplexesSlide 43 More Examples 3D t1 abs =∞ t1 rel =1 t2 abs =∞ t2 rel =1 t1 abs =∞ t1 rel =1 t2 abs =5 t2 rel =.4 t1 abs =5 t1 rel =.4 t2 abs =∞ t2 rel =1 t1 abs =5 t1 rel =.4 t2 abs =5 t2 rel =.4