Near Real-Time Motion Segmentation Using Graph Cuts
We present a new approach to integrated motion estimation and segmentation by combining methods from discrete and continuous optimization. The velocity of each of a set of regions is modeled as a Gaussian-distributed random variable and motion models and segmentation are obtained by alternated maximization of a Bayesian a-posteriori probability. We show that for fixed segmentation the model parameters are given by a closed-form solution. Given the velocities, the segmentation is in turn determined using graph cuts which allows a globally optimal solution in the case of two regions. Consequently, there is no contour evolution based on differential increments as for example in level set methods. Experimental results on synthetic and real data show that good segmentations are obtained at speeds close to real-time.
KeywordsComputer Vision Motion Estimation Motion Segmentation Optimal Segmentation Segmentation Boundary
Unable to display preview. Download preview PDF.
- 1.Amiaz, T., Kiryati, N.: Dense discontinuous optical flow via contour-based segmentation. In: Int. Conf. on Image Processing, Genova, Italy, vol. 3, pp. 1264–1267 (September 2005)Google Scholar
- 2.Birchfield, S., Tomasi, C.: Multiway cut for stereo and motion with slanted surfaces. In: IEEE Int. Conf. on Computer Vision, pp. 489–495 (1999)Google Scholar
- 3.Black, M., Jepson, A.: Eigentracking: Robust matching and tracking of articulated objects using a view-based representation. In: Europ. Conf. on Computer Vision, Cambridge, England. LNCS, pp. 329–342. Springer, Heidelberg (1996)Google Scholar
- 4.Boykov, Y., Jolly, M.-P.: Interactive graph cuts for optimal boundary & region segmentation of objects in n-d images. In: IEEE Int. Conf. on Computer Vision, vol. 1, pp. 105–112 (2001)Google Scholar
- 6.Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: IEEE Int. Conf. on Computer Vision (2003)Google Scholar
- 12.Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. Roy. Statist. Soc. Ser. B. 51(2), 271–279 (1989)Google Scholar
- 13.Horn, B., Schunck, B.: Determining optical flow. A.I. 17, 185–203 (1981)Google Scholar
- 15.Juan, O.: On Some Extensions of Level Sets and Graph Cuts & Their Applications to Image and Video Segmentation. PhD thesis, École Nationale des Ponts et Chaussées (May 2006)Google Scholar
- 16.Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. on Patt. Anal. and Mach. Intell. 24(5), 657–673 (2004)Google Scholar
- 17.Lucas, B.D., Kanade, T.: An iterative image registration technique with an application to stereo vision. In: Proc. 7th International Joint Conference on Artificial Intelligence, Vancouver, pp. 674–679 (1981)Google Scholar