2006•Unpublished venueRequires access

A scalable fast mode decision algorithm for H.264

Zhiping Lin, Hongtao Yu, Feng Pan

Open publisher page 11 citations

Abstract

This paper presents a scalable fast mode decision algorithm to effectively choose the best coding mode among the 7 macroblock (MB) coding modes that could be used in H.264 video coding. The spatial and temporal complexity of the MB is analyzed to determine the order of searching in the mode decision priority queue such that the most probable mode is checked first, followed by the second most probable mode, and so on. This process is terminated as soon as the computed rate-distortion (RD) cost is below a threshold which is dependent on the complexity ratio of the current MB. By adjusting the threshold we can choose a preferred tradeoff between timesaving and quality compromise. Experimental results show that the proposed fast mode decision algorithm can drastically reduce the encoding time up to 50% with negligible loss of coding efficiency.

About this research paper

What this paper is about

This paper presents a scalable fast mode decision algorithm to effectively choose the best coding mode among the 7 macroblock (MB) coding modes that could be used in H.264 video coding. The spatial and temporal complexity of the MB is analyzed to determine the order of searching in the mode decision priority queue such that the most probable mode is checked first, followed by the second most probable mode, and so on. This process is terminated as soon as the computed rate-distortion (RD) cost is below a threshold which is dependent on the complexity ratio of the current MB. By adjusting the threshold we can choose a preferred tradeoff between timesaving and quality compromise. Experimental results show that the proposed fast mode decision algorithm can drastically reduce the encoding time up to 50% with negligible loss of coding efficiency.

Why it matters

OpenAlex reports 11 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

This paper presents a scalable fast mode decision algorithm to effectively choose the best coding mode among the 7 macroblock (MB) coding modes that could be used in H.264 video coding. The spatial and temporal complexity of the MB is analyzed to determine the order of searching in the mode decision priority queue such that the most probable mode is checked first, followed by the second most probable mode, and so on. This process is terminated as soon as the computed rate-distortion (RD) cost is below a threshold which is dependent on the complexity ratio of the current MB. By adjusting the threshold we can choose a preferred tradeoff between timesaving and quality compromise. Experimental results show that the proposed fast mode decision algorithm can drastically reduce the encoding time up to 50% with negligible loss of coding efficiency.

Key concepts: Macroblock, Computer science, Coding (social sciences), Scalability, Algorithm, Algorithmic efficiency, Computational complexity theory, Queue

Related papers

Back to paper searchBrowse research topicsOriginal source
A scalable fast mode decision algorithm for H.264 — Research Paper | ScholarLens