Skip to main content

Near Real-Time Motion Segmentation Using Graph Cuts

  • Conference paper
Pattern Recognition (DAGM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4174))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  5. Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol. 2134, pp. 359–374. Springer, Heidelberg (2001)

    Chapter  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 

  7. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. on Patt. Anal. and Mach. Intell. 23(11), 1222–1239 (2001)

    Article  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Cremers, D., Soatto, S.: Motion Competition: A Variational Framework for Piecewise Parametric Motion Segmentation. Int. J. of Computer Vision 62(3), 249–265 (2005)

    Article  Google Scholar 

  10. Cremers, D., Yuille, A.L.: A Generative Model Based Approach to Motion Segmentation. In: Michaelis, B., Krell, G. (eds.) DAGM 2003. LNCS, vol. 2781, pp. 313–320. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)

    MATH  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 

  14. Jähne, B., Haußecker, H., Scharr, H., Spies, H., Schmundt, D., Schurr, U.: Study of Dynamical Processes with Tensor-Based Spatiotemporal Image Processing Techniques. In: Burkhardt, H., Neumann, B. (eds.) ECCV 1998. LNCS, vol. 1407, pp. 322–336. Springer, Heidelberg (1998)

    Chapter  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 

  18. Schnörr, C.: Determining optical flow for irregular domains by minimizing quadratic functionals of a certain class. Int. J. of Computer Vision 6(1), 25–38 (1991)

    Article  Google Scholar 

  19. Wang, J., Adelson, E.: Representating moving images with layers. IEEE Trans. on Image Processing 3(5), 625–638 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schoenemann, T., Cremers, D. (2006). Near Real-Time Motion Segmentation Using Graph Cuts. In: Franke, K., Müller, KR., Nickolay, B., Schäfer, R. (eds) Pattern Recognition. DAGM 2006. Lecture Notes in Computer Science, vol 4174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861898_46

Download citation

  • DOI: https://doi.org/10.1007/11861898_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44412-1

  • Online ISBN: 978-3-540-44414-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics