Entropy-based fast largest coding unit partition algorithm in high-efficiency video coding (Q742762)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Entropy-based fast largest coding unit partition algorithm in high-efficiency video coding |
scientific article; zbMATH DE number 6346160
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Entropy-based fast largest coding unit partition algorithm in high-efficiency video coding |
scientific article; zbMATH DE number 6346160 |
Statements
Entropy-based fast largest coding unit partition algorithm in high-efficiency video coding (English)
0 references
19 September 2014
0 references
Summary: High-efficiency video coding (HEVC) is a new video coding standard being developed by the Joint Collaborative Team on Video Coding. HEVC adopted numerous new tools, such as more flexible data structure representations, which include the coding unit (CU), prediction unit, and transform unit. In the partitioning of the largest coding unit (LCU) into CUs, rate distortion optimization (RDO) is applied. However, the computation complexity of RDO is too high for real-time application scenarios. Based on studies on the relationship between CUs and their entropy, this paper proposes a fast algorithm based on entropy to partition LCU as a substitute for RDO in HEVC. Experimental results show that the proposed entropy-based LCU partition algorithm can reduce coding time by 62.3\% on average, with an acceptable loss of 3.82\% using Bjøntegaard delta rate.
0 references
HEVC
0 references
entropy
0 references
coding unit
0 references
information content
0 references