R-PCC: A Baseline for Range Image-based Point Cloud Compression
Not on the map. Why?
Abstract (arXiv)
In autonomous vehicles or robots, point clouds from LiDAR can provide accurate depth information of objects compared with 2D images, but they also suffer a large volume of data, which is inconvenient for data storage or transmission. In this paper, we propose a Range image-based Point Cloud Compression method, R-PCC, which can reconstruct the point cloud with uniform or non-uniform accuracy loss. We segment the original large-scale point cloud into small and compact regions for spatial redundancy and salient region classification. Compared with other voxel-based or image-based compression methods, our method can keep and align all points from the original point cloud in the reconstructed point cloud. It can also control the maximum reconstruction error for each point through a quantization module. In the experiments, we prove that our easier FPS-based segmentation method can achieve better performance than instance-based segmentation methods such as DBSCAN. To verify the advantages of our proposed method, we evaluate the reconstruction quality and fidelity for 3D object detection and SLAM, as the downstream tasks. The experimental results show that our elegant framework can achieve 30× compression ratio without affecting downstream tasks, and our non-uniform compression framework shows a great improvement on the downstream tasks compared with the state-of-the-art large-scale point cloud compression methods. Our real-time method is efficient and effective enough to act as a baseline for range image-based point cloud compression. The code is available on https://github.com/StevenWang30/R-PCC.git.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Sep 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 5; 2026: 2.
9 papers.
- 2025RENO: Real-Time Neural Compression for 3D LiDAR Point Cloudscited by 12
- 2022Point Cloud Compression with Sibling Context and Surface Priorscited by 10
- 2025Reflectance Prediction-based Knowledge Distillation for Robust 3D Object Detection in Compressed Point Cloudscited by 3
- 2025Re-Densification Meets Cross-Scale Propagation: Real-Time Neural Compression of LiDAR Point Cloudscited by 2
- 2025Range Image-Based Implicit Neural Compression for LiDAR Point Cloudscited by 1
- 2026Towards Practical Lossless Neural Compression for LiDAR Point Cloudscited by 1
- 2023Point2Point : A Framework for Efficient Deep Learning on Hilbert sorted Point Clouds with applications in Spatio-Temporal Occupancy Predictioncited by 0
- 2025FLaTEC: Frequency-Disentangled Latent Triplanes for Efficient Compression of LiDAR Point Cloudscited by 0
- 2026Proteus: A Truncation-Robust Entropy Model for Progressive LiDAR Compressioncited by 0
- 2026Proteus: A Truncation-Robust Entropy Model for Progressive LiDAR Compression1 Aug 2026
- 2026Towards Practical Lossless Neural Compression for LiDAR Point Clouds26 Mar 2026
- 2025FLaTEC: Frequency-Disentangled Latent Triplanes for Efficient Compression of LiDAR Point Clouds25 Nov 2025
- 2025Re-Densification Meets Cross-Scale Propagation: Real-Time Neural Compression of LiDAR Point Clouds28 Aug 2025
- 2025Reflectance Prediction-based Knowledge Distillation for Robust 3D Object Detection in Compressed Point Clouds23 May 2025
- 2025Range Image-Based Implicit Neural Compression for LiDAR Point Clouds24 Apr 2025
- 2025RENO: Real-Time Neural Compression for 3D LiDAR Point Clouds16 Mar 2025
- 2023Point2Point : A Framework for Efficient Deep Learning on Hilbert sorted Point Clouds with applications in Spatio-Temporal Occupancy Prediction28 Jun 2023
- 2022Point Cloud Compression with Sibling Context and Surface Priors2 May 2022