3D Point Cloud Compression with Recurrent Neural Network and Image Compression Methods

• URL: http://arxiv.org/abs/2402.11680v1
• Date: Sun, 18 Feb 2024 19:08:19 GMT
• Title: 3D Point Cloud Compression with Recurrent Neural Network and Image Compression Methods
• Authors: Till Beemelmanns, Yuchen Tao, Bastian Lampe, Lennart Reiher, Raphael van Kempen, Timo Woopen, and Lutz Eckstein
• Abstract summary: Storing and transmitting LiDAR point cloud data is essential for many AV applications. Due to the sparsity and unordered structure of the data, it is difficult to compress point cloud data to a low volume. We propose a new 3D-to-2D transformation which allows compression algorithms to efficiently exploit spatial correlations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Storing and transmitting LiDAR point cloud data is essential for many AV applications, such as training data collection, remote control, cloud services or SLAM. However, due to the sparsity and unordered structure of the data, it is difficult to compress point cloud data to a low volume. Transforming the raw point cloud data into a dense 2D matrix structure is a promising way for applying compression algorithms. We propose a new lossless and calibrated 3D-to-2D transformation which allows compression algorithms to efficiently exploit spatial correlations within the 2D representation. To compress the structured representation, we use common image compression methods and also a self-supervised deep compression approach using a recurrent neural network. We also rearrange the LiDAR's intensity measurements to a dense 2D representation and propose a new metric to evaluate the compression performance of the intensity. Compared to approaches that are based on generic octree point cloud compression or based on raw point cloud data compression, our approach achieves the best quantitative and visual performance. Source code and dataset are available at https://github.com/ika-rwth-aachen/Point-Cloud-Compression.

Related papers

• Point Cloud Compression with Bits-back Coding [32.9521748764196]
  This paper specializes in using a deep learning-based probabilistic model to estimate the Shannon's entropy of the point cloud information. Once the entropy of the point cloud dataset is estimated, we use the learned CVAE model to compress the geometric attributes of the point clouds. 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.
  arXiv  Detail & Related papers  (2024-10-09T06:34:48Z)
• Compression of Structured Data with Autoencoders: Provable Benefit of Nonlinearities and Depth [83.15263499262824]
  We prove that gradient descent converges to a solution that completely disregards the sparse structure of the input. We show how to improve upon Gaussian performance for the compression of sparse data by adding a denoising function to a shallow architecture. We validate our findings on image datasets, such as CIFAR-10 and MNIST.
  arXiv  Detail & Related papers  (2024-02-07T16:32:29Z)
• 3D Compression Using Neural Fields [90.24458390334203]
  We propose a novel NF-based compression algorithm for 3D data. We demonstrate that our method excels at geometry compression on 3D point clouds as well as meshes. It is straightforward to extend our compression algorithm to compress both geometry and attribute (e.g. color) of 3D data.
  arXiv  Detail & Related papers  (2023-11-21T21:36:09Z)
• EPCL: Frozen CLIP Transformer is An Efficient Point Cloud Encoder [60.52613206271329]
  This paper introduces textbfEfficient textbfPoint textbfCloud textbfLearning (EPCL) for training high-quality point cloud models with a frozen CLIP transformer. Our EPCL connects the 2D and 3D modalities by semantically aligning the image features and point cloud features without paired 2D-3D data.
  arXiv  Detail & Related papers  (2022-12-08T06:27:11Z)
• GRASP-Net: Geometric Residual Analysis and Synthesis for Point Cloud Compression [16.98171403698783]
  We propose a heterogeneous approach with deep learning for lossy point cloud geometry compression. Specifically, a point-based network is applied to convert the erratic local details to latent features residing on the coarse point cloud.
  arXiv  Detail & Related papers  (2022-09-09T17:09:02Z)
• Crowd Counting on Heavily Compressed Images with Curriculum Pre-Training [90.76576712433595]
  Applying lossy compression on images processed by deep neural networks can lead to significant accuracy degradation. Inspired by the curriculum learning paradigm, we present a novel training approach called curriculum pre-training (CPT) for crowd counting on compressed images.
  arXiv  Detail & Related papers  (2022-08-15T08:43:21Z)
• RIDDLE: Lidar Data Compression with Range Image Deep Delta Encoding [21.70770383279559]
  Lidars are depth measuring sensors widely used in autonomous driving and augmented reality. Large volume of data produced by lidars can lead to high costs in data storage and transmission. We propose a novel data-driven range image compression algorithm, named RIDDLE (Range Image Deep DeLta.
  arXiv  Detail & Related papers  (2022-06-02T21:53:43Z)
• Variable Rate Compression for Raw 3D Point Clouds [5.107705550575662]
  We propose a novel variable rate deep compression architecture that operates on raw 3D point cloud data. Our network is capable of explicitly processing point clouds and generating a compressed description.
  arXiv  Detail & Related papers  (2022-02-28T15:15:39Z)
• COIN++: Data Agnostic Neural Compression [55.27113889737545]
  COIN++ is a neural compression framework that seamlessly handles a wide range of data modalities. We demonstrate the effectiveness of our method by compressing various data modalities.
  arXiv  Detail & Related papers  (2022-01-30T20:12:04Z)
• Patch-Based Deep Autoencoder for Point Cloud Geometry Compression [8.44208490359453]
  We propose a patch-based compression process using deep learning. We divide the point cloud into patches and compress each patch independently. In the decoding process, we finally assemble the decompressed patches into a complete point cloud.
  arXiv  Detail & Related papers  (2021-10-18T08:59:57Z)
• OctSqueeze: Octree-Structured Entropy Model for LiDAR Compression [77.8842824702423]
  We present a novel deep compression algorithm to reduce the memory footprint of LiDAR point clouds. Our method exploits the sparsity and structural redundancy between points to reduce the memory footprint. Our algorithm can be used to reduce the onboard and offboard storage of LiDAR points for applications such as self-driving cars.
  arXiv  Detail & Related papers  (2020-05-14T17:48:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.