Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3942))

Abstract

In this paper, we formulate the image matting as one of solving energy minimization problems. Our approach has the following advantages. First, the matte estimation is modeled using an energy function as a MRF optimization problem. Second, the energy function combines the gradient of the matte, the gradient of the color and statistical sampling together to achieve global optimization. Third, the matte is directly reconstructed by solving energy equations. Experimental results show that our method is efficient to extract high quality mattes for foregrounds with complex natural images.

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 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Berman, A., Vlahos, P., Dadourian, A.: Comprehensive method for removing from an image the background surrounding a selected object. U.S. Patent 6,134,345 (2000)

    Google Scholar 

  2. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)

    Article  Google Scholar 

  3. Corel Corporation. Knockout user guide (2002)

    Google Scholar 

  4. Chuang, Y.-Y., Curless, B., Salesin, D.H., Szeliski, R.: A bayesian approach to digital matting. In: Proceedings of CVPR 2001, vol. II, pp. 264–271 (2001)

    Google Scholar 

  5. Rother, C., Blake, A., Kolmogorov, V.: Grabcut - interactive foreground extraction using iterated graph cuts. In: Proceedings of ACM SIGGRAPH 2004 (2004)

    Google Scholar 

  6. Ruzon, M.A., Tomasi, C.: Alpha estimation in natural images. In: Proceedings of CVPR 2000, pp. 18–25 (2000)

    Google Scholar 

  7. Sun, J., Jia, J., Tang, C.-K., Shum, H.-Y.: Poisson matting. In: Proceedings of ACM SIGGRAPH 2004, pp. 315–321 (2004)

    Google Scholar 

  8. Wang, J., Cohen, M.F.: An Iterative Optimization Approach for Unified Image Segmentation and Matting. In: ICCV 2005, pp. 936–943 (2005)

    Google Scholar 

  9. Weiss, Y., Freeman, W.T.: On the optimality of solutions of the max-product belief propagation algorithm in arebitrary graphs. IEEE Trans. on Information Theory 47(2), 303–308 (2001)

    Article  MathSciNet  Google Scholar 

  10. Wexler, Y., Fitzgibbon, A., Zisserman, A.: Bayesian estimation of layers from multiple images. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2352, pp. 487–501. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Weinman, J., Hanson, A., Mccallum, A.: Sign detection in natural images with conditional random fields. In: Proc. IEEE Workshop on Machine Learning for Signal Processing (September 2004)

    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

Guan, Y., Liang, X., Ding, Z., Fan, Y., Chen, W., Peng, Q. (2006). Energy Matting. In: Pan, Z., Aylett, R., Diener, H., Jin, X., Göbel, S., Li, L. (eds) Technologies for E-Learning and Digital Entertainment. Edutainment 2006. Lecture Notes in Computer Science, vol 3942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11736639_138

Download citation

  • DOI: https://doi.org/10.1007/11736639_138

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-33424-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics