Coding-gain-based complexity control for H.264 video encoder

Ming Chen Chien, Zong Yi Chen, Pao Chi Chang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and so are associated with different computational complexities if no complexity control is utilized. Variation in computational complexity leads to encoding delay jittering. Typically motion estimation (ME) consumes much more computational complexity than other encoding tools. This work proposes a practical complexity control method based on the complexity analysis of an H.264 video encoder to determine the coding gain of each encoding tool in the video encoder. Experiments performed on a programming optimized source code show that the computational complexity associated with each frame is well controlled below a given limit with very little R-D performance degradation under a reasonable constraint comparing to the unconstrained case.

Original languageEnglish
Title of host publication2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings
Pages2136-2139
Number of pages4
DOIs
StatePublished - 2008
Event2008 IEEE International Conference on Image Processing, ICIP 2008 - San Diego, CA, United States
Duration: 12 Oct 200815 Oct 2008

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Conference

Conference2008 IEEE International Conference on Image Processing, ICIP 2008
Country/TerritoryUnited States
CitySan Diego, CA
Period12/10/0815/10/08

Keywords

  • Complexity allocation
  • Complexity control
  • H.264
  • Video encoder

Fingerprint

Dive into the research topics of 'Coding-gain-based complexity control for H.264 video encoder'. Together they form a unique fingerprint.

Cite this