Packet-Loss Robust 3D Gaussian Compression via Atomic Packaging and GNN-based Error Concealment

• URL: http://arxiv.org/abs/2607.17916v1
• Date: Mon, 20 Jul 2026 13:13:38 GMT
• Title: Packet-Loss Robust 3D Gaussian Compression via Atomic Packaging and GNN-based Error Concealment
• Abstract summary: We propose a packet-loss robust 3DGS transmission and error concealment framework.<n>A lightweight two-layer graph neural network with cross-attention over hash-grid priors refines high-frequency attribute residuals.<n> Experiments under 20 percent random packet loss on BungeeNeRF, Mip-NeRF 360, and Tanks and Temples show that the proposed method substantially improves over no-concealment transmission.
• Score: 3.679539308969595
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 3D Gaussian Splatting (3DGS) and recent compression schemes such as HAC++ enable high-fidelity real-time neural rendering, but their bitstreams are fragile under packet loss during network streaming. Existing compression methods often separate correlated anchor attributes into independent streams, so losing one packet can create attribute-inconsistent broken anchors and severe rendering artifacts. We propose a packet-loss robust 3DGS transmission and error concealment framework. On the encoder side, anchor-level atomic packaging jointly encapsulates all attributes of each anchor, converting corrupted-attribute failures into clean missing-anchor erasures. Stratified random grouping further disperses packet losses across the spatial domain to avoid large contiguous voids. On the decoder side, we formulate recovery as prior-aware attribute inpainting. A Context-Aware Residual Interpolation (CARI) branch uses hash-grid prior predictions and neighboring residuals to build a robust baseline, while a lightweight two-layer graph neural network with cross-attention over hash-grid priors refines high-frequency attribute residuals. Attribute-wise confidence control falls back to interpolation when learned predictions are unreliable. Experiments under 20 percent random packet loss on BungeeNeRF, Mip-NeRF 360, and Tanks and Temples show that the proposed method substantially improves over no-concealment transmission and limits average PSNR degradation to about 3 dB relative to the lossless HAC++ reference.

Related papers

• Every Packet Counts: Dispersing Information for Loss-Resilient Learned Image Compression [18.227887897767385]
  We propose an end-to-end loss-resilient image compression scheme that addresses packet loss.<n>Our method consistently outperforms existing approaches in both reconstruction quality and stability.<n> Notably, trained under uniform random loss only, our model generalizes to bursty loss modeled by the Gilbert-Elliott channel.
  arXiv  Detail & Related papers  (2026-08-11T16:01:03Z)
• Proteus: A Truncation-Robust Entropy Model for Progressive LiDAR Compression [21.98753379933845]
  Proteus is a learned LiDAR operating on 2D range images.<n>Proteus tolerates up to 70% bitstream truncation, while outperforming established standards.
  arXiv  Detail & Related papers  (2026-08-01T14:24:08Z)
• CodecSplat: Ultra-Compact Latent Coding for Feed-Forward 3D Gaussian Splatting [53.50198425973128]
  We introduce CodecSplat, an ultracompact latent coding framework for feed-forward 3D Gaussian splatting.<n>CodecSplat achieves 23.56-26.36 dB and 24.76-27.05 dB with only 20.00-10777 PSNR with 3.37-12 and 3.37-12 respectively.
  arXiv  Detail & Related papers  (2026-05-25T08:17:35Z)
• ZID-Net: Zero-Inference Diffusion Prior Decoupling Network for Single Image Dehazing [10.634107398163676]
  Single image dehazing is often constrained by a trade-off between restoration quality and computational efficiency.<n>ZID-Net is a novel framework that explicitly decouples diffusion supervision from feed-forward inference.<n>ZID-Net achieves 40.75 dB PSNR on the synthetic RESIDE dataset and outperforms existing methods with a 1.13 dB gain on real-world datasets.
  arXiv  Detail & Related papers  (2026-04-26T13:44:25Z)
• LG-HCC: Local Geometry-Aware Hierarchical Context Compression for 3D Gaussian Splatting [77.81227097905865]
  Anchor-based 3DGS compression schemes reduce gaussian redundancy through some advanced context models.<n>We propose a Local Geometry-aware Hierarchical Context Compression framework for 3DGS that incorporates inter-anchor geometric correlations into anchor pruning and entropy coding for compact representation.<n>Experiments show that LG-HCC effectively alleviates structural preservation issues,achieving superior geometric integrity and rendering fidelity while reducing storage by up to 30.85x compared to the Scaffold-GS baseline on the Mip-NeRF360 dataset.
  arXiv  Detail & Related papers  (2026-03-30T13:39:35Z)
• Generalizing GNNs with Tokenized Mixture of Experts [75.8310720413187]
  We show that improving stability requires reducing reliance on shift-sensitive features, leaving an irreducible worst-case generalization floor.<n>We propose STEM-GNN, a pretrain-then-finetune framework with a mixture-of-experts encoder for diverse computation paths.<n>Across nine node, link, and graph benchmarks, STEM-GNN achieves a stronger three-way balance, improving robustness to degree/homophily shifts and to feature/edge corruptions while remaining competitive on clean graphs.
  arXiv  Detail & Related papers  (2026-02-09T22:48:30Z)
• Unleashing Degradation-Carrying Features in Symmetric U-Net: Simpler and Stronger Baselines for All-in-One Image Restoration [52.82397287366076]
  All-in-one image restoration aims to handle diverse degradations (e.g., noise, blur, adverse weather) within a unified framework.<n>In this work, we reveal a critical insight: well-crafted feature extraction inherently encodes degradation-carrying information.<n>Our symmetric design preserves intrinsic degradation signals robustly, rendering simple additive fusion in skip connections.
  arXiv  Detail & Related papers  (2025-12-11T12:20:31Z)
• Distributed Training under Packet Loss [8.613477072763404]
  Leveraging unreliable connections will reduce latency but may sacrifice model accuracy and convergence once packets are dropped.<n>We introduce a principled, end-to-end solution that preserves accuracy and convergence guarantees under genuine packet loss.<n>This work bridges the gap between communication-efficient protocols and the accuracy and guarantees demanded by modern large-model training.
  arXiv  Detail & Related papers  (2025-07-02T11:07:20Z)
• HAC++: Towards 100X Compression of 3D Gaussian Splatting [55.6351304553003]
  3D Gaussian Splatting (3DGS) has emerged as a promising framework for novel view synthesis, boasting rapid rendering speed with high fidelity.<n>However, the sparse and unorganized nature of the point cloud of Gaussians (or anchors in our paper) presents challenges for compression.<n>We propose HAC++, which leverages the relationships between unorganized anchors and a structured hash grid, utilizing their mutual information for context modeling.
  arXiv  Detail & Related papers  (2025-01-21T16:23:05Z)
• HAC: Hash-grid Assisted Context for 3D Gaussian Splatting Compression [55.6351304553003]
  3D Gaussian Splatting (3DGS) has emerged as a promising framework for novel view synthesis. We propose a Hash-grid Assisted Context (HAC) framework for highly compact 3DGS representation. Our work is the pioneer to explore context-based compression for 3DGS representation, resulting in a remarkable size reduction of over $75times$ compared to vanilla 3DGS.
  arXiv  Detail & Related papers  (2024-03-21T16:28:58Z)

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.