JavaScript is disabled for your browser. Some features of this site may not work without it.
Markov Random Fields with Efficient Approximations

Author
Boykov, Yuri; Veksler, Olga; Zabih, Ramin
Abstract
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we address the estimation of first-order MRF's with a particular clique potential that resembles a well. We show that the maximum {\em a posteriori} estimate of such an MRF can be obtained by solving a multiway cut problem on a graph. This allows the application of near linear-time algorithms for computing provably good approximations. We formulate the visual correspondence problem as an MRF in our framework, and show that this yields quite promising results on real data with ground truth.
Date Issued
1997-12Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR97-1658
Type
technical report