lecture15 - Graph Theoretical Techniques for Image...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Graph Theoretical Techniques for Image Segmentation Region Segmentation
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Region Segmentation Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity. n R R R , , , 2 1 I R i i = ± = 2200 j i R R j i , Graph A graph G(V,E) is a triple consisting of a vertex set V(G) an edge set E(G) and a relation that associates with each edge two vertices called its end points.
Background image of page 2
3 Path A path is a sequence of edges e1, e2, e3, … en. Such that each (for each i>2 & i<n) edge ei is adjacent to e(i+1) and e(i-1). e1 is only adjacent to e2 and en is only adjacent to e(n-1) A graph G is connected if there is a path from every vertex to every other vertex in G . A graph G that is not connected is called disconnected graph.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Graphs Representations a e d c b ± ² ³ ³ ³ ³ ³ ³ ´ µ 0 1 1 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 1 0 Adjacency Matrix: W Weighted Graphs and Their Representations a e d c b ± ² ³ ³ ³ ³ ³ ³ ´ µ 0 1
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/12/2011 for the course CAP 5415 taught by Professor Staff during the Fall '08 term at University of Central Florida.

Page1 / 13

lecture15 - Graph Theoretical Techniques for Image...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online