Fast Video-Based Point Cloud Compression Based on Early Termination and Transformer Model

IF 5.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Emerging Topics in Computational Intelligence Pub Date : 2024-02-16 DOI:10.1109/TETCI.2024.3360290
Yihan Wang;Yongfang Wang;Tengyao Cui;Zhijun Fang
{"title":"Fast Video-Based Point Cloud Compression Based on Early Termination and Transformer Model","authors":"Yihan Wang;Yongfang Wang;Tengyao Cui;Zhijun Fang","doi":"10.1109/TETCI.2024.3360290","DOIUrl":null,"url":null,"abstract":"Video-based Point Cloud Compression (V-PCC) was proposed by the Moving Picture Experts Group (MPEG) to standardize Point Cloud Compression (PCC). The main idea of V-PCC is to project the Dynamic Point Cloud (DPC) into auxiliary information, occupancy, geometry, and attribute videos for encoding utilizing High Efficiency Video Coding (HEVC), Versatile Video Coding (VVC), etc. Compared with the previous PCC algorithms, V-PCC has achieved a significant improvement in compression efficiency. However, it is accompanied by substantial computational complexity. To solve this problem, this paper proposes a fast V-PCC method to decrease the coding complexity. Taking into account the coding characteristic of V-PCC, the geometry and attribute maps are first classified into occupied and unoccupied blocks. Moreover, we analyze Coding Unit (CU) splitting for geometry and attribute map. Finally, we propose fast V-PCC algorithms based on early termination algorithm and transformer model, in which the early termination method is proposed for low complexity blocks in the geometry and attribute map, and the transformer model-based fast method is designed to predict the optimal CU splitting modes for the occupied block of the attribute map. The proposed algorithms are implemented with typical DPC sequences on the Test Model Category 2 (TMC2). The experimental results imply that the average time of the proposed method can significantly reduce 56.39% and 55.10% in the geometry and attribute map, respectively, with negligible Bjontegaard-Delta bitrate (BD-rate) compared with the anchor method.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":5.3000,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10438525/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Video-based Point Cloud Compression (V-PCC) was proposed by the Moving Picture Experts Group (MPEG) to standardize Point Cloud Compression (PCC). The main idea of V-PCC is to project the Dynamic Point Cloud (DPC) into auxiliary information, occupancy, geometry, and attribute videos for encoding utilizing High Efficiency Video Coding (HEVC), Versatile Video Coding (VVC), etc. Compared with the previous PCC algorithms, V-PCC has achieved a significant improvement in compression efficiency. However, it is accompanied by substantial computational complexity. To solve this problem, this paper proposes a fast V-PCC method to decrease the coding complexity. Taking into account the coding characteristic of V-PCC, the geometry and attribute maps are first classified into occupied and unoccupied blocks. Moreover, we analyze Coding Unit (CU) splitting for geometry and attribute map. Finally, we propose fast V-PCC algorithms based on early termination algorithm and transformer model, in which the early termination method is proposed for low complexity blocks in the geometry and attribute map, and the transformer model-based fast method is designed to predict the optimal CU splitting modes for the occupied block of the attribute map. The proposed algorithms are implemented with typical DPC sequences on the Test Model Category 2 (TMC2). The experimental results imply that the average time of the proposed method can significantly reduce 56.39% and 55.10% in the geometry and attribute map, respectively, with negligible Bjontegaard-Delta bitrate (BD-rate) compared with the anchor method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于提前终止和变压器模型的快速视频点云压缩
基于视频的点云压缩(V-PCC)是由移动图像专家组(MPEG)为规范点云压缩(PCC)而提出的。V-PCC 的主要思想是将动态点云(DPC)投射到辅助信息、占位、几何和属性视频中,利用高效视频编码(HEVC)、多功能视频编码(VVC)等进行编码。与之前的 PCC 算法相比,V-PCC 在压缩效率方面有了显著提高。然而,它也伴随着巨大的计算复杂性。为解决这一问题,本文提出了一种快速 V-PCC 方法,以降低编码复杂度。考虑到 V-PCC 的编码特性,首先将几何图形和属性图划分为占用块和未占用块。此外,我们还分析了几何图形和属性图的编码单元(CU)分割。最后,我们提出了基于早期终止算法和变压器模型的快速 V-PCC 算法,其中针对几何图形和属性图中的低复杂度块提出了早期终止方法,并设计了基于变压器模型的快速方法来预测属性图中已占用块的最佳 CU 分割模式。在测试模型类别 2(TMC2)上使用典型的 DPC 序列实现了所提出的算法。实验结果表明,与锚定方法相比,所提方法在几何图形和属性图上的平均时间可分别显著减少 56.39% 和 55.10%,而比特率(BD-rate)则可忽略不计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
10.30
自引率
7.50%
发文量
147
期刊介绍: The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys. TETCI is an electronics only publication. TETCI publishes six issues per year. Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.
期刊最新文献
Table of Contents IEEE Computational Intelligence Society Information IEEE Transactions on Emerging Topics in Computational Intelligence Information for Authors IEEE Transactions on Emerging Topics in Computational Intelligence Publication Information A Novel Multi-Source Information Fusion Method Based on Dependency Interval
×
引用
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