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...

Mô tả đầy đủ

Chi tiết về thư mục
Những tác giả chính: Kohli, P, Torr, PHS
Định dạng: Journal article
Ngôn ngữ:English
Được phát hành: IEEE 2007