AnyPcc: Compressing Any Point Cloud with a Single Universal Model

• URL: http://arxiv.org/abs/2510.20331v1
• Date: Thu, 23 Oct 2025 08:28:41 GMT
• Title: AnyPcc: Compressing Any Point Cloud with a Single Universal Model
• Authors: Kangli Wang, Qianxi Yi, Yuqi Ye, Shihao Li, Wei Gao,
• Abstract summary: Generalization remains a critical challenge for deep learning-based point cloud geometry compression.<n>We introduce AnyPcc, a universal point cloud compression framework.<n>Experiments on a benchmark of 15 diverse datasets confirm that AnyPcc sets a new state-of-the-art in point cloud compression.
• Score: 8.594341592756654
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generalization remains a critical challenge for deep learning-based point cloud geometry compression. We argue this stems from two key limitations: the lack of robust context models and the inefficient handling of out-of-distribution (OOD) data. To address both, we introduce AnyPcc, a universal point cloud compression framework. AnyPcc first employs a Universal Context Model that leverages priors from both spatial and channel-wise grouping to capture robust contextual dependencies. Second, our novel Instance-Adaptive Fine-Tuning (IAFT) strategy tackles OOD data by synergizing explicit and implicit compression paradigms. It fine-tunes a small subset of network weights for each instance and incorporates them into the bitstream, where the marginal bit cost of the weights is dwarfed by the resulting savings in geometry compression. Extensive experiments on a benchmark of 15 diverse datasets confirm that AnyPcc sets a new state-of-the-art in point cloud compression. Our code and datasets will be released to encourage reproducible research.

Related papers

• Arbitrary Ratio Feature Compression via Next Token Prediction [52.10426317889982]
  Arbitrary Ratio Feature Compression (ARFC) framework supports any compression ratio with a single model.<n>ARC is an auto-regressive model that performs compression via next-gressive prediction.<n>MoS module refines the compressed tokens by utilizing multiple compression results.<n>ERGC is integrated into the training process to preserve semantic and structural relationships during compression.
  arXiv  Detail & Related papers  (2026-02-12T02:38:57Z)
• Efficient Implicit Neural Compression of Point Clouds via Learnable Activation in Latent Space [10.056460330355193]
  Implicit Neural Representations (INRs) have emerged as a powerful paradigm in deep learning.<n>We propose textbfPICO, an INR-based framework for static point cloud compression.<n>Our approach exhibits highly competitive results, with an average PCQM gain of $2.7 times 10-3$.
  arXiv  Detail & Related papers  (2025-04-20T03:37:32Z)
• Implicit Neural Compression of Point Clouds [61.491532656446054]
  NeRC$3$ is a novel point cloud compression framework.<n>NeRC$3$ encodes both geometry and attributes of dense point clouds.<n>For dynamic point clouds, 4D-NeRC$3$ achieves superior geometry compression performance.
  arXiv  Detail & Related papers  (2024-12-11T03:22:00Z)
• DiffCom: Decoupled Sparse Priors Guided Diffusion Compression for Point Clouds [54.96190721255167]
  Lossy compression relies on an autoencoder to transform a point cloud into latent points for storage.<n>We propose a diffusion-based framework guided by sparse priors that achieves high reconstruction quality, especially at lows.
  arXiv  Detail & Related papers  (2024-11-21T05:41:35Z)
• 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)
• SPAC: Sampling-based Progressive Attribute Compression for Dense Point Clouds [51.313922535437726]
  We propose an end-to-end compression method for dense point clouds. The proposed method combines a frequency sampling module, an adaptive scale feature extraction module with geometry assistance, and a global hyperprior entropy model.
  arXiv  Detail & Related papers  (2024-09-16T13:59:43Z)
• End-to-end learned Lossy Dynamic Point Cloud Attribute Compression [5.717288278431968]
  This study introduces an end-to-end learned dynamic lossy attribute coding approach. We employ a context model that leverage previous latent space in conjunction with an auto-regressive context model for encoding the latent tensor into a bitstream.
  arXiv  Detail & Related papers  (2024-08-20T09:06:59Z)
• Point Cloud Compression with Implicit Neural Representations: A Unified Framework [54.119415852585306]
  We present a pioneering point cloud compression framework capable of handling both geometry and attribute components. Our framework utilizes two coordinate-based neural networks to implicitly represent a voxelized point cloud. Our method exhibits high universality when contrasted with existing learning-based techniques.
  arXiv  Detail & Related papers  (2024-05-19T09:19:40Z)
• 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)
• Geometric Prior Based Deep Human Point Cloud Geometry Compression [67.49785946369055]
  We leverage the human geometric prior in geometry redundancy removal of point clouds. We can envisage high-resolution human point clouds as a combination of geometric priors and structural deviations. The proposed framework can operate in a play-and-plug fashion with existing learning based point cloud compression methods.
  arXiv  Detail & Related papers  (2023-05-02T10:35:20Z)
• GRASP-Net: Geometric Residual Analysis and Synthesis for Point Cloud Compression [16.98171403698783]
  We propose a heterogeneous approach with deep learning for lossy point cloud geometry compression. Specifically, a point-based network is applied to convert the erratic local details to latent features residing on the coarse point cloud.
  arXiv  Detail & Related papers  (2022-09-09T17:09:02Z)

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.