2019 IEEE Visual Communications and Image Processing (VCIP) 2019
DOI: 10.1109/vcip47243.2019.8965674
|View full text |Cite
|
Sign up to set email alerts
|

Fast QTMT Partition Decision Algorithm in VVC Intra Coding based on Variance and Gradient

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
54
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 58 publications
(54 citation statements)
references
References 10 publications
0
54
0
Order By: Relevance
“…Table VI shows the coding property of the proposed overall algorithm compared with the latest fast methods. To assess the coding property of the proposed overall scheme, we compare the proposed overall scheme with the latest fast methods of H.266/VVC, including CTTD [26], FPIC [27], CPFD [28] and FCPD [34] method. These are fast and efficient method for H.266/VVC encoder.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Table VI shows the coding property of the proposed overall algorithm compared with the latest fast methods. To assess the coding property of the proposed overall scheme, we compare the proposed overall scheme with the latest fast methods of H.266/VVC, including CTTD [26], FPIC [27], CPFD [28] and FCPD [34] method. These are fast and efficient method for H.266/VVC encoder.…”
Section: Resultsmentioning
confidence: 99%
“…A fast early skip intra coding method in H.266/VVC is introduced in [26], which can skip redundant MTT pruning. A fast intra partition method based on variance and gradient is developed in [27] to settle the rectangular partition issue in H.266/VVC. The basic idea of the method is mainly to use larger CUs and the sub-CUs to predict homogeneous region and complex texture region, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, both Algorithm I and Algorithm II methods can effectively save coding time, and the loss of RD performance is negligible. Table II shows the results of the proposed algorithm compared with two state-of-the-art fast methods including PV-CNN [23], FQPD-VG [24] and RFCTRF [25] method. It can be found that the proposed overall algorithm saves 48.58% coding running time on average, the maximum is 55.93% (ParkScene), and the minimum is 37.14% (BQSquare).…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…Recently, many researchers have studied the characteristics of MTT structure to improve the coding complexity of VVC. A fast method based on variance and gradient is devised in [24] to speed up encoding of VVC. The algorithm first terminates the further division of the smooth area.…”
Section: Related Workmentioning
confidence: 99%
“…where α, β and γ are all adjustable parameters. The initial value of the parameters come from our previous work [25]. We first set β and γ as constants and run the training sequence with different values of αs.…”
Section: B Derivation Of Thresholdsmentioning
confidence: 99%