Efficiently solving dynamic Markov random fields using graph cuts
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision