基于梯度方向的VVC帧内编码中CU划分早终止算法研究与实现资源-CSDN文库

34 浏览量 2025-01-02 20:08:51 上传评论收藏 806KB PDF 举报

资源推荐

资源详情

资源评论

Gradient-based Early Termination of CU Partition in VVC

Intra Coding

Jing Cui

∗

, Tao Zhang

‡

, Chenchen Gu

‡

, Xinfeng Zhang

†

, and Siwei Ma

∗

∗

Institute of Digital Media

†

School of CS and Technolgy

‡

Wechat Business Group

Peking University UCAS Tencent

Beijing, 100871, China Beijing, 100049, China Shenzhen, China

jingcui106,swma@pku.edu.cn xfzhang@ucas.ac.cn toneyzhang,cicelygu@tencent.com

Abstract

The quaternary tree with nested binary and ternary tree structure is an eﬃcient coding

unit (CU) partitioning method adopted in Versatile Video Coding (VVC). Compared with

quaternary tree only in HEVC, its ﬂexible block sizes improve the coding performance sig-

niﬁcantly at the cost of computation load increase due to the recursive and nested searching

for the best CU structure. In this paper, an early termination algorithm is proposed to skip

unnecessary searches in CU size decision. Based on directional gradients, pre-determine the

likelihood of binary partition or ternary partition in horizontal or vertical direction for cur-

rent block, thus the impertinent partition pattern can be skipped. The experimental results

show that the proposed method is able to save the encoding time up to 51% with about

1.2% BD-rate degradation on average compared with VVC software reference VTM5.0.

Introduction

Along with the growing demands on the high resolution videos, exploring next gen-

eration video coding standard with higher performance is becoming very imperative.

VVC [1] is the newest standard developed by Joint Video Experts Team (JVET)

which is a partnership of ITU-T Study Group known as VCEG and ISO/IEC JTC

1/SC 29/WG 11 known as MPEG. VVC oﬃcially starts standardization from April

2018, but its pre-research began earlier with platform called JVET test model (JEM)

which aims to evaluate the potential of the explored coding tools. Although VVC is

still under development, its software reference VVC test model (VTM) [2] has already

achieved up to over 30% BD-rate saving compared with HEVC [3]. The higher coding

performance beneﬁts from more elaborate algorithm designs in each module, such as

CU partitioning, intra modes, motion compensation, transform as well as dependent

quantization [1]. However, VVC acquires the superior BD-rate performance at the

expense of time cost. The encoding time increases almost 10 times compared with

HEVC and there are almost 2 times decoding time rise. Reducing complexity is es-

sential step to promote new standard and optimizing CU size decision algorithm is

one of promising orientations to minimizing the computation loads. Diﬀerent from

HEVC, non-square blocks are allowed in block partition, since VVC adopts not only

quaternary tree but also binary tree and ternary tree structure. Therefore, the CU

partition is more complicated on account of additional searches in mode decision loop

which increases the encoding time extraordinarily.

Plenty of works to early terminate and prune CU partition were proposed to op-

timize the CU size decision in intra coding. Cho et.al.’s work [4] proposed a fast

103

2020 Data Compression Conference (DCC)

2375-0359/20/$31.00 ©2020 IEEE

DOI 10.1109/DCC47342.2020.00018

Authorized licensed use limited to: Auckland University of Technology. Downloaded on June 08,2020 at 05:02:04 UTC from IEEE Xplore. Restrictions apply.

本内容试读结束，登录后可阅读更多

下载后可阅读完整内容，剩余9页未读，立即下载

内容反馈

码流怪侠

粉丝: 2w+
资源: 374

最新资源

资源上传下载、课程学习等过程中有任何疑问或建议，欢迎提出宝贵意见哦~我们会及时处理！点击此处反馈

feedback-tip