首页> 外文期刊>Multimedia Tools and Applications >A fast algorithm of intra prediction modes pruning for HEVC based on decision trees and a new three-step search
【24h】

A fast algorithm of intra prediction modes pruning for HEVC based on decision trees and a new three-step search

机译:基于决策树和新三步搜索的HEVC帧内预测模式修剪快速算法

获取原文
获取原文并翻译 | 示例

摘要

The High Efficiency Video Coding (HEVC) standard is a new generation video coding scheme, succeeding to H.264/AVC. HEVC requires only 50 % bitrate of H.264/AVC at the same perceptual quality by adopting new coding tools and more flexible block structures. HEVC specifies 35 different intra prediction directions that can be associated to different block sizes. Each possible combination needs to be tested within the Rate Distortion (RD) process to enable selecting the optimal intra mode and block splitting depth. This leads to a significant processing weight and therefore any improvement that might be achieved will bring significative increase in the computational efficiency of the algorithm. This paper proposes a novel intra prediction modes pruning method based on decision trees and a new three-step search algorithm, aiming at achieving higher encoding efficiency compared to the standard-HEVC. This fast algorithm is composed of two algorithms. The first algorithm is a modes pruning algorithm depending on decision trees. We first calculate variances of the above side, the left side and all the reference samples of all the PUs (Prediction Units), which are used to divide the PUs into three groups of different candidate intra prediction modes. The first group only includes Planar mode and DC mode, the optimal mode will be selected from the two modes. The second and third groups include 19 and 35 intra modes, respectively. Then the decision trees are trained using the information obtained previously by the software WEKA. The classification process has an accuracy of 85.29 %. The second algorithm is a three-step search algorithm which is defined to be suitable for prediction units classified into class two and class three after the execution of decision trees. The detailed implementations of three-step search algorithms for prediction units belong to those two classes are subtly different. Experimental results verify that, compared with the reference software HM15.0, on average, the proposed algorithm reduces the encoding time by 37.87 % with a slightly decreasing of BD-PSNR (0.058 dB) and increasing of BD-Rate (1.19 %).
机译:高效视频编码(HEVC)标准是继H.264 / AVC之后的新一代视频编码方案。通过采用新的编码工具和更灵活的块结构,HEVC在相同的感知质量下仅需要H.264 / AVC的50%比特率。 HEVC指定可以与不同块大小相关联的35个不同的帧内预测方向。每种可能的组合都需要在速率失真(RD)流程中进行测试,以选择最佳的帧内模式和块分割深度。这导致相当大的处理权重,因此可能实现的任何改进都会带来算法的计算效率的显着提高。提出了一种基于决策树和新的三步搜索算法的帧内预测模式修剪方法,旨在实现比标准HEVC更高的编码效率。这种快速算法由两种算法组成。第一种算法是取决于决策树的模式修剪算法。我们首先计算所有PU(预测单元)的上方,左侧和所有参考样本的方差,这些方差用于将PU分为三组不同的候选帧内预测模式。第一组仅包括平面模式和直流模式,最佳模式将从这两种模式中选择。第二和第三组分别包括19和35帧内模式。然后,使用先前由软件WEKA获得的信息来训练决策树。分类过程的准确度为85.29%。第二种算法是三步搜索算法,定义为适用于在执行决策树后分类为第二类和第三类的预测单元。属于这两类的预测单元的三步搜索算法的详细实现有细微的不同。实验结果证明,与参考软件HM15.0相比,该算法平均减少了37.87%的编码时间,而BD-PSNR(0.058 dB)略有减少,而BD-Rate(1.19%)有所增加。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号