UniPCGC: Towards Practical Point Cloud Geometry Compression via an Efficient Unified Approach
Not on the map. Why?
Abstract (arXiv)
Learning-based point cloud compression methods have made significant progress in terms of performance. However, these methods still encounter challenges including high complexity, limited compression modes, and a lack of support for variable rate, which restrict the practical application of these methods. In order to promote the development of practical point cloud compression, we propose an efficient unified point cloud geometry compression framework, dubbed as UniPCGC. It is a lightweight framework that supports lossy compression, lossless compression, variable rate and variable complexity. First, we introduce the Uneven 8-Stage Lossless Coder (UELC) in the lossless mode, which allocates more computational complexity to groups with higher coding difficulty, and merges groups with lower coding difficulty. Second, Variable Rate and Complexity Module (VRCM) is achieved in the lossy mode through joint adoption of a rate modulation module and dynamic sparse convolution. Finally, through the dynamic combination of UELC and VRCM, we achieve lossy compression, lossless compression, variable rate and complexity within a unified framework. Compared to the previous state-of-the-art method, our method achieves a compression ratio (CR) gain of 8.1% on lossless compression, and a Bjontegaard Delta Rate (BD-Rate) gain of 14.02% on lossy compression, while also supporting variable rate and variable complexity.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 29 of its 38 references that are in the map. First posted on arXiv 24 Mar 2025.
Builds on
29 of 38 references.
References · 29
- 2015ShapeNet: An Information-Rich 3D Model Repositorycited by 2,880
- 20194D Spatio-Temporal ConvNets: Minkowski Convolutional Neural Networkscited by 1,201
- 2018Variational image compression with a scale hyperpriorcited by 910
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 328
- 2017Lossy Image Compression with Compressive Autoencoderscited by 289
- 2021Checkerboard Context Model for Efficient Learned Image Compressioncited by 193
- 2017Adaptive Neural Networks for Efficient Inferencecited by 161
- 2017Convolutional Networks with Adaptive Inference Graphscited by 147
- 2017CondenseNet: An Efficient DenseNet using Learned Group Convolutionscited by 121
17 more
- 2019Variable Rate Deep Image Compression With a Conditional Autoencodercited by 109
- 2020Asymmetric Gained Deep Image Compression With Continuous Rate Adaptationcited by 83
- 2020OctSqueeze: Octree-Structured Entropy Model for LiDAR Compressioncited by 72
- 2020Multiscale Point Cloud Geometry Compressioncited by 72
- 2021Sparse Tensor-based Multiscale Representation for Point Cloud Geometry Compressioncited by 69
- 2021Variable-Rate Deep Image Compression through Spatially-Adaptive Feature Transformcited by 56
- 2020Improved Deep Point Cloud Geometry Compressioncited by 43
- 2020MuSCLE: Multi Sweep Compression of LiDAR using Deep Entropy Modelscited by 42
- 2019Variable Rate Deep Image Compression with Modulated Autoencodercited by 39
- 2020Learning-based lossless compression of 3D point cloud geometrycited by 25
- 2023Lossless Point Cloud Geometry and Attribute Compression Using a Learned Conditional Probability Modelcited by 25
- 2021Multiscale deep context modeling for lossless point cloud geometry compressioncited by 21
- 2021Interpolation variable rate image compressioncited by 12
- 2022Learning-based Lossless Point Cloud Geometry Coding using Sparse Tensorscited by 8
- 2021Rate Distortion Characteristic Modeling for Neural Image Compressioncited by 6
- 2021Universal Efficient Variable-rate Neural Image Compressioncited by 6
- 2024Pointsoup: High-Performance and Extremely Low-Decoding-Latency Learned Geometry Codec for Large-Scale Point Cloud Scenescited by 5
Built on by
Citing papers per year: 2025: 3; 2026: 5.
8 papers.
- 2025AnyPcc: Compressing Any Point Cloud with a Single Universal Modelcited by 1
- 2025Rate-distortion Optimized Point Cloud Preprocessing for Geometry-based Point Cloud Compressioncited by 0
- 2025ELiC: Efficient LiDAR Geometry Compression via Cross-Bit-depth Feature Propagation and Bag-of-Encoderscited by 0
- 2026SurfelSoup: Learned Point Cloud Geometry Compression With a Probablistic SurfelTree Representationcited by 0
- 2026HybridINR-PCGC: Hybrid Lossless Point Cloud Geometry Compression Bridging Pretrained Model and Implicit Neural Representationcited by 0
- 2026TAFA-GSGC: Group-wise Scalable Point Cloud Geometry Compression with Progressive Residual Refinementcited by 0
- 2026PACE: Post-Causal Entropy Modeling for Learned LiDAR Point Cloud Compressioncited by 0
- 2026Hierarchical Frequency-Domain Compression of Implicit Geometric Representations for Large-Scale Point Cloudscited by 0
- 2026Hierarchical Frequency-Domain Compression of Implicit Geometric Representations for Large-Scale Point Clouds26 Sep 2026
- 2026PACE: Post-Causal Entropy Modeling for Learned LiDAR Point Cloud Compression2 May 2026
- 2026TAFA-GSGC: Group-wise Scalable Point Cloud Geometry Compression with Progressive Residual Refinement30 Apr 2026
- 2026HybridINR-PCGC: Hybrid Lossless Point Cloud Geometry Compression Bridging Pretrained Model and Implicit Neural Representation25 Feb 2026
- 2026SurfelSoup: Learned Point Cloud Geometry Compression With a Probablistic SurfelTree Representation30 Jan 2026
- 2025ELiC: Efficient LiDAR Geometry Compression via Cross-Bit-depth Feature Propagation and Bag-of-Encoders18 Nov 2025
- 2025AnyPcc: Compressing Any Point Cloud with a Single Universal Model23 Oct 2025
- 2025Rate-distortion Optimized Point Cloud Preprocessing for Geometry-based Point Cloud Compression3 Aug 2025