Efficiently solving dynamic Markov random fields using graph cuts
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 estimates for dynamically changing MRF models of labelling problems in computer vision, such as image segmentation. Specifically, given th...
| Автори: | , |
|---|---|
| Формат: | Conference item |
| Мова: | English |
| Опубліковано: |
IEEE
2005
|