Efficiently solving dynamic Markov random fields using graph cuts
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15505499) , 922-929 Vol. 2
- https://doi.org/10.1109/iccv.2005.81
Abstract
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 labeling problems in computer vision, such as image segmentation. Specifically, given the solution of the max-flow problem on a graph, we show how to efficiently compute the maximum flow in a modified version of the graph. Our experiments showed that the time taken by our algorithm is roughly proportional to the number of edges whose weights were different in the two graphs. We test the performance of our algorithm on one particular problem: the object-background segmentation problem for video and compare it with the best known st-mincut algorithm. The results show that the dynamic graph cut algorithm is much faster than its static counterpart and enables real time image segmentation. It should be noted that our method is generic and can be used to yield similar improvements in many other cases that involve dynamic change in the graphKeywords
This publication has 9 references indexed in Scilit:
- OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up CuesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- An experimental comparison of min-cut/max- flow algorithms for energy minimization in visionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- What energy functions can be minimized via graph cuts?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Exact optimization for markov random fields with convex priorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Markov random fields with efficient approximationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Interactive graph cuts for optimal boundary & region segmentation of objects in N-D imagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fully-dynamic min-cutPublished by Association for Computing Machinery (ACM) ,2001
- Fast approximate energy minimization via graph cutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Dynamic algorithms in computational geometryProceedings of the IEEE, 1992