Divide&Conquer based Vectorization

Slides:



Advertisements
Similar presentations
Goal: a graph representation of the topology of a gray scale image. The graph represents the hierarchy of the lower and upper level sets of the gray level.
Advertisements

Day 7.
1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.
Advanced Iso-Surfacing Algorithms Jian Huang, CS594, Spring 2002 This set of slides are developed and used by Prof. Han-Wei Shen at Ohio State University.
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
A graph, non-tree representation of the topology of a gray scale image Peter Saveliev Marshall University, USA.
Classes of Polygons Planar polygons Non-planar polygons Simple
1 Modularity and Community Structure in Networks* Final project *Based on a paper by M.E.J Newman in PNAS 2006.
Creating Vectors – Part Two 2.02 Understand Digital Vector Graphics.
Quadtrees Raster and vector.
MRF Labeling With Graph Cut CMPUT 615 Nilanjan Ray.
Traffic Sign Identification Team G Project 15. Team members Lajos Rodek-Szeged, Hungary Marcin Rogucki-Lodz, Poland Mircea Nanu -Timisoara, Romania Selman.
Computer Science Department Detection, Alignment and Recognition of Real World Faces Erik Learned-Miller with Vidit Jain, Gary Huang, Andras Ferencz, et.
Samuli Laine: A General Algorithm for Output-Sensitive Visibility PreprocessingI3D 2005, April 3-6, Washington, D.C. A General Algorithm for Output- Sensitive.
Multi-resolution Arc Segmentation: Algorithms and Performance Evaluation Jiqiang Song Jan. 12 th, 2004.
IIS for Image Processing Michael J. Watts
Basics of Rendering Pipeline Based Rendering –Objects in the scene are rendered in a sequence of steps that form the Rendering Pipeline. Ray-Tracing –A.
CS654: Digital Image Analysis Lecture 3: Data Structure for Image Analysis.
Chapter 14: SEGMENTATION BY CLUSTERING 1. 2 Outline Introduction Human Vision & Gestalt Properties Applications – Background Subtraction – Shot Boundary.
CS 6068 Parallel Computing Fall 2013 Lecture 10 – Nov 18 The Parallel FFT Prof. Fred Office Hours: MWF.
Objectives: To solve and graph simple and compound inequalities.
Definitions of the Day (DODs) 4.8 – Compound Inequalities Compound Inequality.
Compound Inequalities
4.1 Solving Linear Inequalities
Learning Task/Big Idea: Students will learn how to find roots(x-intercepts) of a quadratic function and use the roots to graph the parabola.
Raster to Vector Conversion Ioana Ciobanu János Farkas Pawel Kulinski Arpád Szövérdfi SSIP Timisoara 2003.
Soham Uday Mehta. Linear Programming in 3 variables.
Completing the Square and Vertex Form of a Quadratic
Notes Over 5.7 True Solid Check (0,0) Normal Graph
Absolute Value Equations & Inequalities. Review: Absolute Value The magnitude of a real number without regard to its sign. OR Distance of value from zero.
Section 5.5 The Real Zeros of a Polynomial Function.
Course 8 Contours. Def: edge list ---- ordered set of edge point or fragments. Def: contour ---- an edge list or expression that is used to represent.
Circle By: Nasser Alkaabi. Definition of a Circle What is a Circle? Circles are simple closed shape which divided into two semi circles. A circle is a.
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.
Song Wei Enabling Distributed Throughput Maximization in Wireless Mesh Networks A Partitioning Approach.
Adiabatic quantum computer (AQC) Andrii Rudavskyi Supervisor: prof. Petra Rudolf.
Reducing Artifacts in Surface Meshes Extracted from Binary Volumes R. Bade, O. Konrad and B. Preim efficient smoothing of iso-surface meshes Plzen - WSCG.
Recognition of biological cells – development
Bitmap Image Vectorization using Potrace Algorithm
Transformations and Symmetry
IIS for Image Processing
Solve and graph the inequalities.
Cui Di Supervisor: Andrzej Lingas Lund University
Graph Based Shapes Representation and Recognition
H. Lipson and M. Shpitalni CAD, 1996
Computer Graphics.
either inequality true
Domain and range.
Creating Vectors – Part Two
دانشگاه شهیدرجایی تهران
Chapter 10 Image Segmentation.
تعهدات مشتری در کنوانسیون بیع بین المللی
1.6 Solve Linear Inequalities
Lecture 07: Data Representation (V)
بسمه تعالی کارگاه ارزشیابی پیشرفت تحصیلی
GIS Lecture: Editing Data
Transformations of Quadratic Functions Parent function:
Graphs.
Day 2 Write in Vertex form Completing the Square Imaginary Numbers Complex Roots.
1st 10 Minutes Grab the following: New Unit 3B Note Packet
Shodmonov M.. The main goal of the work Analysis.
Objective: To know the equations of simple straight lines.
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Sorting and Divide-and-Conquer
Notes Over 5.1 Graphing a Quadratic Function Vertex: Up Normal.
Jeopardy Final Jeopardy Solving Equations Solving Inequalities
Students will be able to solve compound inequalities.
1.6 Solving Linear Inequalities
Creating Vectors – Part Two
Objective: To know the equations of simple straight lines.
Presentation transcript:

Divide&Conquer based Vectorization Mgr. Michal Récky Comenius University, Bratislava

Image vectorization Raster image transformed to vector image First step in object recognition Edges are transformed into vectors

Divide&Conquer approach Idea: vectorization can be solved easily in small segments of image Fast and relative simple algorithm compared to other methods Can be applied on complex (real) images

Divide Edge detector is applied on image Image is divided into cells Vectorization problem is solved inside these cells separately

Types of cells Simple line Arc T-junction Complex junction

Conquer Set of vector is transformed into graph Joining close vertexes Removing vertexes at straight lines

Example 1

Example 2

Summary More testing is required Extensive practical application Divide&conquer based vectorization has the potential to become the most effective method available

Thank you for your attention Mgr. Michal Récky recky@fmph.uniba.sk