License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.MEMICS.2010.19
URN: urn:nbn:de:0030-drops-30695
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3069/
Go to the corresponding OASIcs Volume Portal

Danek, Ondrej ; Maska, Martin

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

pdf-format:
13.pdf (0.6 MB)

Abstract

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 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 [Zeng, Samaras, Chen, Peng, Computer Vision and Image Understanding, 2008]. 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.

BibTeX - Entry

@InProceedings{danek_et_al:OASIcs:2011:3069,
  author =	{Ondrej Danek and Martin Maska},
  title =	{{A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation}},
  booktitle =	{Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'10) -- Selected Papers},
  pages =	{19--25},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-22-4},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{16},
  editor =	{Ludek Matyska and Michal Kozubek and Tom{\'a}{\v{s}} Vojnar and Pavel Zemc{\'i}k and David Antos},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3069},
  URN =		{urn:nbn:de:0030-drops-30695},
  doi =		{10.4230/OASIcs.MEMICS.2010.19},
  annote =	{Keywords: maximum flow, topology preserving, image segmentation, graph cuts}
}

Keywords: maximum flow, topology preserving, image segmentation, graph cuts
Collection: Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'10) -- Selected Papers
Issue Date: 2011
Date of publication: 11.03.2011

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI