Effective CU size decision algorithm based on depth map homogeneity for 3D-HEVC inter-coding

Siham Bakkouri, A. Elyousfi
{"title":"Effective CU size decision algorithm based on depth map homogeneity for 3D-HEVC inter-coding","authors":"Siham Bakkouri, A. Elyousfi","doi":"10.1109/ISCV49265.2020.9204037","DOIUrl":null,"url":null,"abstract":"High efficiency video coding standard-based 3D video (3D-HEVC) is an extension of high efficiency video coding standard (HEVC) to improve the efficiency of the multiview video plus depth (MVD). In 3D-HEVC inter-coding, The quad-tree structure of coding unit (CU) partition supports different sizes from 64×64 to 8×8, namely, CU sizes. The CU partitioning process achieves the highest coding efficiency, but it brings an extremely large encoding time and a large computational complexity occurs which limits the 3D-HEVC encoder from practical applications. In this paper, an early termination of CU size is proposed for dependent views in 3D-HEVC depth map encoding. The proposed algorithm based on homogeneity classification of a depth map CU using an unsupervised classification algorithm. Based on the classification results, the proposed method determines whether a depth CU must be or not be split into smaller sizes. Experimental results show that the proposed approach can achieve a reduction of computational complexity for depth map encoding with a negligible reduction of coding performance.","PeriodicalId":313743,"journal":{"name":"2020 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Intelligent Systems and Computer Vision (ISCV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCV49265.2020.9204037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

High efficiency video coding standard-based 3D video (3D-HEVC) is an extension of high efficiency video coding standard (HEVC) to improve the efficiency of the multiview video plus depth (MVD). In 3D-HEVC inter-coding, The quad-tree structure of coding unit (CU) partition supports different sizes from 64×64 to 8×8, namely, CU sizes. The CU partitioning process achieves the highest coding efficiency, but it brings an extremely large encoding time and a large computational complexity occurs which limits the 3D-HEVC encoder from practical applications. In this paper, an early termination of CU size is proposed for dependent views in 3D-HEVC depth map encoding. The proposed algorithm based on homogeneity classification of a depth map CU using an unsupervised classification algorithm. Based on the classification results, the proposed method determines whether a depth CU must be or not be split into smaller sizes. Experimental results show that the proposed approach can achieve a reduction of computational complexity for depth map encoding with a negligible reduction of coding performance.
基于深度图同质性的3D-HEVC互编码有效CU大小决策算法
基于高效视频编码标准的3D视频(3D-HEVC)是对高效视频编码标准(HEVC)的扩展,旨在提高多视点视频加深度(MVD)的效率。在3D-HEVC互编码中,CU (coding unit)分区的四叉树结构支持从64×64到8×8的不同大小,即CU大小。CU划分过程实现了最高的编码效率,但带来了极大的编码时间和计算复杂度,限制了3D-HEVC编码器的实际应用。本文针对3D-HEVC深度图编码中的依赖视图,提出了提前终止CU大小的方法。提出了一种基于同质性分类的深度图CU非监督分类算法。根据分类结果,该方法确定深度CU是否必须被分割成更小的尺寸。实验结果表明,该方法可以在不影响编码性能的情况下降低深度图编码的计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信