2005•Unpublished venueRequires access

Macroblock mode decision for H.264

Tran Duc Hai Du

Open publisher page 4 citations

Abstract

A complexity reduction algorithm for an H.264 encoder is proposed. This comes at the cost of the number of increased macroblock modes and the complex mode decision procedure using the rate-distortion optimization [1]. Computational savings are achieved by identifying, prior to motion estimation, macroblocks that are likely to be skipped and hence saving futher computational processing of these macroblocks. This early prediction is made by estimating a Lagrangian rate-distortion cost function. In this paper, we propose a fast mode decision algorithm using mode classification for H.264/AVC. Simulation results show that the proposed algorithm can reduce the encoding time by 29.67% on average and the rate-distortion computation complexity by 89,14% (depending on the source sequence) with no significant loss of rate-distortion performance.

About this research paper

What this paper is about

A complexity reduction algorithm for an H.264 encoder is proposed. This comes at the cost of the number of increased macroblock modes and the complex mode decision procedure using the rate-distortion optimization [1]. Computational savings are achieved by identifying, prior to motion estimation, macroblocks that are likely to be skipped and hence saving futher computational processing of these macroblocks. This early prediction is made by estimating a Lagrangian rate-distortion cost function. In this paper, we propose a fast mode decision algorithm using mode classification for H.264/AVC. Simulation results show that the proposed algorithm can reduce the encoding time by 29.67% on average and the rate-distortion computation complexity by 89,14% (depending on the source sequence) with no significant loss of rate-distortion performance.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A complexity reduction algorithm for an H.264 encoder is proposed. This comes at the cost of the number of increased macroblock modes and the complex mode decision procedure using the rate-distortion optimization [1]. Computational savings are achieved by identifying, prior to motion estimation, macroblocks that are likely to be skipped and hence saving futher computational processing of these macroblocks. This early prediction is made by estimating a Lagrangian rate-distortion cost function. In this paper, we propose a fast mode decision algorithm using mode classification for H.264/AVC. Simulation results show that the proposed algorithm can reduce the encoding time by 29.67% on average and the rate-distortion computation complexity by 89,14% (depending on the source sequence) with no significant loss of rate-distortion performance.

Key concepts: Macroblock, Computer science, Rate–distortion optimization, Rate–distortion theory, Encoder, Computational complexity theory, Encoding (memory), Distortion (music)

Related papers

Back to paper searchBrowse research topicsOriginal source
Macroblock mode decision for H.264 — Research Paper | ScholarLens