# Lightweight super resolution network for point cloud geometry compression

arXiv: https://arxiv.org/abs/2311.00970 · HTML: https://mlsanity.com/paper/2311.00970/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 8 of its 25 references that are in the map.
- First posted on arXiv 2 Nov 2023.

## Builds on (most cited first, 8 of 8)

- [Adam: A Method for Stochastic Optimization](https://mlsanity.com/paper/1412.6980/) (2014)
- [Implicit Neural Representations with Periodic Activation Functions](https://mlsanity.com/paper/2006.09661/) (2020)
- [Multiscale Point Cloud Geometry Compression](https://mlsanity.com/paper/2011.03799/) (2020)
- [OctSqueeze: Octree-Structured Entropy Model for LiDAR Compression](https://mlsanity.com/paper/2005.07178/) (2020)
- [Sparse Tensor-based Multiscale Representation for Point Cloud Geometry Compression](https://mlsanity.com/paper/2111.10633/) (2021)
- [OctAttention: Octree-Based Large-Scale Contexts Model for Point Cloud Compression](https://mlsanity.com/paper/2202.06028/) (2022)
- [Learning-based lossless compression of 3D point cloud geometry](https://mlsanity.com/paper/2011.14700/) (2020)
- [Point Cloud Compression with Sibling Context and Surface Priors](https://mlsanity.com/paper/2205.00760/) (2022)

## Abstract (arXiv)

This paper presents an approach for compressing point cloud geometry by leveraging a lightweight super-resolution network. The proposed method involves decomposing a point cloud into a base point cloud and the interpolation patterns for reconstructing the original point cloud. While the base point cloud can be efficiently compressed using any lossless codec, such as Geometry-based Point Cloud Compression, a distinct strategy is employed for handling the interpolation patterns. Rather than directly compressing the interpolation patterns, a lightweight super-resolution network is utilized to learn this information through overfitting. Subsequently, the network parameter is transmitted to assist in point cloud reconstruction at the decoder side. Notably, our approach differentiates itself from lookup table-based methods, allowing us to obtain more accurate interpolation patterns by accessing a broader range of neighboring voxels at an acceptable computational cost. Experiments on MPEG Cat1 (Solid) and Cat2 datasets demonstrate the remarkable compression performance achieved by our method.