LVAC: Learned Volumetric Attribute Compression for Point Clouds using Coordinate Based Networks

• URL: http://arxiv.org/abs/2111.08988v1
• Date: Wed, 17 Nov 2021 09:11:09 GMT
• Title: LVAC: Learned Volumetric Attribute Compression for Point Clouds using Coordinate Based Networks
• Authors: Berivan Isik, Philip A. Chou, Sung Jin Hwang, Nick Johnston, George Toderici
• Abstract summary: We consider the attributes of a point cloud as samples of a vector-valued volumetric function at discrete positions. We model the volumetric function by tiling space into blocks, and representing the function over each block by shifts of a coordinate-based, or implicit, neural network. We represent the latent vectors using coefficients of the region-adaptive hierarchical transform (RAHT) used in the geometry-based point cloud G-PCC.
• Score: 21.6781972169876
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the attributes of a point cloud as samples of a vector-valued volumetric function at discrete positions. To compress the attributes given the positions, we compress the parameters of the volumetric function. We model the volumetric function by tiling space into blocks, and representing the function over each block by shifts of a coordinate-based, or implicit, neural network. Inputs to the network include both spatial coordinates and a latent vector per block. We represent the latent vectors using coefficients of the region-adaptive hierarchical transform (RAHT) used in the MPEG geometry-based point cloud codec G-PCC. The coefficients, which are highly compressible, are rate-distortion optimized by back-propagation through a rate-distortion Lagrangian loss in an auto-decoder configuration. The result outperforms RAHT by 2--4 dB. This is the first work to compress volumetric functions represented by local coordinate-based neural networks. As such, we expect it to be applicable beyond point clouds, for example to compression of high-resolution neural radiance fields.

Related papers

• Efficient Implicit Neural Compression of Point Clouds via Learnable Activation in Latent Space [10.056460330355193]
  Implicit Neural Representations (INRs) have emerged as a powerful paradigm in deep learning. We propose textbfPICO, an INR-based framework for static point cloud compression. Our approach exhibits highly competitive results, with an average PCQM gain of $2.7 times 10-3$.
  arXiv  Detail & Related papers  (2025-04-20T03:37:32Z)
• Implicit Neural Compression of Point Clouds [58.45774938982386]
  NeRC$textbf3$ is a novel point cloud compression framework leveraging implicit neural representations to handle both geometry and attributes. For dynamic point clouds, 4D-NeRC$textbf3$ demonstrates superior geometry compression compared to state-of-the-art G-PCC and V-PCC standards.
  arXiv  Detail & Related papers  (2024-12-11T03:22:00Z)
• 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)
• 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)
• Fast Point Cloud Geometry Compression with Context-based Residual Coding and INR-based Refinement [19.575833741231953]
  We use the KNN method to determine the neighborhoods of raw surface points. A conditional probability model is adaptive to local geometry, leading to significant rate reduction. We incorporate an implicit neural representation into the refinement layer, allowing the decoder to sample points on the underlying surface at arbitrary densities.
  arXiv  Detail & Related papers  (2024-08-06T05:24:06Z)
• 3D Point Cloud Compression with Recurrent Neural Network and Image Compression Methods [0.0]
  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.
  arXiv  Detail & Related papers  (2024-02-18T19:08:19Z)
• Volumetric Attribute Compression for 3D Point Clouds using Feedforward Network with Geometric Attention [36.41214415449853]
  We propose a feedforward linear network that implements higher-order B-spline bases spanning function spaces without eigendecomposition. We show that the number of layers in the normalization at the encoder is equivalent to the number of terms in an inverse Taylor series.
  arXiv  Detail & Related papers  (2023-04-01T15:24:12Z)
• 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)
• Variable Bitrate Neural Fields [75.24672452527795]
  We present a dictionary method for compressing feature grids, reducing their memory consumption by up to 100x. We formulate the dictionary optimization as a vector-quantized auto-decoder problem which lets us learn end-to-end discrete neural representations in a space where no direct supervision is available.
  arXiv  Detail & Related papers  (2022-06-15T17:58:34Z)
• SoftPool++: An Encoder-Decoder Network for Point Cloud Completion [93.54286830844134]
  We propose a novel convolutional operator for the task of point cloud completion. The proposed operator does not require any max-pooling or voxelization operation. We show that our approach achieves state-of-the-art performance in shape completion at low and high resolutions.
  arXiv  Detail & Related papers  (2022-05-08T15:31:36Z)
• 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)
• Rate Distortion Characteristic Modeling for Neural Image Compression [59.25700168404325]
  End-to-end optimization capability offers neural image compression (NIC) superior lossy compression performance. distinct models are required to be trained to reach different points in the rate-distortion (R-D) space. We make efforts to formulate the essential mathematical functions to describe the R-D behavior of NIC using deep network and statistical modeling.
  arXiv  Detail & Related papers  (2021-06-24T12:23:05Z)
• 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.