Square-type-first inter-CU tree search algorithm for acceleration of HEVC encoder

In this paper, a fast inter-coding algorithm is proposed to reduce the computational load of HEVC encoders. The HEVC reference model (HM) employs the recursive depth-first-search (DFS) of the quad-tree search in terms of rate-distortion optimization in selecting the best coding modes for the best CU...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of real-time image processing Jg. 12; H. 2; S. 419 - 432
Hauptverfasser: Ahn, Yong-Jo, Sim, Donggyu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2016
Springer Nature B.V
Schlagworte:
Algorithms
Coders
Coding
Coding standards
Computer Graphics
Computer Science
Costs
Image Processing and Computer Vision
Multimedia Information Systems
Pattern Recognition
Search algorithms
Signal,Image and Speech Processing
Special Issue Paper
Video compression
Inter-CU decision
Square-type mode
Fast encoding algorithm
Video encoder
Index HEVC
ISSN:1861-8200, 1861-8219
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, a fast inter-coding algorithm is proposed to reduce the computational load of HEVC encoders. The HEVC reference model (HM) employs the recursive depth-first-search (DFS) of the quad-tree search in terms of rate-distortion optimization in selecting the best coding modes for the best CU, PU, TU partitions, and many associated coding modes. The proposed algorithm evaluates the RD costs of the current CU only for its square-type PUs in the top-down search of the DFS. When the CU partition with the square-type PU is better than its sub-level CU partitions in terms of RD cost in bottom-up search of the DFS, the square type of current CU partition, along with its coding mode, is selected as the best partition. Otherwise, non-square-type PUs for the current CU level are evaluated. If the sub-partition is better than the CU with the non-square PUs, the sub-partition is finally selected as the optimum PU. Otherwise, the best non-square PU is selected as the best PU for the current level. Experimental results demonstrate that the proposed square-type-first inter-PU search can reduce the computational load in average encoding time by 66.7 % with 1–2 % BD loss over HM reference software. In addition, the proposed algorithm can yield an additional average time saving of 26.8–35.5 % against the three fast encoding algorithms adopted in HM.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1861-8200
1861-8219
DOI:10.1007/s11554-015-0487-5