Learning-based lossless compression of 3D point cloud geometry

• URL: http://arxiv.org/abs/2011.14700v2
• Date: Tue, 20 Apr 2021 09:29:28 GMT
• Title: Learning-based lossless compression of 3D point cloud geometry
• Authors: Dat Thanh Nguyen, Maurice Quach, Giuseppe Valenzise, Pierre Duhamel
• Abstract summary: encoder operates in a hybrid mode, mixing octree and voxel-based coding. Our method outperforms the state-of-the-art MPEG G-PCC standard with average rate savings of 28%.
• Score: 11.69103847045569
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents a learning-based, lossless compression method for static point cloud geometry, based on context-adaptive arithmetic coding. Unlike most existing methods working in the octree domain, our encoder operates in a hybrid mode, mixing octree and voxel-based coding. We adaptively partition the point cloud into multi-resolution voxel blocks according to the point cloud structure, and use octree to signal the partitioning. On the one hand, octree representation can eliminate the sparsity in the point cloud. On the other hand, in the voxel domain, convolutions can be naturally expressed, and geometric information (i.e., planes, surfaces, etc.) is explicitly processed by a neural network. Our context model benefits from these properties and learns a probability distribution of the voxels using a deep convolutional neural network with masked filters, called VoxelDNN. Experiments show that our method outperforms the state-of-the-art MPEG G-PCC standard with average rate savings of 28% on a diverse set of point clouds from the Microsoft Voxelized Upper Bodies (MVUB) and MPEG. The implementation is available at https://github.com/Weafre/VoxelDNN.

Related papers

• PVContext: Hybrid Context Model for Point Cloud Compression [61.24130634750288]
  We propose PVContext, a hybrid context model for effective octree-based point cloud compression. PVContext comprises two components with distinct modalities: the Voxel Context, which accurately represents local geometric information using voxels, and the Point Context, which efficiently preserves global shape information from point clouds.
  arXiv  Detail & Related papers  (2024-09-19T12:47:35Z)
• SPAC: Sampling-based Progressive Attribute Compression for Dense Point Clouds [51.313922535437726]
  We propose an end-to-end compression method for dense point clouds. The proposed method combines a frequency sampling module, an adaptive scale feature extraction module with geometry assistance, and a global hyperprior entropy model.
  arXiv  Detail & Related papers  (2024-09-16T13:59:43Z)
• Point Cloud Compression with Implicit Neural Representations: A Unified Framework [54.119415852585306]
  We present a pioneering point cloud compression framework capable of handling both geometry and attribute components. Our framework utilizes two coordinate-based neural networks to implicitly represent a voxelized point cloud. Our method exhibits high universality when contrasted with existing learning-based techniques.
  arXiv  Detail & Related papers  (2024-05-19T09:19:40Z)
• Clustering based Point Cloud Representation Learning for 3D Analysis [80.88995099442374]
  We propose a clustering based supervised learning scheme for point cloud analysis. Unlike current de-facto, scene-wise training paradigm, our algorithm conducts within-class clustering on the point embedding space. Our algorithm shows notable improvements on famous point cloud segmentation datasets.
  arXiv  Detail & Related papers  (2023-07-27T03:42:12Z)
• GQE-Net: A Graph-based Quality Enhancement Network for Point Cloud Color Attribute [51.4803148196217]
  We propose a graph-based quality enhancement network (GQE-Net) to reduce color distortion in point clouds. GQE-Net uses geometry information as an auxiliary input and graph convolution blocks to extract local features efficiently. Experimental results show that our method achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2023-03-24T02:33:45Z)
• Lossless Point Cloud Geometry and Attribute Compression Using a Learned Conditional Probability Model [2.670322123407995]
  We present an efficient point cloud compression method that uses tensor-based deep neural networks to learn point cloud geometry and color probability. Our method represents a point cloud with both occupancy feature and three features at different bit depths in a unified representation.
  arXiv  Detail & Related papers  (2023-03-11T23:50:02Z)
• Learning Neural Volumetric Field for Point Cloud Geometry Compression [13.691147541041804]
  We propose to code the geometry of a given point cloud by learning a neural field. We divide the entire space into small cubes and represent each non-empty cube by a neural network and an input latent code. The network is shared among all the cubes in a single frame or multiple frames, to exploit the spatial and temporal redundancy.
  arXiv  Detail & Related papers  (2022-12-11T19:55:24Z)
• 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)
• Lossless Coding of Point Cloud Geometry using a Deep Generative Model [11.69103847045569]
  Method adaptively partitions a point cloud into multiple voxel block sizes. Deep auto-regressive generative model estimates occupancy probability of each voxel. We employ estimated probabilities to code efficiently a block using a context-based arithmetic coder.
  arXiv  Detail & Related papers  (2021-07-01T12:20:22Z)
• VoxelContext-Net: An Octree based Framework for Point Cloud Compression [20.335998518653543]
  We propose a two-stage deep learning framework called VoxelContext-Net for both static and dynamic point cloud compression. We first extract the local voxel representation that encodes the spatial neighbouring context information for each node in the constructed octree. In the entropy coding stage, we propose a voxel context based deep entropy model to compress the symbols of non-leaf nodes.
  arXiv  Detail & Related papers  (2021-05-05T16:12:48Z)
• Permute, Quantize, and Fine-tune: Efficient Compression of Neural Networks [70.0243910593064]
  Key to success of vector quantization is deciding which parameter groups should be compressed together. In this paper we make the observation that the weights of two adjacent layers can be permuted while expressing the same function. We then establish a connection to rate-distortion theory and search for permutations that result in networks that are easier to compress.
  arXiv  Detail & Related papers  (2020-10-29T15:47:26Z)

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.