A spatially continuous max-flow and min-cut framework for binary labeling problems
From MaRDI portal
Publication:2454034
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
Cites work
- scientific article; zbMATH DE number 1646249 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3624328 (Why is no real title available?)
- scientific article; zbMATH DE number 2062604 (Why is no real title available?)
- scientific article; zbMATH DE number 2062605 (Why is no real title available?)
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- scientific article; zbMATH DE number 1849127 (Why is no real title available?)
- A binary level set model and some applications to Mumford-Shah image segmentation
- A new approach to the maximum-flow problem
- A spatially continuous max-flow and min-cut framework for binary labeling problems
- A variant of the level set method and applications to image segmentation
- Adjoint operators for the natural discretizations of the divergence, gradient and curl on logically rectangular grids
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- An algorithm for total variation minimization and applications
- Combinatorial continuous maximum flow
- Examples of max-flow and min-cut problems with duality gaps in continuous networks
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Geometric applications of the split Bregman method: segmentation and surface reconstruction
- Global minimization for continuous multiphase partitioning problems using a dual approach
- Handbook of Mathematical Models in Computer Vision
- Introduction to algorithms
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- Maximal flow through a domain
- Maximum flows and minimum cuts in the plane
- Natural discretizations for the divergence, gradient, and curl on logically rectangular grids
- The Split Bregman Method for L1-Regularized Problems
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
- Global binary optimization on graphs for classification of high-dimensional data
- The truncated variational model for image labeling and graph partitioning
- 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
- A spatially continuous max-flow and min-cut framework for binary labeling problems
- Double-well net for image segmentation
- 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
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)
