Poster: Making Edge-assisted LiDAR Perceptions Robust to Lossy Point Cloud Compression

• URL: http://arxiv.org/abs/2309.04549v1
• Date: Fri, 8 Sep 2023 18:34:48 GMT
• Title: Poster: Making Edge-assisted LiDAR Perceptions Robust to Lossy Point Cloud Compression
• Authors: Jin Heo, Gregorie Phillips, Per-Erik Brodin, Ada Gavrilovska
• Abstract summary: We present an algorithm improving the quality of a LiDAR point cloud to mitigate the perception performance loss due to lossy compression. Compared to existing image algorithms, our algorithm shows a better qualitative result when the point cloud is reconstructed from the range image.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Real-time light detection and ranging (LiDAR) perceptions, e.g., 3D object detection and simultaneous localization and mapping are computationally intensive to mobile devices of limited resources and often offloaded on the edge. Offloading LiDAR perceptions requires compressing the raw sensor data, and lossy compression is used for efficiently reducing the data volume. Lossy compression degrades the quality of LiDAR point clouds, and the perception performance is decreased consequently. In this work, we present an interpolation algorithm improving the quality of a LiDAR point cloud to mitigate the perception performance loss due to lossy compression. The algorithm targets the range image (RI) representation of a point cloud and interpolates points at the RI based on depth gradients. Compared to existing image interpolation algorithms, our algorithm shows a better qualitative result when the point cloud is reconstructed from the interpolated RI. With the preliminary results, we also describe the next steps of the current work.

Related papers

• 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)
• 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)
• Boosting Point Clouds Rendering via Radiance Mapping [49.24193509772339]
  We focus on boosting the image quality of point clouds rendering with a compact model design. We simplify the NeRF representation to a spatial mapping function which only requires single evaluation per pixel. Our method achieves the state-of-the-art rendering on point clouds, outperforming prior works by notable margins.
  arXiv  Detail & Related papers  (2022-10-27T01:25:57Z)
• 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)
• 4DAC: Learning Attribute Compression for Dynamic Point Clouds [37.447460254690135]
  We study the attribute (e.g., color) compression of dynamic point clouds and present a learning-based framework, termed 4DAC. To reduce temporal redundancy within data, we first build the 3D motion estimation and motion compensation modules with deep neural networks. In addition, we also propose a deep conditional entropy model to estimate the probability distribution of the transformed coefficients.
  arXiv  Detail & Related papers  (2022-04-25T15:30:06Z)
• Reducing Redundancy in the Bottleneck Representation of the Autoencoders [98.78384185493624]
  Autoencoders are a type of unsupervised neural networks, which can be used to solve various tasks. We propose a scheme to explicitly penalize feature redundancies in the bottleneck representation. We tested our approach across different tasks: dimensionality reduction using three different dataset, image compression using the MNIST dataset, and image denoising using fashion MNIST.
  arXiv  Detail & Related papers  (2022-02-09T18:48:02Z)
• DeepCompress: Efficient Point Cloud Geometry Compression [1.808877001896346]
  We propose a more efficient deep learning-based encoder architecture for point clouds compression. We show that incorporating the learned activation function from Efficient Neural Image Compression (CENIC) yields dramatic gains in efficiency and performance. Our proposed modifications outperform the baseline approaches by a small margin in terms of Bjontegard delta rate and PSNR values.
  arXiv  Detail & Related papers  (2021-06-02T23:18:11Z)
• R-AGNO-RPN: A LIDAR-Camera Region Deep Network for Resolution-Agnostic Detection [3.4761212729163313]
  R-AGNO-RPN, a region proposal network built on fusion of 3D point clouds and RGB images is proposed. Our approach is designed to be also applied on low point cloud resolutions.
  arXiv  Detail & Related papers  (2020-12-10T15:22:58Z)
• 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)
• Pseudo-LiDAR Point Cloud Interpolation Based on 3D Motion Representation and Spatial Supervision [68.35777836993212]
  We propose a Pseudo-LiDAR point cloud network to generate temporally and spatially high-quality point cloud sequences. By exploiting the scene flow between point clouds, the proposed network is able to learn a more accurate representation of the 3D spatial motion relationship.
  arXiv  Detail & Related papers  (2020-06-20T03:11:04Z)
• 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.