CU partitioning algorithm based on texture complexity in VVC

Versatile Video Coding (VVC) uses Quadtree nested multi-type tree (QTMT) for CU partitioning. Compared with the previous generation coding standard High Efficiency Video Coding (HEVC), it can save about 50% of the bit rate while ensuring the same video quality, but the coding time is greatly increased. In order to solve the problem of high time complexity of Coding Unit (CU) partitioning in VVC, this paper proposes a CU partitioning method based on image texture complexity. This method analyzes the texture of CU and calculates relevant statistics to judge the texture complexity, and then determines the CU partitioning strategy. Experimental results show that the proposed method can reduce the video coding time with little loss of video quality, and has good coding efficiency. Compared with the reference software VTM22.2, the coding time is reduced by 15.44% and the BDBR is increased by 1.94%.

Authors

Institutions

Publication Details

Published
2024-11-22
DOI
https://doi.org/10.1145/3708568.3708585
Primary Topic
Video Coding and Compression Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CU partitioning algorithm based on texture complexity in VVC

Qi Cen, Tian Song, Jin Liu, X. Jiang et al.
Video Coding and Compression Technologies
article

CU partitioning algorithm based on texture complexity in VVC

Qi Cen, Tian Song, Jin Liu, X. Jiang, Zihao Wu
article en

Abstract

Versatile Video Coding (VVC) uses Quadtree nested multi-type tree (QTMT) for CU partitioning. Compared with the previous generation coding standard High Efficiency Video Coding (HEVC), it can save about 50% of the bit rate while ensuring the same video quality, but the coding time is greatly increased. In order to solve the problem of high time complexity of Coding Unit (CU) partitioning in VVC, this paper proposes a CU partitioning method based on image texture complexity. This method analyzes the texture of CU and calculates relevant statistics to judge the texture complexity, and then determines the CU partitioning strategy. Experimental results show that the proposed method can reduce the video coding time with little loss of video quality, and has good coding efficiency. Compared with the reference software VTM22.2, the coding time is reduced by 15.44% and the BDBR is increased by 1.94%.

Ningbo Entry-Exit Inspection And Quarantine Bureau (CN), Tokushima University (JP), Shanghai Maritime University (CN)
Openalex Percentile: Top 69%
Video Coding and Compression Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

CU partitioning algorithm based on texture complexity in VVC — Qi Cen, Tian Song, et al. · (2024) | TGRS Research Map | TGRS