基于统计分布的HEVC编码预测单元深度选择

Xue Li, Xiaoyun Zhang, Yunyu Shi, Zhiyong Gao
{"title":"基于统计分布的HEVC编码预测单元深度选择","authors":"Xue Li, Xiaoyun Zhang, Yunyu Shi, Zhiyong Gao","doi":"10.1109/ICMEW.2014.6890719","DOIUrl":null,"url":null,"abstract":"The new video coding standard, HEVC, achieves better compression performance relative to H.264 at the expense of a significant increase in computational complexity. It adopts coding tree structure, and implements partition and mode decision for each coding unit (CU) and prediction unit (PU). For intra coding, five levels of PUs from 64×64 to 4×4 should be searched and each PU selects one best mode from 35 candidate modes, which is very computation intensive. Therefore, reducing the number of levels for PUs, i.e., PU depth selection, is an efficient way to decrease intra coding complexity. In this paper, we fully investigate the relationship between the variances of different sizes of pixel blocks and the best partition of PUs. It is shown that 90th percentile of the variances distribution can be used to distinguish large PUs and small PUs. Furthermore, 16×16 PU search can be disabled for smooth area when variances of 64×64 pixel blocks are smaller than the 90th percentile of variances distribution of 64×64 PUs and this 90th percentile is smaller than an absolute threshold. Meanwhile, further split can be disabled if the variance of the current PU is smaller than 70th percentile of the variances of its parent-level PUs when the current PU is 16×16 or 8×8. The experimental results show that the proposed algorithm can reduce 55% encoding time of reference encoder HM10.0 at all Intra setting on average with negligible coding performance loss less than 1.22% BD-Rate for HD or Ultra-HD videos.","PeriodicalId":178700,"journal":{"name":"2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Prediction unit depth selection based on statistic distribution for HEVC intra coding\",\"authors\":\"Xue Li, Xiaoyun Zhang, Yunyu Shi, Zhiyong Gao\",\"doi\":\"10.1109/ICMEW.2014.6890719\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The new video coding standard, HEVC, achieves better compression performance relative to H.264 at the expense of a significant increase in computational complexity. It adopts coding tree structure, and implements partition and mode decision for each coding unit (CU) and prediction unit (PU). For intra coding, five levels of PUs from 64×64 to 4×4 should be searched and each PU selects one best mode from 35 candidate modes, which is very computation intensive. Therefore, reducing the number of levels for PUs, i.e., PU depth selection, is an efficient way to decrease intra coding complexity. In this paper, we fully investigate the relationship between the variances of different sizes of pixel blocks and the best partition of PUs. It is shown that 90th percentile of the variances distribution can be used to distinguish large PUs and small PUs. Furthermore, 16×16 PU search can be disabled for smooth area when variances of 64×64 pixel blocks are smaller than the 90th percentile of variances distribution of 64×64 PUs and this 90th percentile is smaller than an absolute threshold. Meanwhile, further split can be disabled if the variance of the current PU is smaller than 70th percentile of the variances of its parent-level PUs when the current PU is 16×16 or 8×8. The experimental results show that the proposed algorithm can reduce 55% encoding time of reference encoder HM10.0 at all Intra setting on average with negligible coding performance loss less than 1.22% BD-Rate for HD or Ultra-HD videos.\",\"PeriodicalId\":178700,\"journal\":{\"name\":\"2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMEW.2014.6890719\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMEW.2014.6890719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

新的视频编码标准HEVC相对于H.264实现了更好的压缩性能,但代价是计算复杂度的显著增加。该算法采用编码树结构,对每个编码单元(CU)和预测单元(PU)进行划分和模式判定。对于内部编码,需要搜索从64×64到4×4的5层PU,每个PU从35种候选模式中选择一种最佳模式,计算量非常大。因此,减少PU的层数,即PU深度选择,是降低帧内编码复杂度的有效方法。在本文中,我们充分研究了不同尺寸像素块的方差与pu的最佳划分之间的关系。结果表明,方差分布的第90百分位可以用来区分大pu和小pu。此外,当64×64像素块的方差小于64×64 PU方差分布的第90个百分位数且该第90个百分位数小于绝对阈值时,可以禁止对平滑区域的16×16 PU搜索。同时,当当前PU为16×16或8×8时,如果当前PU的方差小于其父级PU方差的70百分位数,则可以禁止进一步分割。实验结果表明,在所有Intra设置下,该算法平均可将参考编码器HM10.0的编码时间缩短55%,且对高清或超高清视频的编码性能损失小于1.22%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Prediction unit depth selection based on statistic distribution for HEVC intra coding
The new video coding standard, HEVC, achieves better compression performance relative to H.264 at the expense of a significant increase in computational complexity. It adopts coding tree structure, and implements partition and mode decision for each coding unit (CU) and prediction unit (PU). For intra coding, five levels of PUs from 64×64 to 4×4 should be searched and each PU selects one best mode from 35 candidate modes, which is very computation intensive. Therefore, reducing the number of levels for PUs, i.e., PU depth selection, is an efficient way to decrease intra coding complexity. In this paper, we fully investigate the relationship between the variances of different sizes of pixel blocks and the best partition of PUs. It is shown that 90th percentile of the variances distribution can be used to distinguish large PUs and small PUs. Furthermore, 16×16 PU search can be disabled for smooth area when variances of 64×64 pixel blocks are smaller than the 90th percentile of variances distribution of 64×64 PUs and this 90th percentile is smaller than an absolute threshold. Meanwhile, further split can be disabled if the variance of the current PU is smaller than 70th percentile of the variances of its parent-level PUs when the current PU is 16×16 or 8×8. The experimental results show that the proposed algorithm can reduce 55% encoding time of reference encoder HM10.0 at all Intra setting on average with negligible coding performance loss less than 1.22% BD-Rate for HD or Ultra-HD videos.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信