Global optimization for first order Markov Random Fields with submodular priors

Authors:
Jérôme Darbon
Affiliations:
Mathematics Department, University of California, Los Angeles, USA
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 31
Cited 3

Visual reconstruction

Visual reconstruction
Threshold Superposition in Morphological Image Analysis Systems

IEEE Transactions on Pattern Analysis and Machine Intelligence
Using Dynamic Programming for Solving Variational Problems in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Convex separable optimization is not much harder than linear optimization

Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Nonlinear total variation based noise removal algorithms

Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
Global Minimum for Active Contour Models: A Minimal Path Approach

International Journal of Computer Vision
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
Markov random field modeling in image analysis

Markov random field modeling in image analysis
An efficient algorithm for image segmentation, Markov random fields and related problems

Journal of the ACM (JACM)
A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
What Energy Functions Can Be Minimizedvia Graph Cuts?

IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving the Convex Cost Integer Dual Network Flow Problem

Management Science
A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

Management Science
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

Algorithmica
Image processing by simulated annealing

IBM Journal of Research and Development - High-density magnetic recording
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Energy Minimization via Graph Cuts: Settling What is Possible

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Graph Cuts and Efficient N-D Image Segmentation

International Journal of Computer Vision
Image Restoration with Discrete Constrained Total Variation Part II: Levelable Functions, Convex Priors and Non-Convex Cases

Journal of Mathematical Imaging and Vision
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization

Journal of Mathematical Imaging and Vision
Image Analysis, Random Fields and Markov Chain Monte Carlo Methods: A Mathematical Introduction (Stochastic Modelling and Applied Probability)

Image Analysis, Random Fields and Markov Chain Monte Carlo Methods: A Mathematical Introduction (Stochastic Modelling and Applied Probability)
Graphs, Networks and Algorithms

Graphs, Networks and Algorithms
Global optimization for first order Markov random fields with submodular priors

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
A vectorial self-dual morphological filter based on total variation minimization

ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Total variation minimization and a class of binary MRF models

EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
MAP estimation via agreement on trees: message-passing and linear programming

IEEE Transactions on Information Theory
Exact optimization for Markov random fields with convex priors

IEEE Transactions on Pattern Analysis and Machine Intelligence
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Phase Unwrapping via Graph Cuts

IEEE Transactions on Image Processing

Planning Large Data Transfers in Institutional Grids

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Minimization of monotonically levelable higher order MRF energies via graph cuts

IEEE Transactions on Image Processing
Review article: Multilabel partition moves for MRF optimization

Image and Vision Computing

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper copes with the global optimization of Markovian energies. Energies are defined on an arbitrary graph and pairwise interactions are considered. The label set is assumed to be linearly ordered and of finite cardinality, while each interaction term (prior) shall be a submodular function. We propose an algorithm that computes a global optimizer under these assumptions. The approach consists of mapping the original problem into a combinatorial one that is shown to be globally solvable using a maximum-flow/s-t minimum-cut algorithm. This restatement relies on considering the level sets of the labels (seen as binary variables) instead of the label values themselves. The submodularity assumption of the priors is shown to be a necessary and sufficient condition for the applicability of the proposed approach. Finally, some numerical results are presented.