A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation

Ondrej Danek & Martin Maska
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [Boykov, Kolmogorv, IEEE 2004] in order to make the algorithm preserve the topology of an initial interface. This algorithm is being widely used in computer vision and image processing fields for its efficiency and speed when dealing with problems such as graph cut based image segmentation. Using our modification we are able to incorporate a topology prior into the algorithm allowing us...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.