Global optimization for first order Markov random fields with submodular priors
From MaRDI portal
Publication:967400
DOI10.1016/j.dam.2009.02.026zbMath1230.68210MaRDI QIDQ967400
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.026
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
68U10: Computing methodologies for image processing
68T45: Machine vision and scene understanding
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Network flow optimization for restoration of images
- On total variation minimization and surface evolution using parametric maximum flows
- Global optimization for first order Markov random fields with submodular priors
- Image textures and Gibbs random fields
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- Image restoration with discrete constrained total variation. II: Levelable functions, convex priors and non-convex cases
- Image restoration with discrete constrained total variation. I: Fast and exact optimization
- Stability of the minimizers of least squares with a non-convex regularization. II: Global behavior
- Stability of the minimizers of least squares with a non-convex regularization. I: Local behavior
- Model distortions in Bayesian MAP reconstruction
- Solving the Convex Cost Integer Dual Network Flow Problem
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Minimum cuts and related problems
- Discrete Convex Analysis
- Aspects of Total Variation RegularizedL1Function Approximation
- SAR Image Regularization With Fast Approximate Discrete Minimization
- An efficient algorithm for image segmentation, Markov random fields and related problems
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- Convex separable optimization is not much harder than linear optimization
