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

Authors Ondrej Danek, Martin Maska



PDF
Thumbnail PDF

File

OASIcs.MEMICS.2010.19.pdf
  • Filesize: 0.55 MB
  • 7 pages

Document Identifiers

Author Details

Ondrej Danek
Martin Maska

Cite AsGet BibTex

Ondrej Danek and Martin Maska. 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 (MEMICS'10) -- Selected Papers. Open Access Series in Informatics (OASIcs), Volume 16, pp. 19-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/OASIcs.MEMICS.2010.19

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.
Keywords
  • maximum flow
  • topology preserving
  • image segmentation
  • graph cuts

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail