Exact optimization for markov random fields with convex priors
Top Cited Papers
- 29 September 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 25 (10) , 1333-1336
- https://doi.org/10.1109/tpami.2003.1233908
Abstract
We introduce a method to solve exactly a first order Markov random field optimization problem in more generality than was previously possible. The MRF has a prior term that is convex in terms of a linearly ordered label set. The method maps the problem into a minimum-cut problem for a directed graph, for which a globally optimal solution can be found in polynomial time. The convexity of the prior function in the energy is shown to be necessary and sufficient for the applicability of the method.Keywords
This publication has 10 references indexed in Scilit:
- Multi-scale feature selection in stereoPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A maximum-flow formulation of the N-camera stereo correspondence problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Segmentation by grouping junctionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast approximate energy minimization via graph cutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Stereo Without Epipolar Lines: A Maximum-Flow FormulationInternational Journal of Computer Vision, 1999
- Dynamic programming for detecting, tracking, and matching deformable contoursPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1995
- Using dynamic programming for solving variational problems in visionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Markov Random Fields and Their ApplicationsPublished by American Mathematical Society (AMS) ,1980
- On the optimal detection of curves in noisy picturesCommunications of the ACM, 1971