A Greedy Strategy for Graph Cut

Feiping Nie, Shenfei Pei, Zengwei Zheng +2

We propose a Greedy strategy to solve the problem of Graph Cut, called GGC. It starts from the state where each data sample is regarded as a cluster and dynamically merges the two…