2016
DOI: 10.1109/tmm.2016.2579505
|View full text |Cite
|
Sign up to set email alerts
|

Inter-Prediction Optimizations for Video Coding Using Adaptive Coding Unit Visiting Order

Abstract: The flexible partitioning scheme and increased number of prediction modes in the High Efficiency Video Coding (HEVC) standard are largely responsible for both its high compression efficiency and computational complexity. In typical HEVC encoder implementations, Coding Units (CUs) in a Coding Tree Unit (CTU) are visited from top to bottom at each level of recursion to select the optimal coding configuration. In this paper, a novel approach is presented in which CUs in a CTU can be adaptively visited also in a r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 29 publications
(16 citation statements)
references
References 23 publications
0
16
0
Order By: Relevance
“…Algorithms in this class aim to speedup ME by reducing the search window size, i.e., the number of search points by dynamically adjusting the size of the search window. [27].…”
Section: (2) Search Window Decision Algorithmsmentioning
confidence: 99%
“…Algorithms in this class aim to speedup ME by reducing the search window size, i.e., the number of search points by dynamically adjusting the size of the search window. [27].…”
Section: (2) Search Window Decision Algorithmsmentioning
confidence: 99%
“…In both tables, the average performance for each class of sequence and all sequences is calculated respectively. The comparative algorithms contain the multiple SVM classifier (MSVM) based algorithm [18], adaptive ordering of modes (AOM) based algorithm [9], adaptive visiting order (AVO) based algorithm [10], binary and multi-class learning (BML) based algorithm [23] and fuzzy SVM (FSVM) based algorithm [24]. In terms of average performance for each class in Table 5, the class E achieves the largest time saving for most of the algorithms.…”
Section: A Objective Evaluationmentioning
confidence: 99%
“…Traditionally CTU is visited from top to bottom at each level of recursion to select the best depth. But a conversely bottom to top visiting order for CTU partition is proposed in [10] where the coding information acquired from the small CU is used to reduce testing options in the large CU. Specially in [11], targeting the TU coding, a fast TU split algorithm based on the Bayesian decision rule by employing the correlations between current TU and its adjacent TUs is proposed.…”
Section: Introductionmentioning
confidence: 99%
“…In [9] the decision trees generated by data mining tools were utilised to predict the size of HEVC blocks. Furthermore, a method was proposed to limit the number of block sizes to test in HEVC based on exploiting the size of neighbouring blocks [10]. Similarly, a method to select the optimal motion vector precision was proposed [11], based on These methods were proposed in the context of different codecs and may not be applicable to apply directly to the AV1 coding structure.…”
Section: State Of the Artmentioning
confidence: 99%