Texture-based fast QTMT partition algorithm in VVC intra coding

Li, Qiang; Meng, Hua; Li, Ya

doi:10.1007/s11760-022-02367-0

Cited by 6 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Compared to Amna's algorithm [38], our BDBR is 0.67% higher. In comparison to Li's algorithm [39], our average time savings are 3.16% more. Compared to Ni's algorithm [40], our average time savings are 4.49% more.…”

Section: B Coding Performance Comparisonmentioning

confidence: 78%

Fast CU Partitioning Algorithm for VVC Based on CNN and FSVM

Song,

LI,

Zhang

2024

IEEE Access

View full text Add to dashboard Cite

The new coding standard Versatile Video Coding (VVC) introduces additional encoding techniques based on the existing video coding standard, such as the difference in block partition structures. While these new technologies bring about enhanced encoding performance, they also result in a significant increase in encoding time complexity. In the paper, we propose a decision algorithm to partition fast CUs, which is based on CNN networks and FSVM. Initially, the algorithm utilizes depth information formed by combining inter-frame correlations as input to our trained CNN model, predicting the optimal depth for encoding.Following that, the second algorithm based on FSVM is introduced. The F-Score method is employed to extract appropriate features for constructing FSVM. Within the predicted depth range from the initial algorithm, the CU partitioning mode is predicted, leading to an additional reduction in encoding complexity. Our experimental results demonstrate that the proposed algorithm can save 53.55% of encoding time, with a marginal increase of only 1.47% in BDBR.It achieves a favorable balance between video quality and encoding speed.

show abstract

Section: B Coding Performance Comparisonmentioning

confidence: 78%

Fast CU Partitioning Algorithm for VVC Based on CNN and FSVM

Song,

LI,

Zhang

2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…On this basis, unnecessary division modes are skipped. In [19], Li et al use the gradient of the Scharr operator to describe texture information, and use the edge differences of sub blocks to describe structural information. On this basis, they propose a fast algorithm based on texture features.…”

Section: Related Workmentioning

confidence: 99%

A Fast Algorithm for Intra-Frame Versatile Video Coding Based on Edge Features

Zhao

Shang

Wang

et al. 2023

Sensors

View full text Add to dashboard Cite

Versatile Video Coding (VVC) introduces many new coding technologies, such as quadtree with nested multi-type tree (QTMT), which greatly improves the efficiency of VVC coding. However, its computational complexity is higher, which affects the application of VVC in real-time scenarios. Aiming to solve the problem of the high complexity of VVC intra coding, we propose a low-complexity partition algorithm based on edge features. Firstly, the Laplacian of Gaussian (LOG) operator was used to extract the edges in the coding frame, and the edges were divided into vertical and horizontal edges. Then, the coding unit (CU) was equally divided into four sub-blocks in the horizontal and vertical directions to calculate the feature values of the horizontal and vertical edges, respectively. Based on the feature values, we skipped unnecessary partition patterns in advance. Finally, for the CUs without edges, we decided to terminate the partition process according to the depth information of neighboring CUs. The experimental results show that compared with VTM-13.0, the proposed algorithm can save 54.08% of the encoding time on average, and the BDBR (Bjøntegaard delta bit rate) only increases by 1.61%.

show abstract

“…If the texture of the CU is vertical or the vertical gradient is large, then the partition in the vertical direction will be more inclined; on the contrary, if the texture of the CU is horizontal or the horizontal gradient is large, then the partition in the horizontal direction will be more inclined. Therefore, the texture trend T of the division direction here will be calculated by the gradient, and the gradients in different directions will be obtained by the Scharr operator calculation method in [37]. The Scharr operator can be said to be an improvement of the Sobel operator, but the calculation accuracy is higher, and the effect is better.…”

Section: Cu Fast Decision Algorithm Based On Extra Treesmentioning

confidence: 99%

“…where grad hor , grad ver , grad 45 • , and grad 135 • signify the gradient along the horizontal, vertical, 45 texture trend T of the division direction here will be calculated by the gradient, and the gradients in different directions will be obtained by the Scharr operator calculation method in [37]. The Scharr operator can be said to be an improvement of the Sobel operator, but the calculation accuracy is higher, and the effect is better.…”

Section: Cu Fast Decision Algorithm Based On Extra Treesmentioning

confidence: 99%

Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra Trees

Wang,

Zhang

2023

Electronics

View full text Add to dashboard Cite

The new generation of 3D video is an international frontier research hotspot. However, the large amount of data and high complexity are core problems to be solved urgently in 3D video coding. The latest generation of video coding standard versatile video coding (VVC) adopts the quad-tree with nested multi-type tree (QTMT) partition structure, and the coding efficiency is much higher than other coding standards. However, the current research work undertaken for VVC is less for 3D video. In light of this context, we propose a fast coding unit (CU) decision algorithm based on the gray level co-occurrence matrix (GLCM) and Extra trees for the characteristics of the depth map in 3D video. In the first stage, we introduce an edge detection algorithm using GLCM to classify the CU in the depth map into smooth and complex edge blocks based on the extracted features. Subsequently, the extracted features from the CUs, classified as complex edge blocks in the first stage, are fed into the constructed Extra trees model to make a fast decision on the partition type of that CU and avoid calculating unnecessary rate-distortion cost. Experimental results show that the overall algorithm can effectively reduce the coding time by 36.27–51.98%, while the Bjøntegaard delta bit rate (BDBR) is only increased by 0.24% on average which is negligible, all reflecting the superior performance of our method. Moreover, our algorithm can effectively ensure video quality while saving much encoding time compared with other algorithms.

show abstract

Texture-based fast QTMT partition algorithm in VVC intra coding

Cited by 6 publications

References 16 publications

Fast CU Partitioning Algorithm for VVC Based on CNN and FSVM

Fast CU Partitioning Algorithm for VVC Based on CNN and FSVM

A Fast Algorithm for Intra-Frame Versatile Video Coding Based on Edge Features

Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra Trees

Contact Info

Product

Resources

About