scientific article; zbMATH DE number 1849127

Publication date: 6 January 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Computing methodologies and applications (68U99) Machine vision and scene understanding (68T45)

Related Items (max. 100)

Unsupervised image segmentation with Gaussian pairwise Markov fields ⋮ Branch-and-cut algorithms for the split delivery vehicle routing problem ⋮ Image restoration with discrete constrained total variation. I: Fast and exact optimization ⋮ Hypergraph Cuts with General Splitting Functions ⋮ Multi-label moves for MRFs with truncated convex priors ⋮ Minimizing energies with hierarchical costs ⋮ Global binary optimization on graphs for classification of high-dimensional data ⋮ Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time ⋮ A spatial regularization approach for vector quantization ⋮ Recursive compositional models for vision: description and review of recent work ⋮ Differential oriented image foresting transform and its applications to support high-level priors for object segmentation ⋮ 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 ⋮ Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings ⋮ Domain decomposition methods with graph cuts algorithms for total variation minimization ⋮ Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds ⋮ A spatially continuous max-flow and min-cut framework for binary labeling problems ⋮ Continuous limits of discrete perimeters ⋮ Conditional random fields for pattern recognition applied to structured data ⋮ A discrete level set approach to image segmentation ⋮ Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Variational surface reconstruction based on Delaunay triangulation and graph cut ⋮ Clothing segmentation using foreground and background estimation based on the constrained Delaunay triangulation ⋮ 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 ⋮ Reproducible kernel Hilbert space based global and local image segmentation ⋮ A surface reconstruction method using global graph cut optimization ⋮ 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 ⋮ Conditional random fields for image labeling ⋮ Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case ⋮ A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions ⋮ Graph Cut Optimization for the Piecewise Constant Level Set Method Applied to Multiphase Image Segmentation ⋮ Efficient hierarchical multi-object segmentation in layered graphs ⋮ MAXFLOW ⋮ The Role of Optimum Connectivity in Image Segmentation: Can the Algorithm Learn Object Information During the Process? ⋮ Active-set Methods for Submodular Minimization Problems ⋮ Efficient and Convergent Preconditioned ADMM for the Potts Models ⋮ Efficient global minimization methods for image segmentation models with four regions ⋮ Built-up area detection based on a Bayesian saliency model

This page was built for publication: