用比特回填技术压缩点云,降低存储开销。
Point Cloud Compression with Bits-back Coding
- 基于卷积变分自编码器建模点云熵,用比特回填编码压缩几何属性。
- 平均压缩比达1.56比特/点,优于Draco的1.83比特/点。
- 显著降低编解码器开销,适合实际部署场景。
本文提出一种新型无损压缩方法,利用比特回填编码对点云数据的几何属性进行压缩。该方法采用基于深度学习的概率模型——卷积变分自编码器(CVAE)估计点云信息的香农熵。在完成熵估计后,利用训练好的CVAE模型结合比特回填编码技术压缩点云的几何属性。其核心在于利用CVAE学习到的潜在变量模型捕捉点云中数据点间的潜在相关性,如相似的空间特征、形状和散射区域,将其映射至低维潜在空间以进一步降低压缩率。实验表明,该方法在大型点云数据集上可实现平均1.56比特/点的压缩比,显著优于基准方法Google Draco的1.83比特/点。同时,编解码器的额外开销极小,相较压缩率提升具有显著优势,适用于实际应用场景。
原文摘要 · Abstract (English)
This paper introduces a novel lossless compression method for compressing geometric attributes of point cloud data with bits-back coding. Our method specializes in using a deep learning-based probabilistic model to estimate the Shannon's entropy of the point cloud information, i.e., geometric attributes of the 3D floating points. Once the entropy of the point cloud dataset is estimated with a convolutional variational autoencoder (CVAE), we use the learned CVAE model to compress the geometric attributes of the point clouds with the bits-back coding technique. The novelty of our method with bits-back coding specializes in utilizing the learned latent variable model of the CVAE to compress the point cloud data. By using bits-back coding, we can capture the potential correlation between the data points, such as similar spatial features like shapes and scattering regions, into the lower-dimensional latent space to further reduce the compression ratio. The main insight of our method is that we can achieve a competitive compression ratio as conventional deep learning-based approaches, while significantly reducing the overhead cost of storage and/or communicating the compression codec, making our approach more applicable in practical scenarios. Throughout comprehensive evaluations, we found that the cost for the overhead is significantly small, compared to the reduction of the compression ratio when compressing large point cloud datasets. Experiment results show that our proposed approach can achieve a compression ratio of 1.56 bit-per-point on average, which is significantly lower than the baseline approach such as Google's Draco with a compression ratio of 1.83 bit-per-point.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。