基于记忆信道的点云几何熵编码

Zhecheng Wang, Shuai Wan, Lei Wei
{"title":"基于记忆信道的点云几何熵编码","authors":"Zhecheng Wang, Shuai Wan, Lei Wei","doi":"10.1109/ICCC56324.2022.10065654","DOIUrl":null,"url":null,"abstract":"The Point cloud is a popular representation format of 3D objects and scenes. For efficient transmission and storage of point clouds in practice, point cloud compression becomes an attractive research topic for academia and industry. Octree coding is one of the main features for coding the geometry in point clouds, as employed in the latest international standard of Geometry-based Point Cloud Compression (G-PCC). This paper aims to improve the performance of the octree coding in G-PCC with reduced complexity. For this purpose, we employ the neighboring nodes to model contexts for the entropy coding directly. As to neighboring sub-nodes, intermedia states are observed first during the coding process, with a memory channel employed for each state to record the occupancy bits of the already coded sub-nodes with the same state. Then the correlation of the sub-nodes recorded in the same memory channel can be utilized to reduce the spatial redundancy further. Compared to the state-of-the-art GPCC codec, the proposed entropy coding method provides about 1.0% bpp (bit per input point) and 3.5% BD-Rate (Bj⊘ntegaard Delta Rate) reduction under lossless and lossy geometry compression, respectively. Moreover, the proposed method also reduces the complexity.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"124 24","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Entropy Coding of Point Cloud Geometry Using Memory Channel\",\"authors\":\"Zhecheng Wang, Shuai Wan, Lei Wei\",\"doi\":\"10.1109/ICCC56324.2022.10065654\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Point cloud is a popular representation format of 3D objects and scenes. For efficient transmission and storage of point clouds in practice, point cloud compression becomes an attractive research topic for academia and industry. Octree coding is one of the main features for coding the geometry in point clouds, as employed in the latest international standard of Geometry-based Point Cloud Compression (G-PCC). This paper aims to improve the performance of the octree coding in G-PCC with reduced complexity. For this purpose, we employ the neighboring nodes to model contexts for the entropy coding directly. As to neighboring sub-nodes, intermedia states are observed first during the coding process, with a memory channel employed for each state to record the occupancy bits of the already coded sub-nodes with the same state. Then the correlation of the sub-nodes recorded in the same memory channel can be utilized to reduce the spatial redundancy further. Compared to the state-of-the-art GPCC codec, the proposed entropy coding method provides about 1.0% bpp (bit per input point) and 3.5% BD-Rate (Bj⊘ntegaard Delta Rate) reduction under lossless and lossy geometry compression, respectively. Moreover, the proposed method also reduces the complexity.\",\"PeriodicalId\":263098,\"journal\":{\"name\":\"2022 IEEE 8th International Conference on Computer and Communications (ICCC)\",\"volume\":\"124 24\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 8th International Conference on Computer and Communications (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCC56324.2022.10065654\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC56324.2022.10065654","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

点云是一种流行的3D物体和场景的表示格式。为了在实践中有效地传输和存储点云,点云压缩成为学术界和工业界关注的研究课题。八叉树编码是对点云进行几何编码的主要特征之一,被最新的基于几何的点云压缩(G-PCC)国际标准所采用。本文旨在提高G-PCC中八叉树编码的性能,同时降低编码复杂度。为此,我们直接使用相邻节点对熵编码的上下文建模。对于相邻的子节点,在编码过程中首先观察中间介质状态,每个状态使用一个存储通道来记录具有相同状态的已编码子节点的占用位。然后利用同一存储通道中记录的子节点之间的相关性进一步降低空间冗余度。与最先进的GPCC编解码器相比,所提出的熵编码方法在无损和有损几何压缩下分别提供约1.0%的bpp(每个输入点比特)和3.5%的BD-Rate (Bj⊘整数δ率)降低。此外,该方法还降低了算法的复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Entropy Coding of Point Cloud Geometry Using Memory Channel
The Point cloud is a popular representation format of 3D objects and scenes. For efficient transmission and storage of point clouds in practice, point cloud compression becomes an attractive research topic for academia and industry. Octree coding is one of the main features for coding the geometry in point clouds, as employed in the latest international standard of Geometry-based Point Cloud Compression (G-PCC). This paper aims to improve the performance of the octree coding in G-PCC with reduced complexity. For this purpose, we employ the neighboring nodes to model contexts for the entropy coding directly. As to neighboring sub-nodes, intermedia states are observed first during the coding process, with a memory channel employed for each state to record the occupancy bits of the already coded sub-nodes with the same state. Then the correlation of the sub-nodes recorded in the same memory channel can be utilized to reduce the spatial redundancy further. Compared to the state-of-the-art GPCC codec, the proposed entropy coding method provides about 1.0% bpp (bit per input point) and 3.5% BD-Rate (Bj⊘ntegaard Delta Rate) reduction under lossless and lossy geometry compression, respectively. Moreover, the proposed method also reduces the complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信