A spatially continuous max-flow and min-cut framework for binary labeling problems
From MaRDI portal
Publication:2454034
DOI10.1007/S00211-013-0569-XzbMATH Open1290.49060OpenAlexW1970535101MaRDI QIDQ2454034FDOQ2454034
Authors: Jing Yuan, Egil Bae, Xue-Cheng Tai, Yuri Boykov 
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
Recommendations
- Combinatorial continuous maximum flow
- scientific article; zbMATH DE number 1849127
- A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation
- Reduced graphs for min-cut/max-flow approaches in image segmentation
- Continuous multiclass labeling approaches and algorithms
Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Numerical methods involving duality (49M29) Numerical methods of relaxation type (49M20)
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Title not available (Why is that?)
- The Split Bregman Method for L1-Regularized Problems
- An algorithm for total variation minimization and applications
- Title not available (Why is that?)
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Title not available (Why is that?)
- Geometric applications of the split Bregman method: segmentation and surface reconstruction
- Title not available (Why is that?)
- A new approach to the maximum-flow problem
- Adjoint operators for the natural discretizations of the divergence, gradient and curl on logically rectangular grids
- Title not available (Why is that?)
- A binary level set model and some applications to Mumford-Shah image segmentation
- Global minimization for continuous multiphase partitioning problems using a dual approach
- A variant of the level set method and applications to image segmentation
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- Natural discretizations for the divergence, gradient, and curl on logically rectangular grids
- Handbook of Mathematical Models in Computer Vision
- Maximal flow through a domain
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial continuous maximum flow
- Title not available (Why is that?)
- Maximum flows and minimum cuts in the plane
- A spatially continuous max-flow and min-cut framework for binary labeling problems
- Examples of max-flow and min-cut problems with duality gaps in continuous networks
Cited In (21)
- Efficient global minimization methods for image segmentation models with four regions
- Bisection approach for pixel labelling problem
- An Operator-Splitting Method for the Gaussian Curvature Regularization Model with Applications to Surface Smoothing and Imaging
- An ILP Model for Multi-Label MRFs With Connectivity Constraints
- Combinatorial continuous maximum flow
- Efficient and convergent preconditioned ADMM for the Potts models
- Fast numerical schemes related to curvature minimization: a brief and elementary review
- Chan-Vese reformulation for selective image segmentation
- The Potts model with different piecewise constant representations and fast algorithms: a survey
- 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
- The truncated variational model for image labeling and graph partitioning
- Global binary optimization on graphs for classification of high-dimensional data
- Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
- Double-well net for image segmentation
- A spatially continuous max-flow and min-cut framework for binary labeling problems
- 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
- Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings
- A convex max-flow approach to distribution-based figure-ground separation
Uses Software
This page was built for publication: A spatially continuous max-flow and min-cut framework for binary labeling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454034)
