Combinatorial Continuous Maximum Flow

DOI10.1137/100799186zbMath1231.90366arXiv1010.2733OpenAlexW1528161460MaRDI QIDQ3113797

Laurent Najman, Hugues Talbot, Camille Couprie, Leo Grady

Publication date: 25 January 2012

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.2733

zbMATH Keywords

minimal surfacesinterior point methodsimage segmentationtotal variation minimizationdiscrete calculus

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Computing methodologies for image processing (68U10) Interior-point methods (90C51) PDEs in connection with control and optimization (35Q93) PDEs in connection with mathematical programming (35Q90)

Related Items (7)

Global binary optimization on graphs for classification of high-dimensional data ⋮ Investigations on the influence of the boundary conditions when computing the effective crack energy of random heterogeneous materials using fast marching methods ⋮ A spatially continuous max-flow and min-cut framework for binary labeling problems ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Discrete and continuous models for partitioning problems ⋮ Theoretical Analysis of Active Contours on Graphs ⋮ Computing the effective crack energy of heterogeneous and anisotropic microstructures via anisotropic minimal surfaces

This page was built for publication: Combinatorial Continuous Maximum Flow