A reduction method for graph cut optimization

DOI10.1007/S10044-013-0337-7zbMATH Open1328.68276OpenAlexW2088985501MaRDI QIDQ903099FDOQ903099

Authors: François Malgouyres, Nicolas Lermé 

Publication date: 5 January 2016

Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10044-013-0337-7

Recommendations

• Reduced graphs for min-cut/max-flow approaches in image segmentation
• scientific article; zbMATH DE number 2062604
• Exact solutions for discrete graphical models. Multicuts and reduction techniques
• scientific article; zbMATH DE number 1849127
• Domain decomposition methods with graph cuts algorithms for image segmentation

zbMATH Keywords

segmentationfilteringreductiongraph cuts

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Cites Work

• Nonlinear total variation based noise removal algorithms
• Combinatorial Image Analysis
• Reduced graphs for min-cut/max-flow approaches in image segmentation
• A reduction method for graph cut optimization

Cited In (4)

• Reduced graphs for min-cut/max-flow approaches in image segmentation
• A reduction method for graph cut optimization
• An improved Riemannian metric approximation for graph cuts
• Exact solutions for discrete graphical models. Multicuts and reduction techniques

Uses Software

• MAXFLOW

This page was built for publication: A reduction method for graph cut optimization

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