Redirecting to original paper in 30 seconds...

Click below to go immediately or wait for automatic redirect

arxiv_cv 90% Match Research Paper Computer Vision Researchers,3D Graphics Engineers,VR/AR Developers,Machine Learning Engineers,Data Compression Specialists 1 week ago

AnyPcc: Compressing Any Point Cloud with a Single Universal Model

computer-vision › 3d-vision
📄 Abstract

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.
Authors (5)
Kangli Wang
Qianxi Yi
Yuqi Ye
Shihao Li
Wei Gao
Submitted
October 23, 2025
arXiv Category
cs.CV
arXiv PDF Code

Key Contributions

Introduces AnyPcc, a universal point cloud compression framework that addresses generalization issues. It features a Universal Context Model using spatial/channel grouping and an Instance-Adaptive Fine-Tuning (IAFT) strategy to handle OOD data by fine-tuning a subset of weights per instance.

Business Value

Enables more efficient storage and transmission of large 3D datasets, crucial for VR/AR, autonomous systems, and 3D content creation, reducing bandwidth and storage costs.

View Code on GitHub