| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 778.18 KB | Adobe PDF |
Orientador(es)
Resumo(s)
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.
Descrição
Palavras-chave
Contexto Educativo
Citação
G. Correa, P. Assuncao, L. A. da Silva Cruz and L. Agostini, "Constrained encoding structures for computational complexity scalability in HEVC," 2013 Picture Coding Symposium (PCS), San Jose, CA, USA, 2013, pp. 297-300, doi: 10.1109/PCS.2013.6737742.
Editora
IEEE Canada
Licença CC
Sem licença CC