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...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Journal article |
| Språk: | English |
| Publicerad: |
IEEE
2007
|