A spatially continuous max-flow and min-cut framework for binary labeling problems

DOI10.1007/s00211-013-0569-xzbMath1290.49060OpenAlexW1970535101MaRDI QIDQ2454034

Jing Yuan, Yuri Boykov, Egil Bae, Xue-Cheng Tai

Publication date: 12 June 2014

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-013-0569-x

zbMATH Keywords

optimizationimage segmentationbinary labeling problemsmax-flow/min-cut modelsprimal/dual problems

Mathematics Subject Classification ID

Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Numerical methods of relaxation type (49M20)

Related Items (11)

An Operator-Splitting Method for the Gaussian Curvature Regularization Model with Applications to Surface Smoothing and Imaging ⋮ Global binary optimization on graphs for classification of high-dimensional data ⋮ Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds ⋮ An effective region force for some variational models for learning and clustering ⋮ A spatially continuous max-flow and min-cut framework for binary labeling problems ⋮ Fast numerical schemes related to curvature minimization: a brief and elementary review ⋮ Reproducible kernel Hilbert space based global and local image segmentation ⋮ A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation ⋮ Efficient and Convergent Preconditioned ADMM for the Potts Models ⋮ Chan-Vese reformulation for selective image segmentation ⋮ Efficient global minimization methods for image segmentation models with four regions

Uses Software

• MAXFLOW

Cites Work

• Global minimization for continuous multiphase partitioning problems using a dual approach
• Geometric applications of the split Bregman method: segmentation and surface reconstruction
• Natural discretizations for the divergence, gradient, and curl on logically rectangular grids
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Examples of max-flow and min-cut problems with duality gaps in continuous networks
• Adjoint operators for the natural discretizations of the divergence, gradient and curl on logically rectangular grids
• An algorithm for total variation minimization and applications
• A spatially continuous max-flow and min-cut framework for binary labeling problems
• Combinatorial Continuous Maximum Flow
• The Split Bregman Method for L1-Regularized Problems
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• A binary level set model and some applications to Mumford-Shah image segmentation
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
• Maximum Flows and Minimum Cuts in the Plane
• Maximal flow through a domain
• A new approach to the maximum-flow problem
• Handbook of Mathematical Models in Computer Vision
• A variant of the level set method and applications to image segmentation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A spatially continuous max-flow and min-cut framework for binary labeling problems