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

DOI10.1016/J.ENDM.2011.05.012MaRDI QIDQ2840685zbMATH OpenOpenAlexFDO

Authors Nicolas Lermé, L. Létocart, 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) Graph algorithms (graph-theoretic aspects) (05C85) Computing methodologies for image processing (68U10)

Recommendations

• A reduction method for graph cut optimization
• scientific article; zbMATH DE number 1849127
• A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation
• scientific article; zbMATH DE number 2062604
• Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis

Cited in

(9)

• A simple topology preserving max-flow algorithm for graph cut based image segmentation
• A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
• A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation
• scientific article; zbMATH DE number 1849127 (Why is no real title available?)
• A reduction method for graph cut optimization
• Links between image segmentation based on optimum-path forest and minimum cut in graph
• Graph cuts in segmentation of a left ventricle from MRI data
• A spatially continuous max-flow and min-cut framework for binary labeling problems
• Exact solutions for discrete graphical models. Multicuts and reduction techniques

Describes a project that uses

Uses Software

• MAXFLOW

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840685)