Home /Research /An end-to-end dynamic point cloud geometry compression in latent space
OTHER

An end-to-end dynamic point cloud geometry compression in latent space

Zhaoyi Jiang, Guo‐Liang Wang, Gary K.L. Tam, Chao Song, Frederick W. B. Li, Bailin Yang

Year
2023
Citations
5

Abstract

Dynamic point clouds are widely used for 3D data representation in various applications such as immersive and mixed reality, robotics and autonomous driving . However, their irregularity and large scale make efficient compression and transmission a challenge. Existing methods require high bitrates to encode point clouds since temporal correlation is not well considered. This paper proposes an end-to-end dynamic point cloud compression network that operates in latent space, resulting in more accurate motion estimation and more effective motion compensation. Specifically, a multi-scale motion estimation network is introduced to obtain accurate motion vectors . Motion information computed at a coarser level is upsampled and warped to the finer level based on cost volume analysis for motion compensation. Additionally, a residual compression network is designed to mitigate the effects of noise and inaccurate predictions by encoding latent residuals, resulting in smaller conditional entropy and better results. The proposed method achieves an average 12.09% and 14.76% (D2) BD-Rate gain over state-of-the-art Deep Dynamic Point Cloud Compression (D-DPCC) in experimental results. Compared to V-PCC, our framework showed an average improvement of 81.29% (D1) and 77.57% (D2). • An end-to-end deep compression for dynamic point cloud in latent space is proposed. • We propose a Latent Scene Flow (LSF) module for the learning of motion vectors. • A deep entropy model for residual compression is introduced by spatio-temporal prior. • Experiments are conducted on the 8iVFB dataset and achieve state-of-the-art results.

Keywords

Point cloudComputer scienceMotion compensationData compressionArtificial intelligenceMotion estimationComputer visionEnd-to-end principleAlgorithm

Related papers

Browse all OTHER papers