arXiv Machine Learning

Neural Residual Modeling for Scientific Data Compression under Guaranteed Error Bounds

The paper introduces a new compression pipeline for scientific simulation data that combines Residual Vector Quantization (RVQ) with a U‑Net post‑processing network to correct pixel‑space residuals, followed by a Guaranteed Autoencoder (GAE) that enforces block‑wise error bounds. The U‑Net is trained to predict spatially structured residuals, addressing limitations of latent‑space only approaches. Experiments on S3D, JHTDB, and E3SM datasets show improved NRMSE and compression ratios compared to RVQ alone while maintaining strict error guarantees.

arXiv Machine Learning
Jul 2

Efficient Compression of Structured and Unstructured Volumes via Learned 3D Gaussian Representation

arXiv:2607. 01164v1 Announce Type: new Abstract: Recent work has shown that implicit neural representations (INRs) can be trained to effectively compress structured and unstructured volume data, allowing for direct data querying with a reduced memory footprint.

By Landon Dyken, Sharmistha Chakrabarti, Nathan Debardeleben, Steve Petruzza, Qi Wu, Will Usher, Sidharth Kumar
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
Sep 17

Generalizable Neural Reconstruction of High-Fidelity Surfaces via Sparse Volumetric Representations

The paper introduces SVRecon, a generalizable neural surface reconstruction framework that uses sparse volumetric representations to achieve high-resolution 3D reconstruction. It employs a two-stage architecture: first predicting occupied voxels with an occupancy network, then rendering only within those regions using specialized sparse algorithms. This approach allows reconstruction at resolutions up to 512³ on 32 GB hardware, producing smoother and more precise surfaces, especially in sparse-view scenarios.

By Aoxiang Fan, Corentin Dumery, Nicolas Talabot, Ming Xu, Hieu Le, Pascal Fua
Hugging Face Trending Papers
Sep 3

Sparse auto-regressive modeling for scene generation from multi-view images

The paper introduces SPAR3S, a sparse voxel‑aligned 3D latent generative model that completes 3D scenes from sparse, unconstrained multi‑view images. By representing only occupied voxels in a compact latent space and training a masked autoregressive transformer with photometric supervision via differentiable 3D Gaussian Splatting, the method predicts missing latent tokens and spatial support, enabling efficient and spatially consistent generation of unseen regions. Experiments on synthetic indoor scenes and RealEstate10k demonstrate higher novel‑view quality and real‑world applicability compared to prior work.

arXiv Machine Learning
Sep 4

Sparse auto-regressive modeling for scene generation from multi-view images

The paper introduces SPAR3S, a sparse voxel‑aligned 3D latent generative model that completes 3D scenes from sparse, unconstrained multi‑view images. It learns a compact voxel‑aligned latent space using photometric supervision via differentiable 3D Gaussian Splatting, and employs a masked autoregressive transformer to predict missing voxel occupancy and latent tokens. Experiments on synthetic indoor scenes and RealEstate10k show that SPAR3S achieves higher novel‑view quality than prior methods and generalizes to real‑world data.

By Thomas Lucas, Maxime Pietrantoni, Philippe Weinzaepfel, Wonjune Cho, Bardienus Pieter Duisterhof, Vincent Leroy, Jerome Revaud