Segmentation Reporter: Xiaoqun Wu Date: 2008/10/30.

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

1 Motion and Manipulation Configuration Space. Outline Motion Planning Configuration Space and Free Space Free Space Structure and Complexity.
Active Contours, Level Sets, and Image Segmentation
Crowds In A Polygon Soup Next-Gen Path Planning David Miles 3/23/2006 Copyright 2006 BabelFlux LLC.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Sampling From the Medial Axis Presented by Rahul Biswas April 23, 2003 CS326A: Motion Planning.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
 Mirrors that are not flat are called curved mirrors.  Depending on whether the reflective coating is on the inside or outside of the curve will decide.
Morphological Image Processing Md. Rokanujjaman Assistant Professor Dept of Computer Science and Engineering Rajshahi University.
Shape Classification Based on Skeleton Path Similarity Xingwei Yang, Xiang Bai, Deguang Yu, and Longin Jan Latecki.
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
1 Numerical geometry of non-rigid shapes Consistent approximation of geodesics in graphs Consistent approximation of geodesics in graphs Tutorial 3 © Alexander.
Identifying Patterns in Road Networks Topographic Data and Maps Henri Lahtinen Arto Majoinen.
1 Introduction to 3D Imaging: Perceiving 3D from 2D Images How can we derive 3D information from one or more 2D images? There have been 2 approaches: 1.
Shortest Geodesics on Polyhedral Surfaces Project Summary Efrat Barak.
SPIE Vision Geometry - July '99 Even faster point set pattern matching in 3-d Niagara University and SUNY - Buffalo Laurence Boxer Research.
Color a* b* Brightness L* Texture Original Image Features Feature combination E D 22 Boundary Processing Textons A B C A B C 22 Region Processing.
Jianke Zhu From Haibin Ling’s ICCV talk Fast Marching Method and Deformation Invariant Features.
CSE554Binary PicturesSlide 1 CSE 554 Lecture 1: Binary Pictures Fall 2013.
CSE554Binary PicturesSlide 1 CSE 554 Lecture 1: Binary Pictures Fall 2014.
Mesh Segmentation Zhenyu Shu References Gelfand N, Guibas L J. Shape segmentation using local slippage analysis [C]. Proceedings of the 2004.
Mesh Scissoring with Minima Rule and Part Salience Yunjin Lee,Seungyong Lee, Ariel Shamir,Daniel cohen-Or, Hans-Peter Seidel Computer Aided Geometric Design,
CAD/Graphics 2013, Hong Kong Footpoint distance as a measure of distance computation between curves and surfaces Bharath Ram Sundar*, Abhijit Chunduru*,
© Manfred Huber Autonomous Robots Robot Path Planning.
Surface modeling through geodesic Reporter: Hongyan Zhao Date: Apr. 18th
Automated generation of control skeletons for use in animation Author : Lawson Wade, Richard E. Parent Source : The Visual Computer (2002) 18: Speaker.
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
Light wave Recall: Light must reflect off of an object before it can be used to see the object. A flat mirror is called a plane mirror. A plane mirror.
8. Geographic Data Modeling. Outline Definitions Data models / modeling GIS data models – Topology.
Under Supervision of Dr. Kamel A. Arram Eng. Lamiaa Said Wed
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Digital Image Processing Chapter 9: Morphological Image Processing 5 September 2007 Digital Image Processing Chapter 9: Morphological Image Processing.
1 Shortest Paths in Three Dimensions Speaker: Atlas F. Cook IV Advisor: Carola Wenk.
Nonoverlap of the Star Unfolding Boris Aronov and Joseph O’Rourke, 1991 A Summary by Brendan Lucier, 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:
CSE554SkeletonsSlide 1 CSE 554 Lecture 2: Shape Analysis (Part I) Fall 2015.
Geodesic Fréchet Distance Inside a Simple Polygon Atlas F. Cook IV & Carola Wenk Proceedings of the 25th International Symposium on Theoretical Aspects.
CENG 789 – Digital Geometry Processing 04- Distances, Descriptors and Sampling on Meshes Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
CS654: Digital Image Analysis
References Books: Chapter 11, Image Processing, Analysis, and Machine Vision, Sonka et al Chapter 9, Digital Image Processing, Gonzalez & Woods.
With Tamal Dey, Qichao Que, Issam Safa, Lei Wang, Yusu Wang Computer science and Engineering The Ohio State University Xiaoyin Ge.
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.
A Part-aware Surface Metric for Shape Analysis Rong Liu 1, Hao Zhang 1, Ariel Shamir 2, and Daniel Cohen-Or 3 1 Simon Fraser University, Canada 2 The Interdisciplinary.
ECE472/572 - Lecture 14 Morphological Image Processing 11/17/11.
11/01/2010 Segmentation of SES for Protein Structure Analysis Virginio Cantoni, Riccardo Gatti, Luca Lombardi University of Pavia, dept. of Computer Engineering.
Mesh Segmentation via Spectral Embedding and Contour Analysis Speaker: Min Meng
An Approach to Automated Decomposition of Volumetric Mesh Chuhua Xian, Shuming Gao and Tianming Zhang Zhejiang University.
Morphological Image Processing
Deformation Modeling for Robust 3D Face Matching Xioguang Lu and Anil K. Jain Dept. of Computer Science & Engineering Michigan State University.
Autonomous construction of maps by miniature robots Paul Fitzpatrick Colin Flanagan.
IMAGE PROCESSING Tadas Rimavičius.
CSE 554 Lecture 2: Shape Analysis (Part I)
CSE 554 Lecture 1: Binary Pictures
Vikash Ravi Goel, MS, Roy K. Greenberg, MD, Donald P. Greenberg, PhD 
Utilization of 3D Scene Data for Improving Segmentation and Tracking
You can check broken videos in this slide here :
Fast and Robust Object Tracking with Adaptive Detection
Predicting ligand binding sites on protein surface
Department of Computer Science University of York
Image processing and computer vision
Vikash Ravi Goel, MS, Roy K. Greenberg, MD, Donald P. Greenberg, PhD 
Neutrosophic approach for mathematical morphology.
Saliency Optimization from Robust Background Detection
A brief introduction to map projections By Mark VanderVen
Presentation transcript:

