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

Thorsten Beier Björn Andres Ullrich Köthe Fred A. Hamprecht

Published in: ECCV (2) (2016)

Keyphrases

minimum cost
np hard
optimal solution
spanning tree
network flow
dynamic programming
objective function
computational complexity
matching algorithm
network flow problem
worst case
bayesian networks
search space
minimal cost