LOGIN
>> Home
>> Topics
>> Students
>> Partners
>> Statistics
Information for topics
Topic Id:
ID topic:
219
Partner Email:
stavros@cs.uoi.gr
Project Title:
Min-Cut Algorithms and Applications on Image Segmentation
Abstract:
In this thesis we study the minimum cut problem that is to partition a graph G, containing edge weights, into two disjoint subgraphs such that the sum of the edge weights that connect the two subgraphs is minimized; the optimal partition is called min-cut. In literature there are many techniques that are related to this problem (e.g., flow-based techniques, edge contraction-based techniques, etc). We propose an hierarchical graph partition method HSW that is based on the Stoer-Wagner (SW) min-cat algorithm, and apply this method on the image segmentation problem.
Advisor:
Stavros Nikolopoulos
Link:
Degree:
Master
Keywords:
