Dynamic graph cuts for efficient inference in Markov random fields

In this paper, we present a fast new fully dynamic algorithm for the st-mincut/max-flow problem. We show how this algorithm can be used to efficiently compute MAP solutions for certain dynamically changing MRF models in computer vision such as image segmentation. Specifically, given the solution of...

Celý popis

Podrobná bibliografie
Hlavní autoři: Kohli, P, Torr, PHS
Médium: Journal article
Jazyk:English
Vydáno: IEEE 2007