Pith. sign in

REVIEW 2 cited by

NeuralVDB: High-resolution Sparse Volume Representation using Hierarchical Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.04448 v2 pith:DLAX5SLC submitted 2022-08-08 cs.LG cs.CVcs.GR

classification cs.LGcs.CVcs.GR
keywords neuralcompressionneuralvdbdatasparsestructurevolumesfields
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce NeuralVDB, which improves on an existing industry standard for efficient storage of sparse volumetric data, denoted VDB [Museth 2013], by leveraging recent advancements in machine learning. Our novel hybrid data structure can reduce the memory footprints of VDB volumes by orders of magnitude, while maintaining its flexibility and only incurring small (user-controlled) compression errors. Specifically, NeuralVDB replaces the lower nodes of a shallow and wide VDB tree structure with multiple hierarchical neural networks that separately encode topology and value information by means of neural classifiers and regressors respectively. This approach is proven to maximize the compression ratio while maintaining the spatial adaptivity offered by the higher-level VDB data structure. For sparse signed distance fields and density volumes, we have observed compression ratios on the order of 10x to more than 100x from already compressed VDB inputs, with little to no visual artifacts. Furthermore, NeuralVDB is shown to offer more effective compression performance compared to other neural representations such as Neural Geometric Level of Detail [Takikawa et al. 2021], Variable Bitrate Neural Fields [Takikawa et al. 2022a], and Instant Neural Graphics Primitives [M\"uller et al. 2022]. Finally, we demonstrate how warm-starting from previous frames can accelerate training, i.e., compression, of animated volumes as well as improve temporal coherency of model inference, i.e., decompression.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. INRet: A General Framework for Accurate Retrieval of INRs for Shapes

    cs.LG 2025-01 conditional novelty 6.0 of 10

    A framework that embeds implicit neural representations of 3D shapes, including feature-grid architectures, into a common space for accurate shape retrieval.

  2. FlameForge: Combustion of Generalized Wooden Structures

    cs.GR 2024-12 conditional novelty 5.0 of 10

    A voxel-based combustion simulator for arbitrary wooden structures that matches the general shape of measured temperature and mass-loss curves from a real burning-block experiment, with two-way coupling to deformation.

Pith tools