arXiv Computer Vision

GoDe: Gaussians on Demand for Backbone-Agnostic Progressive Compression

arXiv Computer Vision
Aug 28

KISS-GS: 3D Gaussian Splatting Compression Kept Simple

KISS-GS is a modular compression pipeline for 3D Gaussian Splatting (3DGS) scenes that separates compression from training. It first compacts a vanilla 3DGS scene by 15.7× using state‑of‑the‑art pruning, then encodes the result into the SOG‑XT image‑based format, achieving an additional 6.6× reduction. Optional encoding‑aware fine‑tuning can further cut the size by 2.2×, yielding total reductions of 85× to 319× on standard benchmarks while enabling web‑native decoding.

By Wieland Morgenstern, Friedrich Elias Branschke, Florian Fleischmann, Adrian Szatmari, Paul Schlack, Florian Barthel, Peter Eisert, Anna Hilsmann
arXiv Computer Vision
Oct 16

ResStreamGS: Residual-Sensitive Dual-Stream Gaussian Splatting for Mobile Volumetric Video Streaming

ResStreamGS introduces a residual‑sensitive dual‑stream framework for mobile volumetric video streaming that distinguishes temporally stable Gaussians from residual‑sensitive ones. Stable Gaussians are transmitted once per Group of Pictures, while only the residual‑sensitive Gaussians are included in the frame‑wise video stream, reducing bandwidth usage. Experiments on complex full‑scene videos show a 7.51–8.35 dB PSNR improvement over a V³‑style baseline, a payload reduction of up to 56.5%, and real‑time performance of 30.883 FPS on a Qualcomm Snapdragon 778G.

By Haoran Liu, Di Wu, Wang Luo, Hengyuan Na, Miao Hu, Guocong Quan
arXiv Computer Vision
Sep 4

Tree-Structured Vector Quantization For Efficient And Progressive Image Compression

Tree-VQ introduces a progressive tree‑structured vector quantization framework for learned image compression, organizing discrete codewords in a hierarchical binary tree where each latent token is represented by a routed root‑to‑leaf path. Every prefix of this path yields a valid quantized representation, enabling coarse reconstructions from shallow nodes and successive refinements from deeper nodes. The method incorporates a prefix‑compatible tree entropy model, rate‑aware refinement scheduling, and hierarchical prefix supervision to achieve efficient, low‑latency compression with superior perceptual quality and fewer parameters compared to existing approaches.

By Xinkun Wang, Tianyi Xu, Qingyu Luo, Mingming Ma, Changzhe Jiao, Fu Li, Yi Niu
arXiv Computer Vision
Sep 3

CC-4DGS: Computational Deformation and Point-Cloud Compression for Storage-Efficient Dynamic Gaussian Splatting

CC-4DGS introduces a storage‑efficient framework for dynamic 4D Gaussian splatting by replacing large multi‑resolution hash tables with a deterministic dense hash encoding and compact neural decoders, reducing deformation storage to 1–3 MB per scene. It also compresses canonical point‑cloud attributes through conditional autoencoding, selective quantization, and residual codebooks, achieving 3–5× reduction in point‑cloud size with negligible quality loss. The combined approach maintains real‑time rendering performance while lowering total storage to 20–30 MB, matching state‑of‑the‑art reconstruction accuracy on N3DV and Technicolor Light Field datasets.

By Kyungdae Park, Chae Eun Rhee