基于HEVC快速内部编码的CTU深度范围预测

Zeqi Feng, Pengyu Liu, Ke-bin Jia, Kun Duan
{"title":"基于HEVC快速内部编码的CTU深度范围预测","authors":"Zeqi Feng, Pengyu Liu, Ke-bin Jia, Kun Duan","doi":"10.1109/ICIVC.2018.8492898","DOIUrl":null,"url":null,"abstract":"Coding tree unit (CTU) partition technique provides excellent compression performance for HEVC at the expense of increased coding complexity. Therefore, a fast intra coding algorithm based CTU depth range prediction is proposed to reduce the complexity of HEVC intra coding herein. First, simple CTU s and complex CTU s are defined in line with their texture complexity, which are limited to different depth ranges. Then, the convolutional neural network architecture for HEVC intra depth range (HIDR-CNN) decision-making is proposed. It is used for CTU classification and depth range restriction. Last, the optimal CTU partition is achieved by recursive rate distortion (RD) cost calculation in the depth range. Experimental results show that the proposed algorithm can achieve average 27.54% encoding time reduction with negligible RD loss compared with HM 16.9. The proposed algorithm devotes to promote popularization of HEVC in realtime environments.","PeriodicalId":173981,"journal":{"name":"2018 IEEE 3rd International Conference on Image, Vision and Computing (ICIVC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"HEVC Fast Intra Coding Based CTU Depth Range Prediction\",\"authors\":\"Zeqi Feng, Pengyu Liu, Ke-bin Jia, Kun Duan\",\"doi\":\"10.1109/ICIVC.2018.8492898\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coding tree unit (CTU) partition technique provides excellent compression performance for HEVC at the expense of increased coding complexity. Therefore, a fast intra coding algorithm based CTU depth range prediction is proposed to reduce the complexity of HEVC intra coding herein. First, simple CTU s and complex CTU s are defined in line with their texture complexity, which are limited to different depth ranges. Then, the convolutional neural network architecture for HEVC intra depth range (HIDR-CNN) decision-making is proposed. It is used for CTU classification and depth range restriction. Last, the optimal CTU partition is achieved by recursive rate distortion (RD) cost calculation in the depth range. Experimental results show that the proposed algorithm can achieve average 27.54% encoding time reduction with negligible RD loss compared with HM 16.9. The proposed algorithm devotes to promote popularization of HEVC in realtime environments.\",\"PeriodicalId\":173981,\"journal\":{\"name\":\"2018 IEEE 3rd International Conference on Image, Vision and Computing (ICIVC)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 3rd International Conference on Image, Vision and Computing (ICIVC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIVC.2018.8492898\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 3rd International Conference on Image, Vision and Computing (ICIVC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIVC.2018.8492898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

编码树单元(CTU)分割技术为HEVC提供了良好的压缩性能,但代价是增加了编码复杂度。为此,本文提出了一种基于CTU深度范围预测的快速帧内编码算法,以降低HEVC帧内编码的复杂度。首先,根据纹理复杂度定义简单CTU和复杂CTU,限制在不同的深度范围内。然后,提出了用于HEVC深度范围内(HIDR-CNN)决策的卷积神经网络架构。它用于CTU分类和深度范围限制。最后,在深度范围内通过递归率失真(RD)代价计算得到最优的CTU分区。实验结果表明,与传统算法相比,该算法平均可减少27.54%的编码时间,RD损失可忽略不计。该算法致力于促进HEVC在实时环境中的普及。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
HEVC Fast Intra Coding Based CTU Depth Range Prediction
Coding tree unit (CTU) partition technique provides excellent compression performance for HEVC at the expense of increased coding complexity. Therefore, a fast intra coding algorithm based CTU depth range prediction is proposed to reduce the complexity of HEVC intra coding herein. First, simple CTU s and complex CTU s are defined in line with their texture complexity, which are limited to different depth ranges. Then, the convolutional neural network architecture for HEVC intra depth range (HIDR-CNN) decision-making is proposed. It is used for CTU classification and depth range restriction. Last, the optimal CTU partition is achieved by recursive rate distortion (RD) cost calculation in the depth range. Experimental results show that the proposed algorithm can achieve average 27.54% encoding time reduction with negligible RD loss compared with HM 16.9. The proposed algorithm devotes to promote popularization of HEVC in realtime environments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Investigation of Skeleton-Based Optical Flow-Guided Features for 3D Action Recognition Using a Multi-Stream CNN Model Research on the Counting Algorithm of Bundled Steel Bars Based on the Features Matching of Connected Regions Hybrid Change Detection Based on ISFA for High-Resolution Imagery Scene Recognition with Convolutional Residual Features via Deep Forest Design and Implementation of T-Hash Tree in Main Memory Data Base
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1