Skip to content
Preprint

Fixed-Budget Gaussian Volume Encoding with Structure-Aware Allocation

Aug 2026 · 1 citation · 47 references
Computer Science

TL;DR

This work encodes scalar fields as anisotropic Gaussian primitives under a fixed budget that serves every subsequent visualization state - supporting post-hoc transfer-function, colormap, lighting, and viewpoint changes without re-encoding.

Abstract

Scientific simulations often produce scalar volumes faster than they can be stored, transferred, and loaded, while in situ reduction must use only a limited share of simulation resources. This work encodes scalar fields as anisotropic Gaussian primitives under a fixed budget. The complete primitive set is allocated analytically from local field structure, including position, orientation, and shape, then refined directly against the scalar field without densification, pruning, or count changes. The selected budget determines encoded storage before refinement and, together with the iteration schedule, provides a controllable refinement-time budget. In a controlled benchmark, truncation-aware field evaluation reduces encoding time by up to 51x; 1.4 million Gaussians encode a billion-voxel volume in at most four minutes on one desktop GPU, with reduced-iteration refinement completing in under one minute. Across five datasets spanning 2.1 million to 1.1 billion evaluated voxels, compression-useful configurations achieve 15.0-38.7 dB PSNR at compression ratios from 2.2x to over 40,000x. Pre-encoding structure statistics characterize fields for which one-shot allocation yields limited gains from additional capacity. Because primitives retain scalar attributes rather than baked appearance, a single compact model serves every subsequent visualization state - supporting post-hoc transfer-function, colormap, lighting, and viewpoint changes without re-encoding.

View source

Similar papers

#machine learning Preprint Sep 2026

3D Field Data Reduction with Adaptive Sample-Based Gaussian-Encoded Reconstruction

Across structured, unstructured, and particle data, the sample-based formulation improves reconstruction accuracy with measurably fewer primitives in comparison to prior formulations, achieving up to 4.8 dB higher PSNR with an approximate 44x reduction in primitive count.

Michael R. Martin, J. Insley, Victor A. Mateevitsi et al. · 0 citations
Preprint Aug 2026

FaCTz: Fast Critical-Point and Topology-Aware GPU Compression for Scientific Vector Fields

FaCTz is presented, the first GPU-based error-bounded lossy compressor that guarantees critical-point preservation and provides a block-wise mode optimized for throughput and a speculative per-point mode optimized for compression ratio.

Mingze Xia, Yu-Xiao Li, Sheng Di et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Precision As You Need: Stochastic Computing Is a Dense Adaptive Quantizer

This work builds a GPU library that emulates SC matrix multiplication at scale, exposes stream lengths as first-class kernel arguments, and evaluates SC end-to-end on image classification, object detection and instance segmentation, class-conditional image generation, and visual world-model planning.

Hao-Ran Jin, Kang-Qi Zhang, Ji-Rong Yang et al. · 0 citations
Preprint Aug 2026

Amortized Anchor Refinement for Deployable Continuous-Time 4D Gaussian Reconstruction

Continuous-time 4D reconstruction remains impractical on standalone XR headsets. Per-scene optimization demands deployment-infeasible compute, and lower budgets cause collapse rather than degrade gradually. Feed-forward prediction is fast, but struggle to recover scene-specific detail. We present Amortized Anchor Refin...

Jin-Gong Chen, Qingwen Zhang, Sanghyeon Jun et al. · 0 citations
Preprint Sep 2026

Octree-based Video Representation

Video models commonly use uniform grids even though visual complexity varies substantially across space and time. We introduce OctVideo, which approximates a video clip with an octree. This hierarchy recursively partitions a spatio-temporal volume into eight subvolumes, so that smooth regions remain coarse while detail...

Run-Gui Zhou, Chuan-Pei Zhou, Yuk-Kit Hou et al. · 0 citations
Jul 2026

Efficient GPU-Accelerated Adaptive Minimum Cost Seed Selection

GAAS is a GPU-accelerated method that integrates novel algorithmic and GPU-aware system designs to solve AMCSS in minutes and is over an order of magnitude faster than parallel CPU and GPU baselines, while the seed cost is among the lowest.

Gongyao Guo, Chen Feng, Yiran Li et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.