Frame-level Complexity Control in H.264 Video Coding
Hasan Fehmi Ates, Y. Altunbasak
Abstract
Hasan Fehmi Ates, Y. Altunbasak
Abstract
H.264 video coding standard supports several interprediction coding modes that use macroblock partitions with variable block sizes. Unfortunately, searching for optimal motion vectors of each possible partition incurs a heavy computational cost. In this paper, we propose a novel frame-level complexity control algorithm that determines for each macroblock which partitions are likely to be optimal. Motion vector search is carried out for only the selected partitions, thus reducing the complexity of the motion estimation step. The mode selection criteria is based on a measure of spatio-temporal activity within the macroblock. For each frame, the procedure guarantees that an execution time budget is met with minimum loss of coding efficiency. Simulation results show that the algorithm speeds up integerpel motion estimation by a factor of up to 40 with less than 0.2 dB loss in coding efficiency.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
H.264 video coding standard supports several interprediction coding modes that use macroblock partitions with variable block sizes. Unfortunately, searching for optimal motion vectors of each possible partition incurs a heavy computational cost. In this paper, we propose a novel frame-level complexity control algorithm that determines for each macroblock which partitions are likely to be optimal. Motion vector search is carried out for only the selected partitions, thus reducing the complexity of the motion estimation step. The mode selection criteria is based on a measure of spatio-temporal activity within the macroblock. For each frame, the procedure guarantees that an execution time budget is met with minimum loss of coding efficiency. Simulation results show that the algorithm speeds up integerpel motion estimation by a factor of up to 40 with less than 0.2 dB loss in coding efficiency.
Key concepts: Macroblock, Coding tree unit, Computer science, Motion vector, Block-matching algorithm, Inter frame, Motion estimation, Coding (social sciences)