This is a repository related to the "Solving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration" paper
- Balanced Edge Contraction (BEC): Creates balanced clusters
- BEC-cut: Creates clusters along the object boundaries
-
The code is based on the graph and graph algorithms library
-
To create the instance of the Lifted Multicut Problem (LMP) we use this folder.
-
After downloading the folder add the two solvers to the directory: "code\include\andres\graph\multicut-lifted"
-
Compile the library
@inproceedings{Kardoost2018,
title = {Solving Minimum Cost Lifted Multicut Problems by Node Agglomeration},
author = {A Kardoost and M. Keuper},
year = {2018},
booktitle = {ACCV 2018, 14th Asian Conference on Computer Vision}
}
@article{Keuper2015,
title = {Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts},
author = {M. Keuper and E. Levinkov and N. Bonneel and G. Lavou{\'e} and T. Brox and B. Andres},
journal = {ICCV},
year = {2015}
}