Interactive Motion Segmentation

  • Claudia Nieuwenhuis
  • Benjamin Berkels
  • Martin Rumpf
  • Daniel Cremers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6376)


Interactive motion segmentation is an important task for scene understanding and analysis. Despite recent progress state-of-the-art approaches still have difficulties in adapting to the diversity of spatially varying motion fields. Due to strong, spatial variations of the motion field, objects are often divided into several parts. At the same time, different objects exhibiting similar motion fields often cannot be distinguished correctly. In this paper, we propose to use spatially varying affine motion model parameter distributions combined with minimal guidance via user drawn scribbles. Hence, adaptation to motion pattern variations and capturing subtle differences between similar regions is feasible. The idea is embedded in a variational minimization problem, which is solved by means of recently proposed convex relaxation techniques. For two regions (i.e. object and background) we obtain globally optimal results for this formulation. For more than two regions the results deviate within very small bounds of about 2 to 4 % from the optimal solution in our experiments. To demonstrate the benefit of using both model parameters and spatially variant distributions, we show results for challenging synthetic and real-world motion fields.


Motion Vector Segmentation Result Motion Field Motion Segmentation Geodesic Active Contour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cremers, D., Soatto, S.: Motion Competition: A variational framework for piecewise parametric motion segmentation. Int. J. of Comp. Vis. 62(3), 249–265 (2005)CrossRefGoogle Scholar
  2. 2.
    Mumford, D., Shah, J.: Optimal approximations by piecewise smooth functions and associated variational problems. Comm. Pure Appl. Math. 42, 577–685 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Vese, L., Chan, T.: A multiphase level set framework for image processing using the Mumford–Shah functional. Int. J. of Comp. Vis. 50(3), 271–293 (2002)zbMATHCrossRefGoogle Scholar
  4. 4.
    Brox, T., Bruhn, A., Weickert, J.: Variational motion segmentation with level sets. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3951, pp. 471–483. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Bai, X., Sapiro, G.: A geodesic framework for fast interactive image and video segmentation and matting. In: Eleventh IEEE International Conference on Computer Vision (ICCV 2007) (2007)Google Scholar
  6. 6.
    Unger, M., Pock, T., Cremers, D., Bischof, H.: TVSeg - Interactive total variation based image segmentation. In: British Machine Vision Conference (BMVC), Leeds, UK (September 2008)Google Scholar
  7. 7.
    Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. of Comp. Vis. 22(1), 61–79 (1997)zbMATHCrossRefGoogle Scholar
  8. 8.
    Rosenblatt, M.: Remarks on some nonparametric estimates of a density function. Annals of Mathematical Statistics 27, 832–837 (1956)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Parzen, E.: On estimation of a probability density function and mode. Annals of Mathematical Statistics 33, 1065–1076 (1962)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Silverman, B.W.: Density estimation for statistics and data analysis. Chapman and Hall, London (1992)Google Scholar
  11. 11.
    Ambrosio, L., Fusco, N., Pallara, D.: Functions of bounded variation and free discontinuity problems. Oxford Mathematical Monographs. Oxford University Press, Oxford (2000)zbMATHGoogle Scholar
  12. 12.
    Pock, T., Chambolle, A., Bischof, H., Cremers, D.: A convex relaxation approach for computing minimal partitions. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Miami, Florida (2009)Google Scholar
  13. 13.
    Pock, T., Cremers, D., Bischof, H., Chambolle, A.: An algorithm for minimizing the piecewise smooth mumford-shah functional. In: IEEE Int. Conf. on Computer Vision, Kyoto, Japan (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Claudia Nieuwenhuis
    • 1
  • Benjamin Berkels
    • 2
  • Martin Rumpf
    • 2
  • Daniel Cremers
    • 1
  1. 1.Technical University of MunichGermany
  2. 2.University of BonnGermany

Personalised recommendations