Efficient LiDAR Point Cloud Geometry Compression Through Neighborhood Point Attention

• URL: http://arxiv.org/abs/2208.12573v1
• Date: Fri, 26 Aug 2022 10:44:30 GMT
• Title: Efficient LiDAR Point Cloud Geometry Compression Through Neighborhood Point Attention
• Authors: Ruixiang Xue, Jianqiang Wang, Zhan Ma
• Abstract summary: This work suggests the neighborhood point attention (NPA) to tackle them. We first use k nearest neighbors (kNN) to construct adaptive local neighborhood. We then leverage the self-attention mechanism to dynamically aggregate information within this neighborhood.
• Score: 25.054578678654796
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Although convolutional representation of multiscale sparse tensor demonstrated its superior efficiency to accurately model the occupancy probability for the compression of geometry component of dense object point clouds, its capacity for representing sparse LiDAR point cloud geometry (PCG) was largely limited. This is because 1) fixed receptive field of the convolution cannot characterize extremely and unevenly distributed sparse LiDAR points very well; and 2) pretrained convolutions with fixed weights are insufficient to dynamically capture information conditioned on the input. This work therefore suggests the neighborhood point attention (NPA) to tackle them, where we first use k nearest neighbors (kNN) to construct adaptive local neighborhood; and then leverage the self-attention mechanism to dynamically aggregate information within this neighborhood. Such NPA is devised as a NPAFormer to best exploit cross-scale and same-scale correlations for geometric occupancy probability estimation. Compared with the anchor using standardized G-PCC, our method provides >17% BD-rate gains for lossy compression, and >14% bitrate reduction for lossless scenario using popular LiDAR point clouds in SemanticKITTI and Ford datasets. Compared with the state-of-the-art (SOTA) solution using attention optimized octree coding method, our approach requires much less decoding runtime with about 640 times speedup on average, while still presenting better compression efficiency.

Related papers

• Att2CPC: Attention-Guided Lossy Attribute Compression of Point Clouds [18.244200436103156]
  We propose an efficient attention-based method for lossy compression of point cloud attributes leveraging on an autoencoder architecture. Experiments show that our method achieves an average improvement of 1.15 dB and 2.13 dB in BD-PSNR of Y channel and YUV channel, respectively.
  arXiv  Detail & Related papers  (2024-10-23T12:32:21Z)
• 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)
• OCMG-Net: Neural Oriented Normal Refinement for Unstructured Point Clouds [18.234146052486054]
  We present a robust refinement method for estimating oriented normals from unstructured point clouds. Our framework incorporates sign orientation and data augmentation in the feature space to refine the initial oriented normals. To address the issue of noise-caused direction inconsistency existing in previous approaches, we introduce a new metric called the Chamfer Normal Distance.
  arXiv  Detail & Related papers  (2024-09-02T09:30:02Z)
• 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)
• Efficient and Generic Point Model for Lossless Point Cloud Attribute Compression [28.316347464011056]
  PoLoPCAC is an efficient and generic PCAC method that achieves high compression efficiency and strong generalizability simultaneously. Our method can be instantly deployed once trained on a Synthetic 2k-ShapeNet dataset. Experiments show that our method can enjoy continuous bit-rate reduction over the latest G-PCCv23 on various datasets.
  arXiv  Detail & Related papers  (2024-04-10T11:40:02Z)
• HAC: Hash-grid Assisted Context for 3D Gaussian Splatting Compression [55.6351304553003]
  3D Gaussian Splatting (3DGS) has emerged as a promising framework for novel view synthesis. We propose a Hash-grid Assisted Context (HAC) framework for highly compact 3DGS representation. Our work is the pioneer to explore context-based compression for 3DGS representation, resulting in a remarkable size reduction of over $75times$ compared to vanilla 3DGS.
  arXiv  Detail & Related papers  (2024-03-21T16:28:58Z)
• 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)
• Quadric Representations for LiDAR Odometry, Mapping and Localization [93.24140840537912]
  Current LiDAR odometry, mapping and localization methods leverage point-wise representations of 3D scenes. We propose a novel method of describing scenes using quadric surfaces, which are far more compact representations of 3D objects. Our method maintains low latency and memory utility while achieving competitive, and even superior, accuracy.
  arXiv  Detail & Related papers  (2023-04-27T13:52:01Z)
• Density-preserving Deep Point Cloud Compression [72.0703956923403]
  We propose a novel deep point cloud compression method that preserves local density information. Our method works in an auto-encoder fashion: the encoder downsamples the points and learns point-wise features, while the decoder upsamples the points using these features.
  arXiv  Detail & Related papers  (2022-04-27T03:42:15Z)
• MuSCLE: Multi Sweep Compression of LiDAR using Deep Entropy Models [78.93424358827528]
  We present a novel compression algorithm for reducing the storage streams of LiDAR sensor data. Our method significantly reduces the joint geometry and intensity over prior state-of-the-art LiDAR compression methods.
  arXiv  Detail & Related papers  (2020-11-15T17:41:14Z)
• 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.