Global optimization for first order Markov random fields with submodular priors
type: Item
instance of: scholarly article
title: Global optimization for first order Markov random fields with submodular priors
zbMATH Open document ID: 1230.68210
author: Jérôme Darbon
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 68T45
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5702657
zbMATH Keywords: maximum-flow/\(s-t\) minimum-cut algorithm
zbMATH Keywords: global optimization
zbMATH Keywords: submodular functions
describes a project that uses: MAXFLOW
MaRDI profile type: Publication
full work available at URL: j.dam.2009.02.026
OpenAlex ID: W2040470676
cites work: A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
cites work: Solving the Convex Cost Integer Dual Network Flow Problem
cites work: Q3056948
cites work: Q3750011
cites work: On total variation minimization and surface evolution using parametric maximum flows
cites work: Aspects of Total Variation RegularizedL1Function Approximation
cites work: Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
cites work: Q3844775
cites work: Image restoration with discrete constrained total variation. II: Levelable functions, convex priors and non-convex cases
cites work: Image restoration with discrete constrained total variation. I: Fast and exact optimization
cites work: SAR Image Regularization With Fast Approximate Discrete Minimization
cites work: Stability of the minimizers of least squares with a non-convex regularization. I: Local behavior
cites work: Stability of the minimizers of least squares with a non-convex regularization. II: Global behavior
cites work: Q4198056
cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Image textures and Gibbs random fields
cites work: Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
cites work: An efficient algorithm for image segmentation, Markov random fields and related problems
cites work: Convex separable optimization is not much harder than linear optimization
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
cites work: Q2739738
cites work: Q3682236
cites work: Discrete Convex Analysis
cites work: Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
cites work: Model distortions in Bayesian MAP reconstruction
cites work: Minimum cuts and related problems
cites work: Nonlinear total variation based noise removal algorithms
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
cites work: Network flow optimization for restoration of images
DOI: 10.1016/J.DAM.2009.02.026
Recommended article: Gaussian Markov Random Fields for Discrete Optimization via Simulation: Framework and Algorithms
Recommended article: Global minimization of Markov random fields with applications to optical flow
Recommended article: Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields
Recommended article: Q4969174
Recommended article: A Markovian Incremental Stochastic Subgradient Algorithm
Recommended article: Optimization of Gaussian Random Fields
description: scientific article; zbMATH DE number 5702657