Skip to main content

Pruned Mode Decision based on Variable Block Sizes Motion Compensation for H.264

  • Conference paper
Interactive Multimedia on Next Generation Networks (MIPS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2899))

Included in the following conference series:

Abstract

H.264 is the newest international video coding standard that provides high coding efficiency. It employs motion compensation with blocks of variable sizes from 16x16 to 4x4. To determine the best macroblock mode, a rate-distortion optimization method is implemented in the H.264 joint model. This method is the one of the main factors that increase coding efficiency and at the same time, the computational complexity. The proposed pruned mode decision method not only reduces computational complexity but also keeps up coding efficiency. The experimental results show that the proposed pruned mode decision method provides as much as 75% reduction in computational complexity without any noticeable coding loss.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG: Draft ITU-T Recommendation and Final Draft International Standard of Joint Video Specification (ITU-T Rec. H.264 | ISO/IEC 14496-10 AVC), Doc. #JVT-G050r1 (2003)

    Google Scholar 

  2. Blanch, C., Denolf, K.: Memory Complexity Analysis of the AVC Codec JM1.7, ISO/IEC JTC1/SC29/WG11, Doc. #MPEG02/M8378 (2002)

    Google Scholar 

  3. Sullivan, G., Wiegand, T.: Rate-Distortion Optimization for Video Compression. IEEE Signal Proc. Magazine 15, 74–90 (1998)

    Article  Google Scholar 

  4. Zhou, M.: Evaluation and Simplification of H.26L Baseline Coding Tools. ITU-T Q.6/16, Doc. #JVT-B030 (2002)

    Google Scholar 

  5. Takagi, K., Takishima, Y., Nakajima, Y.: A Study on Rate Distortion Optimization Scheme for JVT Coder. In: Proc. of VCIP, pp. 914–923 (2003)

    Google Scholar 

  6. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, pp. 20–51. Wiley- Interscience Publication, Chichester (2001)

    MATH  Google Scholar 

  7. Bjontegaard, G.: Calculation of Average PSNR Differences between RD-curves. ITU-T Q.6/16, Doc. #VCEG-M33 (2001)

    Google Scholar 

  8. Sullivan, G., Bjontegaard, G.: Recommended Simulation Common Conditions for H.26L Coding Efficiency Experiments on Low-Resolution Progressive-scan Source Material. ITU-T Q.6/16, Doc. #VCEG-N81 (2001)

    Google Scholar 

  9. http://bs.hhi.de/~suehring/tml/download/jm61d.zip

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, J., Jeon, B. (2003). Pruned Mode Decision based on Variable Block Sizes Motion Compensation for H.264. In: Ventre, G., Canonico, R. (eds) Interactive Multimedia on Next Generation Networks. MIPS 2003. Lecture Notes in Computer Science, vol 2899. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40012-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40012-7_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20534-0

  • Online ISBN: 978-3-540-40012-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics