Semi-Automatic Topology Independent Contour-Based 2 1/2 D Segmentation Using Live-Wire Semi-Automatic Topology Independent Contour-Based 2 1/2 D Segmentation.

Slides:

Advertisements

Similar presentations

Network biology Wang Jie Shanghai Institutes of Biological Sciences.

Advertisements

Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.

The University of Ontario CS 4487/9587 Algorithms for Image Analysis Segmentation (2D) Acknowledgements: Alexei Efros, Steven Seitz.

NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.

Unconstrained Isosurface Extraction on Arbitrary Octrees

Kapitel 13 “Interactive Segmentation” – p. 1 Interactive Segmentation  Live-wire approach  Random walker segmentation TexPoint fonts used in EMF. Read.

Segmentation (2): edge detection

D contour based local manual correction of liver segmentations1Institute for Medical Image Computing 3D contour based local manual correction.

Contour Stitching Introduction to Algorithms Contour Stitching CSE 680 Prof. Roger Crawfis.

High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.

Lecture 6 Image Segmentation

By Dor Lahav. Overview Straight Skeletons Convex Polygons Constrained Voronoi diagrams and Delauney triangulations.

3D Reconstruction of Anatomical Structures from Serial EM images.

Image Quilting for Texture Synthesis and Transfer Alexei A. Efros1,2 William T. Freeman2.

Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.

Image Segmentation Today’s Readings Intelligent Scissors, Mortensen et. al, SIGGRAPH 1995Intelligent Scissors From Sandlot ScienceSandlot Science.

Scanning Geometry Artem Amirkhanov.

An Out-of-core Algorithm for Isosurface Topology Simplification Zoë Wood Hughes Hoppe Mathieu Desbrun Peter Schröder.

CPR Curved Planar Reformation A. Kanitsar 1, D. Fleischmann 2, R. Wegenkittl 3, P. Felkel 3, M. E. Gröller 1 1 Institute of Computer Graphics and Algorithms.

VOTS VOlume doTS as Point-based Representation of Volumetric Data S. Grimm, S. Bruckner, A. Kanitsar and E. Gröller Institute of Computer Graphics and.

CSE (c) S. Tanimoto, 2007 Segmentation and Labeling 1 Segmentation and Labeling Outline: Edge detection Chain coding of curves Segmentation into.

Consistent Parameterizations Arul Asirvatham Committee Members Emil Praun Hugues Hoppe Peter Shirley.

Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.

CS2420: Lecture 36 Vladimir Kulyukin Computer Science Department Utah State University.

Junjun Pan 1, Xiaosong Yang 1, Xin Xie 1, Philip Willis 2, Jian J Zhang 1

Diploma Thesis Image-Based Verification of Parametric Models in Heart-Ventricle Volumetry Martin Urschler Institut für Maschinelles Sehen u. Darstellen.

Tracing and compressing digital curves András Hajdu Department of Computer Graphics and Image Processing Faculty of Informatics, University of Debrecen,

Vertex – A point at which two or more edges meet Edge – A line segment at which two faces intersect Face – A flat surface Vertices, Edges, Faces.

Graph Abstraction for Simplified Proofreading of Slice-based Volume Segmentation Ronell Sicat 1, Markus Hadwiger 1, Niloy Mitra 1,2 1 King Abdullah University.

The University of Ontario CS 433/653 Algorithms for Image Analysis Segmentation (2D) Acknowledgements: Alexei Efros, Steven Seitz.

Estimating the tumor-breast volume ratio from mammograms Jorge Rodríguez*, Pedro Linares*, Eduardo Urra*, Daniella Laya*, Felipe Saldivia , Aldo Reigosa.

EE 492 ENGINEERING PROJECT LIP TRACKING Yusuf Ziya Işık & Ashat Turlibayev Yusuf Ziya Işık & Ashat Turlibayev Advisor: Prof. Dr. Bülent Sankur Advisor:

Section 8.4 Nack/Jones1 Section 8.4 Polyhedrons & Spheres.

Lecture 4: Image Resampling and Reconstruction CS4670: Computer Vision Kavita Bala.

Segmentation & Modeling ImagesSegmented Images Models.

1 Interactive Thickness Visualization of Articular Cartilage Author :Matej Mlejnek, Anna Vilanova,Meister Eduard GröllerMatej MlejnekAnna VilanovaMeister.

Three-Dimensional Solids Polyhedron – A solid with all flat surfaces that enclose a single region of space. Face – Each flat surface of the polyhedron.

Graphs, Puzzles, & Map Coloring

Evaluation of a Bricked Volume Layout for a Medical Workstation based on Java Peter Kohlmann, Stefan Bruckner, Armin Kanitsar, M. Eduard Gröller Institute.

Blood Vessel Modeling using 2D/3D Level Set Method

1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.

Geometry Vocabulary Point an exact location in space Line A straight path that goes on forever in both directions A and B are any 2 points on the line.

Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.

12.1 Exploring Solids.

Introduction to Conic Sections. A conic section is a curve formed by the intersection of _________________________ a plane and a double cone.

Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.

MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles

Chapter 6: Graphs 6.1 Euler Circuits

Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.

High Resolution Surface Reconstruction from Overlapping Multiple-Views

2006/10/25 1 A Virtual Endoscopy System Author ： Author ： Anna Vilanova 、 Andreas K ö nig 、 Eduard Gr ö ller Source :Machine Graphics and Vision, 8(3),

polyhedron a three- dimensional figure whose surfaces are polygons faces edge vertex.

11-1 Space Figures and Cross Sections Objectives To recognize polyhedra and their parts To visualize cross sections of space figures.

Mesh Segmentation via Spectral Embedding and Contour Analysis Speaker: Min Meng

Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.

Reducing Artifacts in Surface Meshes Extracted from Binary Volumes R. Bade, O. Konrad and B. Preim efficient smoothing of iso-surface meshes Plzen - WSCG.

Introduction to 3D Solids and Solids of Revolution Some 3D shapes can be formed by revolving a 2D shape around a line (called the axis of revolution).

Diagnostic Information for Control-Flow Analysis of Workflow Graphs (aka Free-Choice Workflow Nets) Cédric Favre(1,2), Hagen Völzer(1), Peter Müller(2)

Ice cream factories test how consistently the ingredients are distributed through each carton by cutting cartons in half for a good view. Describe the.

Course : T Computer Vision

Announcements CS accounts Project 1 is out today

CSc4730/6730 Scientific Visualization

Radio Propagation Simulation Based on Automatic 3D Environment Reconstruction D. He A novel method to simulate radio propagation is presented. The method.

T. C. van Dijk1, J.-H. Haunert2, J. Oehrlein2 1University of Würzburg

A graphing calculator is required for some problems or parts of problems 2000.

CSCI2100 Data Structures Tutorial

Announcements Project 1 is out today

Boolean Operations for Free-form Models Represented in Geometry Images

Announcements Project 1 is out today help session at the end of class.

Warm Up – 3/14 - Friday 100 seats are to be apportioned.

Presentation transcript:

Semi-Automatic Topology Independent Contour-Based 2 1/2 D Segmentation Using Live-Wire Semi-Automatic Topology Independent Contour-Based 2 1/2 D Segmentation Using Live-Wire Michael Knapp, Armin Kanitsar and Meister Eduard Gröller Computer Graphics Group Vienna University of Technology

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 2 / 14 Overview n Motivation n Live-Wire n Segmentation Process n Cross-Sections n Surface Reconstruction n Results

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 3 / 14 Motivation Segmententation of objects with... n homogeneous contour n inhomogeneous internal structure

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 4 / 14 Live-Wire Interactive contour finding method n Fixed start point n Interactively moveable end point n Calculation of lowest cost path

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 5 / 14 Segmentation Process Overview 1.Selection of orthogonal cross sections 2.Manual contour tracing 3.Automatic reconstruction of the object surface 4.Visualization

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 6 / 14 Segmentation Process (1/2) The user defines a set of cross-sections through the object and traces the contours

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 7 / 14 Segmentation Process (2/2) The surface is reconstructed from the traced contours

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 8 / 14 Surface Reconstruction (1/4) A B D E F C 2. Create connectivity graph for each slice A B C D E F

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 9 / 14 Surface Reconstruction (2/4) Edges are sorted by angle around the center of each area. Every area is convex. Every second outgoing edge - beginning from the incoming edge – is evaluated: The edge with the lowest average cost per pixel is selected as successor.

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 10 / 14 Surface Reconstruction (3/4) The connectivity graph is an Eulerian graph: n All vertices have an even number of adjacent edges n Graph contains a closed path containing each edges exactly once n Successor selection heuristics avoids crossing paths  Graph can always be decomposited into non-crossing closed pathscircuits.

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 11 / 14 Surface Reconstruction (4/4) A B C D E F F A B D E C... and reconstruct the outline

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 12 / 14 Threshold (1400)Contour-Based Results (1/2)

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 13 / 14 Results (2/2) Threshold Region growing Our method

WSCG Michael Knapp: Contour-Based 2 ½ D Segmentation using Live-Wire 14 / 14 Thank You for Your Attention !