Reduced graphs for min-cut/max-flow approaches in image segmentation

DOI10.1016/j.endm.2011.05.012zbMath1268.68165OpenAlexW2027170820MaRDI QIDQ2840685

Lucas Létocart, Nicolas Lermé, François Malgouyres

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.012

zbMATH Keywords

image segmentationgraph reductionMIN-cut/MAX-flow

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computing methodologies for image processing (68U10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A reduction method for graph cut optimization

Uses Software

• MAXFLOW

This page was built for publication: Reduced graphs for min-cut/max-flow approaches in image segmentation