Revisiting uncertainty in graph cut solutions

@article{Tarlow2012RevisitingUI,
  title={Revisiting uncertainty in graph cut solutions},
  author={Daniel Tarlow and Ryan P. Adams},
  journal={2012 IEEE Conference on Computer Vision and Pattern Recognition},
  year={2012},
  pages={2440-2447}
}
Graph cuts is a popular algorithm for finding the MAP assignment of many large-scale graphical models that are common in computer vision. While graph cuts is powerful, it does not provide information about the marginal probabilities associated with the solution it finds. To assess uncertainty, we are forced to fall back on less efficient and inexact inference algorithms such as loopy belief propagation, or use less principled surrogate representations of uncertainty such as the min-marginal… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 citations