Segmentation Reporter: Xiaoqun Wu Date: 2008/10/30

Papers Patch-type Segmentation of Voxel Shapes using Simplified Surface Skeletons Part-type Segmentation of Articulated Voxel Shapes using the Junctions Rules

Authors Dennie Reniers Ph.D Student of Dept. of Mathematics and Computing Science at Tu/e His research interests include shape analysis, representation and segmentation, and discrete geometry Alexandru Telea Assistant Prof. of Dept. of Mathematics and Computing Science at Tu/e

The Problem

Two Types Patch-type Segmentation: Geometry-Oriented Part-type Segmentation Semantically-Oriented

Two Types Patch-type Part-type

Conceptions Surface skeleton Curve skeleton

Patch-type Segmentation of Voxel Shapes using Simplified Surface Skeletons

Patch-type Segmentation Main idea: The boundaries of the surface skeleton map one- to-one to the edges of the 3D shape

Edge Detection Compute Surface Skeleton Simplify Skeleton Edge Erosion Handling Corners

Surface Skeleton Distance Transform Feature Transform Surface Skeleton

Foreground Skeleton Background Skeleton

Surface Skeleton Background Skeleton

Simplify Skeleton Importance Measure The length of shortest path on the surface boundary between two feature points F(p) Simplified Skeleton

Simplify Skeleton

Edge Detection Feature collection Convex Edges Concave Edges Edges

Edge erosion

Handling Corners

Complexity

Results

Comparison

Part-type Segmentation of Articulated Voxel-Shapes using the Junction Rule

Main idea

Main steps Compute Curve Skeleton Simplify Skeleton Detect Junction Place Part Cuts

Surface Skeleton Distance Transform Feature Transform Surface Skeleton

Curve Skeleton The set of shortest paths Curve Skeleton

Simplify Curve Skeleton

Detect Junction

Place part cut

Geodesicness measure The larger, the better

Place cut part

Results

Comparison

Conclusion Two Methods Patch-type Segmentation Surface Skeleton Part-type Segmentation Curve Skeleton

Thank you!