Outline for lecture on image segmentation
CSE/EE 576 April 28, 1995, SLT
1. Finding connected components using a minimum spanning forest alg.
a. Dijkstra's algorithm for all shortest paths from one vertex
to the others in a graph.
b. Minimum spanning trees.
Dijkstra's algorithm.
Prim's algorithm.
c. Application of Prim's algorithm to image segmentation.
-- works for spanning forest.
-- criteria for connected components.
2. Segmentation into Regions
a. Definition
b. Bottom-up approach based on Prim's algorithm.