CTU Depth Decision Algorithms for HEVC: A Survey
Ekrem Cetinkaya, Hadi Amirpour, Mohammad Ghanbari, and Christian, Timmerer

TL;DR
This survey reviews various algorithms for CTU depth decision in HEVC, categorizing them into statistics and machine learning methods, and discusses their potential extension to newer video coding standards.
Contribution
It provides a comprehensive categorization and analysis of existing CTU depth decision algorithms for HEVC, including traditional and deep learning approaches.
Findings
Statistics methods exploit spatial correlation to reduce complexity.
Machine learning approaches learn features implicitly for better decision-making.
Potential extensions to VVC and AV1 are discussed.
Abstract
High-Efficiency Video Coding (HEVC) surpasses its predecessors in encoding efficiency by introducing new coding tools at the cost of an increased encoding time-complexity. The Coding Tree Unit (CTU) is the main building block used in HEVC. In the HEVC standard, frames are divided into CTUs with the predetermined size of up to 64x64 pixels. Each CTU is then divided recursively into a number of equally sized square areas, known as Coding Units (CUs). Although this diversity of frame partitioning increases encoding efficiency, it also causes an increase in the time complexity due to the increased number of ways to find the optimal partitioning. To address this complexity, numerous algorithms have been proposed to eliminate unnecessary searches during partitioning CTUs by exploiting the correlation in the video. In this paper, existing CTU depth decision algorithms for HEVC are surveyed.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
