A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
From MaRDI portal
Publication:2917274
DOI10.4230/OASICS.MEMICS.2010.19zbMath1247.68297OpenAlexW3021291646MaRDI QIDQ2917274
Publication date: 28 September 2012
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2011/3069/
This page was built for publication: A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation