# lecture15 - Graph Theoretical Techniques for Image...

This preview shows pages 1–9. Sign up to view the full content.

Graph Theoretical Techniques for Image Segmentation

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

View Full Document
Region Segmentation
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 ,

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

View Full Document
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.
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)

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

View Full Document
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.
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

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

View Full Document
Representations a e d
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 25

lecture15 - Graph Theoretical Techniques for Image...

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

View Full Document
Ask a homework question - tutors are online