Publication:4787357
From MaRDI portal
zbMath1005.68964MaRDI QIDQ4787357
Vladimir Kolmogorov, Yuri Boykov
Publication date: 6 January 2003
Related Items
Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs, Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment, Active-set Methods for Submodular Minimization Problems, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, Efficient and Convergent Preconditioned ADMM for the Potts Models, Hypergraph Cuts with General Splitting Functions, 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, Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time, Differential oriented image foresting transform and its applications to support high-level priors for object segmentation, MAXFLOW, Branch-and-cut algorithms for the split delivery vehicle routing problem, Global minimization for continuous multiphase partitioning problems using a dual approach, Stereoscopic scene flow computation for 3D motion understanding, Fast approximate energy minimization with label costs, Harmony potentials fusing global and local scale for semantic image segmentation, Domain decomposition methods with graph cuts algorithms for total variation minimization, Graph cuts with interacting edge weights: examples, approximations, and algorithms, Unsupervised image segmentation with Gaussian pairwise Markov fields, 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, Conditional random fields for pattern recognition applied to structured data, Conditional random fields for image labeling, Multi-label moves for MRFs with truncated convex priors, Minimizing energies with hierarchical costs, A spatial regularization approach for vector quantization, Recursive compositional models for vision: description and review of recent work, Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs, Reproducible kernel Hilbert space based global and local image segmentation, Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case, Efficient hierarchical multi-object segmentation in layered graphs, Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings, A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model, A distributed mincut/maxflow algorithm combining path augmentation and push-relabel, Efficient global minimization methods for image segmentation models with four regions, Image restoration with discrete constrained total variation. I: Fast and exact optimization, A spatially continuous max-flow and min-cut framework for binary labeling problems, A discrete level set approach to image segmentation, Clothing segmentation using foreground and background estimation based on the constrained Delaunay triangulation, A surface reconstruction method using global graph cut optimization, Variational surface reconstruction based on Delaunay triangulation and graph cut, Continuous limits of discrete perimeters, Graph Cut Optimization for the Piecewise Constant Level Set Method Applied to Multiphase Image Segmentation
