TY - GEN
T1 - Entropy Coding of Point Cloud Geometry Using Memory Channel
AU - Wang, Zhecheng
AU - Wan, Shuai
AU - Wei, Lei
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - 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.
AB - 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.
KW - entropy coding
KW - G-PCC
KW - point cloud compression
UR - https://www.scopus.com/pages/publications/85151719792
U2 - 10.1109/ICCC56324.2022.10065654
DO - 10.1109/ICCC56324.2022.10065654
M3 - 会议稿件
AN - SCOPUS:85151719792
T3 - 2022 IEEE 8th International Conference on Computer and Communications, ICCC 2022
SP - 962
EP - 966
BT - 2022 IEEE 8th International Conference on Computer and Communications, ICCC 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 8th IEEE International Conference on Computer and Communications, ICCC 2022
Y2 - 9 December 2022 through 12 December 2022
ER -