{"title":"Texture based adaptive computational resource allocation for fast AVS3 inter coding","authors":"Jianing Chen","doi":"10.1117/12.2644285","DOIUrl":null,"url":null,"abstract":"The newest Audio Video Coding Standard (AVS3) generation provides better coding efficiency than its predecessor, where two new partitioning structures, i.e., Extend Quad-Tree (EQT) and Binary-Tree (BT), are adopted. Although these split tools bring remarkable coding performance, for the price of increasing of computational coding complexity. For the popular conference video applications, experiments show that the EQT or BT split times in different regions are quite different, which indicates that it is unnecessary to provide all partitioning candidate modes in different area. In this work, an effective partitioning resource allocation method is proposed to reduce computational complexity while guaranteeing the coding performance. Specifically, a Decision Tree (DT) model is trained to determine available partitioning modes for current Coding Unit (CU), where input features are the histogram, sobel texture and average residual difference between current and reference CU, along with the size of CU. The training data are selected from different test sequences of AVS and Joint Video Experts Team Common Test Conditions (JCT) sequences, which are identified by the Structural Similarity (SSIM). The experiments on 720p and Common Intermediate Format (CIF) sequences, implemented on platform of AVS3 reference software HPM-9.1, under Low Delay B (LB) configuration, show the efficiency of the proposed method, which can achieve more than 40.0% computational complexity reduction, and BDBR loss is less than 2.0%.","PeriodicalId":314555,"journal":{"name":"International Conference on Digital Image Processing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Digital Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2644285","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The newest Audio Video Coding Standard (AVS3) generation provides better coding efficiency than its predecessor, where two new partitioning structures, i.e., Extend Quad-Tree (EQT) and Binary-Tree (BT), are adopted. Although these split tools bring remarkable coding performance, for the price of increasing of computational coding complexity. For the popular conference video applications, experiments show that the EQT or BT split times in different regions are quite different, which indicates that it is unnecessary to provide all partitioning candidate modes in different area. In this work, an effective partitioning resource allocation method is proposed to reduce computational complexity while guaranteeing the coding performance. Specifically, a Decision Tree (DT) model is trained to determine available partitioning modes for current Coding Unit (CU), where input features are the histogram, sobel texture and average residual difference between current and reference CU, along with the size of CU. The training data are selected from different test sequences of AVS and Joint Video Experts Team Common Test Conditions (JCT) sequences, which are identified by the Structural Similarity (SSIM). The experiments on 720p and Common Intermediate Format (CIF) sequences, implemented on platform of AVS3 reference software HPM-9.1, under Low Delay B (LB) configuration, show the efficiency of the proposed method, which can achieve more than 40.0% computational complexity reduction, and BDBR loss is less than 2.0%.
最新一代的音频视频编码标准(AVS3)比其前身提供了更好的编码效率,其中采用了扩展四叉树(EQT)和二叉树(BT)两种新的划分结构。虽然这些拆分工具带来了显著的编码性能,但代价是计算编码复杂度的增加。对于流行的会议视频应用,实验表明,不同区域的EQT或BT分割时间差异较大,这表明没有必要在不同区域提供所有的分割候选模式。本文提出了一种有效的资源分区分配方法,在保证编码性能的同时降低了计算复杂度。具体来说,训练决策树(DT)模型来确定当前编码单元(CU)的可用分区模式,其中输入特征是直方图,sobel纹理和当前和参考CU之间的平均残差,以及CU的大小。训练数据从AVS和Joint Video Experts Team Common test Conditions (JCT)序列的不同测试序列中选取,并通过结构相似度(SSIM)进行识别。在AVS3参考软件HPM-9.1平台上对720p和CIF序列进行了低延迟B (Low Delay B, LB)配置的实验,实验结果表明,该方法的计算复杂度降低了40.0%以上,BDBR损失小于2.0%。