An Efficient Fusion Move Algorithm for the Minimum Cost Lifted Multicut Problem

Many computer vision problems can be cast as an optimization problem whose feasible solutions are decompositions of a graph. The minimum cost lifted multicut problem is such an optimization problem. I