AnyPcc: Compressing Any Point Cloud with a Single Universal Model
Kangli Wang, Qianxi Yi, Yuqi Ye, Shihao Li, Wei Gao
TL;DR
AnyPcc tackles the generalization gap in learning-based point cloud compression by introducing a Universal Context Model that fuses spatial and channel priors with a lightweight Instance-Adaptive Fine-Tuning strategy for per-instance adaptation. By unifying lossless and lossy compression, it achieves state-of-the-art performance across a broad 15-dataset benchmark, including strong OOD generalization with a single universal model (Ours-U). The approach leverages a coarse-to-fine, checkerboard-spatial and 8-bit occupancy code-based representation, and uses per-instance fine-tuning to optimize entropy models, balancing model cost against geometry bitrate savings. The results demonstrate robust, practical compression gains and reduced deployment overhead, with plans to release code and datasets to enable reproducible research.
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.
