Cut, Glue & Cut: A Fast, Approximate Solver for Multicut Partitioning

no code implementations • CVPR 2014 • Thorsten Beier, Thorben Kroeger, Jorg H. Kappes, Ullrich Kothe, Fred A. Hamprecht

Since this problem is NP-hard, we propose a new approximate solver based on the move-making paradigm: first, the graph is recursively partitioned into small regions (cut phase).

Image Segmentation Semantic Segmentation +1