Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings

DOI10.1007/s11263-017-0994-xzbMath1455.68233OpenAlexW2588637939MaRDI QIDQ2193778

Martin Rajchl, Jing Yuan, John S. H. Baxter, A. Jonathan McLeod, Terry M. Peters

Publication date: 20 August 2020

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://ir.lib.uwo.ca/robartspub/21

zbMATH Keywords

convex optimizationimage segmentationvariational optimizationcontinuous max-flow

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Computing methodologies for image processing (68U10)

Uses Software

• MAXFLOW
• BrainWeb

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recovering occlusion boundaries from an image
• Pseudo-Boolean optimization
• Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
• Proximal minimization algorithm with \(D\)-functions
• An algorithm for total variation minimization and applications
• Minimizing energies with hierarchical costs
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Monotone Operators and the Proximal Point Algorithm
• Some Network Flow Problems Solved with Pseudo-Boolean Programming

This page was built for publication: Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings