Publication details

<< back
 

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

Basic information
Original title:A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
Authors:Ondřej Daněk, Martin Maška
Further information
Citation:DANĚK, Ondřej - MAŠKA, Martin. A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation. In Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (Selected Papers). Saarbrücken, Warden : Schloss Dagstuhl Publishing, 2011. ISBN 978-3-939897-22-4, pp. 19-25. 22.10.2010, Mikulov. OASIcs: Open Access Series in Informatics.
Original language:English
Field:Informatika
WWW:link to a new windowhttp://drops.dagstuhl.de/portals/oasics/index.php?semnr=11002
Type:Article in Proceedings
Keywords:maximum flow algorithm; topology preserving; image segmentation; graph cuts

In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm 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 to apply it in situations in which the inherent topological flexibility of graph cuts is inconvenient (e.g., biomedical image segmentation). Our approach exploits the simple point concept from digital geometry and is simpler and more straightforward to implement than previously introduced methods. Due to the NP-completeness of the topology preserving problem our algorithm is only an approximation and is initialization dependent. However, promising results are demonstrated on graph cut based segmentation of both synthetic and real image data.

Related projects:

 
 
top