Packet-Loss Robust 3D Gaussian Compression via Atomic Packaging and GNN-based Error Concealment
Yuxuan Tao, Xuerui Ma, Hao Zhang, Chunhua Peng
https://arxiv.org/abs/2607.17916 https://arxiv.org/pdf/2607.17916 https://arxiv.org/html/2607.17916
arXiv:2607.17916v1 Announce Type: new
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.
toXiv_bot_toot
The Look on the Bystander 👀
凝视旁观者 👀
📷 Pentax MX
🎞️ Ilford FP4 Plus 125 (FF), expired 1994
If you like my work, Support by buying me a coffee or a roll of film from
PayPal https://www.paypal.com/paypalme/ydcdingsite
Wise
An iterative Ising decoder for quantum error correction codes
Yuanqi Liu, Weilei Zeng, Peixiang Li, Yantong Liu, Guangyao Huang, Yingwen Liu, Dongyang Wang, Junjie Wu, Lingling Lao
https://arxiv.org/abs/2606.12301 https://arxiv.org/pdf/2606.12301 https://arxiv.org/html/2606.12301
arXiv:2606.12301v1 Announce Type: new
Abstract: The Ising framework maps the decoding problem in quantum error correction onto ground-state optimization of a classical Hamiltonian, in which $X$-$Z$ error correlations enter as cross terms. Under phenomenological depolarizing noise, the exact joint formulation contains up to 8-body interactions for the toric code and 10-body for the $6.6.6$ color code. These high-order terms degrade solver convergence, inflate runtime, and raise the auxiliary spin overhead when embedding into native 2-body Ising hardware. In this work, we propose the iterative low-order decoding (ILOD) algorithm, which alternates between $X$- and $Z$-type sub-Hamiltonians, approximating cross-type correlations through Bayesian priors that reweight each type's couplings using the other type's inferred error configuration. This halves the maximum body count of interaction terms in the Hamiltonian, accelerating the solver, restoring convergence at larger code distances, and reducing the total spin count for 2-body embedding by a factor of $2.5$. For the toric code, ILOD attains a threshold of $4.73%$ versus $4.83%$ for the joint formulation, with the empirical runtime ratio scaling as $(0.81)^d$. For the $6.6.6$ color code, their thresholds agree within statistical uncertainty for small code distances, and ILOD remains convergent for larger distances where the joint formulation fails to converge despite a larger annealing budget.
toXiv_bot_toot
Made it to Italy! Our first night was at La Posta Vecchia, a lovely seaside hotel in a villa restored by J. Paul Getty in the 1960s. It's decorated with some beautiful pieces including this fine Piranesi map, the Ichnographia Campi Martii. There's a small museum for the 2nd c. BC Roman villa in the basement.