New algorithms for convex cost tension problem with application to computer vision

DOI10.1016/j.disopt.2009.04.006zbMath1179.90320OpenAlexW1983075526MaRDI QIDQ1040084

Vladimir Kolmogorov, Akiyoshi Shioura

Publication date: 23 November 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2009.04.006

zbMATH Keywords

submodular functionminimum cost tensionminimum cost flowdiscrete convex function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Note on time bounds of two-phase algorithms for \(L\)-convex function minimization, Multi-label moves for MRFs with truncated convex priors, A spatial regularization approach for vector quantization, Discrete Midpoint Convexity, Recent Developments in Discrete Convex Analysis, A framework of discrete DC programming by discrete convex analysis, L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem, Dijkstra's algorithm and L-concave function maximization, Robust budget allocation via continuous submodular functions, Directed discrete midpoint convexity, Exact bounds for steepest descent algorithms of $L$-convex function minimization, Discrete convexity and polynomial solvability in minimum 0-extension problems

Uses Software

• MAXFLOW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudo-Boolean optimization
• Network flow optimization for restoration of images
• A polynomial algorithm for minimum quadratic cost flow problems
• A faster strongly polynomial time algorithm for submodular function minimization
• Discrete convex analysis
• Notes on L-/M-convex functions and the separation theorems
• Network flow, transportation and scheduling. Theory and algorithms
• A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
• Solving the Convex Cost Integer Dual Network Flow Problem
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• Discrete Convex Analysis
• On Steepest Descent Algorithms for Discrete Convex Functions
• An efficient algorithm for image segmentation, Markov random fields and related problems
• Computer Vision - ECCV 2004