MAXFLOW

swMATH13223MaRDI QIDQ25139FDOQ25139

Author name not available (Why is that?)

Source code repository: https://github.com/oesteban/MBIS/tree/master/Code/ThirdParty/maxflow-3.0

Cited In (only showing first 100 items - show all)

• Active-set Methods for Submodular Minimization Problems
• A multiatlas segmentation using graph cuts with applications to liver segmentation in CT scans
• Bayesian estimation of Dirichlet mixture model with variational inference
• Reduced graphs for min-cut/max-flow approaches in image segmentation
• Unsupervised image segmentation with Gaussian pairwise Markov fields
• Harmony potentials fusing global and local scale for semantic image segmentation
• Stereoscopic scene flow computation for 3D motion understanding
• Simplifying maximum flow computations: the effect of shrinking and good initial flows
• Global optimization for first order Markov random fields with submodular priors
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• Domain decomposition methods with graph cuts algorithms for total variation minimization
• Scale selection for anisotropic diffusion filter by Markov random field model
• Minimizing a sum of submodular functions
• Interactively multiphase image segmentation based on variational formulation and graph cuts
• Benders decomposition approach for the robust network design problem with flow bifurcations
• The traveling purchaser problem with time-dependent quantities
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Maximum flows and minimum cuts in the plane
• Interactive image segmentation using probabilistic hypergraphs
• Patch-to-tensor embedding
• Percolation and Schramm-Loewner evolution in the 2D random-field Ising model
• Interactive image segmentation by maximal similarity based region merging
• A discrete level set approach to image segmentation
• A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• Texture segmentation using independent-scale component-wise Riemannian-covariance Gaussian mixture model in KL measure based multi-scale nonlinear structure tensor space
• An ILP-refined tabu search for the directed profitable rural postman problem
• Variational surface reconstruction based on Delaunay triangulation and graph cut
• Efficient hierarchical multi-object segmentation in layered graphs
• Branch-and-mincut: global optimization for image segmentation with high-level priors
• Graph Cut Optimization for the Piecewise Constant Level Set Method Applied to Multiphase Image Segmentation
• Parametric maximum flow algorithms for fast total variation minimization
• Global binary optimization on graphs for classification of high-dimensional data
• Graph cuts with interacting edge weights: examples, approximations, and algorithms
• Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• Fast approximate energy minimization with label costs
• Global minimization for continuous multiphase partitioning problems using a dual approach
• Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
• Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
• Conditional random fields for image labeling
• A surface reconstruction method using global graph cut optimization
• Automatic liver segmentation on volumetric CT images using supervoxel-based graph cuts
• A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
• Bayesian image restoration for mosaic active imaging
• A spatial regularization approach for vector quantization
• A comparative evaluation of interactive segmentation algorithms
• A unified framework for designing textures using energy optimization
• Image restoration with discrete constrained total variation. II: Levelable functions, convex priors and non-convex cases
• SymStereo: stereo matching using induced symmetry
• A reduction method for graph cut optimization
• Exact solution to median surface problem using 3D graph search and application to parameter space exploration
• Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
• Image restoration with discrete constrained total variation. I: Fast and exact optimization
• Links between image segmentation based on optimum-path forest and minimum cut in graph
• Globally optimal joint image segmentation and shape matching based on Wasserstein modes
• Interactive segmentation based on component-trees
• Continuous limits of discrete perimeters
• Hypergraph Cuts with General Splitting Functions
• On total variation minimization and surface evolution using parametric maximum flows
• A spatially continuous max-flow and min-cut framework for binary labeling problems
• New algorithms for convex cost tension problem with application to computer vision
• A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model
• Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment
• A primal-dual active-set algorithm for bilaterally constrained total variation deblurring and piecewise constant Mumford-Shah segmentation problems
• Efficient global minimization methods for image segmentation models with four regions
• Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program
• Robust \(H_\infty\) control for nonlinear uncertain switched descriptor systems with time delay and nonlinear input: a sliding mode approach
• The Application of Cellular Automaton in Medical Semiautomatic Segmentation
• Total Variation in Imaging
• Simplifications and speedups of the pseudoflow algorithm
• Conditional random fields for pattern recognition applied to structured data
• Exact solution of the soft-clustered vehicle-routing problem
• Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs
• Minimizing energies with hierarchical costs
• Seed Robustness of Oriented Image Foresting Transform: Core Computation and the Robustness Coefficient
• The Role of Optimum Connectivity in Image Segmentation: Can the Algorithm Learn Object Information During the Process?
• Built-up area detection based on a Bayesian saliency model
• A visibility-based surface reconstruction method on the GPU
• Clothing segmentation using foreground and background estimation based on the constrained Delaunay triangulation
• Mathematical Programming Algorithms for Spatial Cloaking
• Reproducible kernel Hilbert space based global and local image segmentation
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• LOD generation for urban scenes
• Controllable edge feature sharpening for dental applications
• The multi-visit team orienteering problem with precedence constraints
• Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
• A transductive multi-label learning approach for video concept detection
• Global optimization of wavelet-domain hidden Markov tree for image segmentation
• Multi-label moves for MRFs with truncated convex priors
• Temporally coherent general dynamic scene reconstruction
• Learning complementary saliency priors for foreground object segmentation in complex scenes
• Online Linear Optimization for Job Scheduling Under Precedence Constraints
• Using the graph-cut method to segment the mineralization area in the gejiu region of Yunnan province, China
• Thin structures retrieval using anisotropic neighborhoods of superpixels: application to shape-from-focus
• Iterative graph cuts for image segmentation with a nonlinear statistical shape prior
• Image segmentation by iterative optimization of multiphase multiple piecewise constant model and Four-Color relabeling
• Multi-layer graph constraints for interactive image segmentation via game theory
• Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds
• Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings

This page was built for software: MAXFLOW