DocumentCode :
3265073
Title :
Constrained encoding structures for computational complexity scalability in HEVC
Author :
Correa, Guilherme ; Assuncao, Pedro ; da Silva Cruz, Luis A. ; Agostini, Luciano
Author_Institution :
Inst. de Telecomun., Univ. of Coimbra, Coimbra, Portugal
fYear :
2013
fDate :
8-11 Dec. 2013
Firstpage :
297
Lastpage :
300
Abstract :
The High Efficiency Video Coding standard shows improved compression efficiency in comparison to previous standards at the cost of higher computational complexity. In this paper, a complexity scalability method for HEVC encoders based on the dynamic adjustment of the number of constrained coding treeblocks is proposed. The method limits the Prediction Unit shapes and the maximum tree depth used in each Coding Treeblock in order to decrease the number of evaluations performed in the Rate-Distortion Optimization process. The encoder is capable of trading off computational complexity and compression efficiency while still maintaining the encoding time per Group of Pictures (GOP) under a pre-defined target. The encoding complexity can be decreased in up to 60% when compared to the original encoder at the cost of small Bjontegaard Delta (BD)-rate increases.
Keywords :
optimisation; video coding; BD-rate; Bjontegaard Delta; GOP; HEVC encoder; computational complexity scalability; constrained coding treeblock; constrained encoding structure; group of picture; high efficiency video coding standard; prediction unit shape; rate-distortion optimization process; Computational complexity; Encoding; Rate-distortion; Scalability; Shape; Video coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Picture Coding Symposium (PCS), 2013
Conference_Location :
San Jose, CA
Print_ISBN :
978-1-4799-0292-7
Type :
conf
DOI :
10.1109/PCS.2013.6737742
Filename :
6737742
Link To Document :
بازگشت