MAXFLOW

MaRDI QIDQ25139swMATHFDO

Official website https://github.com/oesteban/MBIS/tree/master/Code/ThirdParty/maxflow-3.0

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

Cited in

(only showing first 100 items - show all)

• Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
• A multiatlas segmentation using graph cuts with applications to liver segmentation in CT scans
• Robust \(H_\infty\) control for nonlinear uncertain switched descriptor systems with time delay and nonlinear input: a sliding mode approach
• Active-set Methods for Submodular Minimization Problems
• Efficient global minimization methods for image segmentation models with four regions
• Bayesian estimation of Dirichlet mixture model with variational inference
• Unsupervised image segmentation with Gaussian pairwise Markov fields
• Reduced graphs for min-cut/max-flow approaches in image segmentation
• 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
• Total Variation in Imaging
• Conditional random fields for pattern recognition applied to structured data
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• Exact solution of the soft-clustered vehicle-routing problem
• 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
• Simplifications and speedups of the pseudoflow algorithm
• Interactively multiphase image segmentation based on variational formulation and graph cuts
• Faster and more dynamic maximum flow by incremental breadth-first search
• Minimizing energies with hierarchical costs
• Benders decomposition approach for the robust network design problem with flow bifurcations
• The traveling purchaser problem with time-dependent quantities
• Maximum flows and minimum cuts in the plane
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Interactive image segmentation using probabilistic hypergraphs
• Patch-to-tensor embedding
• Interactive image segmentation by maximal similarity based region merging
• Percolation and Schramm-Loewner evolution in the 2D random-field Ising model
• A discrete level set approach to image segmentation
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
• 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
• A visibility-based surface reconstruction method on the GPU
• Built-up area detection based on a Bayesian saliency model
• Variational surface reconstruction based on Delaunay triangulation and graph cut
• Clothing segmentation using foreground and background estimation based on the constrained Delaunay triangulation
• 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
• Mathematical Programming Algorithms for Spatial Cloaking
• Solving LP relaxations of some NP-hard problems is as hard as solving any linear program
• Efficient hierarchical multi-object segmentation in layered graphs
• Branch-and-mincut: global optimization for image segmentation with high-level priors
• Image labeling based on graphical models using Wasserstein messages and geometric assignment
• Controllable edge feature sharpening for dental applications
• LOD generation for urban scenes
• Parametric maximum flow algorithms for fast total variation minimization
• Graph Cut Optimization for the Piecewise Constant Level Set Method Applied to Multiphase Image Segmentation
• The multi-visit team orienteering problem with precedence constraints
• Global binary optimization on graphs for classification of high-dimensional data
• Graph cuts with interacting edge weights: examples, approximations, and algorithms
• GC-PPXA-QUANTIZER
• MESH
• FTVd
• BSDS
• pottslab
• Steerable pyramid
• GrabCut
• BrainWeb
• MEALS
• Graph Cut
• KaHyPar
• OpenGM
• gbvs
• SGTlight
• SaliencyToolbox
• TVR-DART
• SUN
• gco
• Topology ToolKit
• iCoseg
• OpenMVS
• InstanceSpace
• NEF++
• Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model
• Fast approximate energy minimization with label costs
• Global minimization for continuous multiphase partitioning problems using a dual approach
• Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
• condat_tv
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• Conditional random fields for image labeling
• Automatic liver segmentation on volumetric CT images using supervoxel-based graph cuts
• A transductive multi-label learning approach for video concept detection
• Global optimization of wavelet-domain hidden Markov tree for image segmentation
• A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
• A surface reconstruction method using global graph cut optimization
• Seed robustness of oriented iImage foresting transform: core computation and the robustness coefficient
• Bayesian image restoration for mosaic active imaging
• Multi-label moves for MRFs with truncated convex priors
• A comparative evaluation of interactive segmentation algorithms
• A unified framework for designing textures using energy optimization
• A spatial regularization approach for vector quantization
• SymStereo: stereo matching using induced symmetry
• A reduction method for graph cut optimization
• Image restoration with discrete constrained total variation. II: Levelable functions, convex priors and non-convex cases
• Temporally coherent general dynamic scene reconstruction
• Exact solution to median surface problem using 3D graph search and application to parameter space exploration

This page was built for software: MAXFLOW