Papers › Representing Long Volumetric Video with Temporal Gaussian Hierarchy

Representing Long Volumetric Video with Temporal Gaussian Hierarchy

12 Dec 2024arXiv:2412.09608archive 2025-07-28

Zhen Xu, Yinghao Xu, Zhiyuan Yu, Sida Peng, Jiaming Sun, Hujun Bao, Xiaowei Zhou

This paper aims to address the challenge of reconstructing long volumetric videos from multi-view RGB videos. Recent dynamic view synthesis methods leverage powerful 4D representations, like feature grids or point cloud sequences, to achieve high-quality rendering results. However, they are typically limited to short (1~2s) video clips and often suffer from large memory footprints when dealing with longer videos. To solve this issue, we propose a novel 4D representation, named Temporal Gaussian Hierarchy, to compactly model long volumetric videos. Our key observation is that there are generally various degrees of temporal redundancy in dynamic scenes, which consist of areas changing at different speeds. Motivated by this, our approach builds a multi-level hierarchy of 4D Gaussian primitives, where each level separately describes scene regions with different degrees of content change, and adaptively shares Gaussian primitives to represent unchanged scene content over different temporal segments, thus effectively reducing the number of Gaussian primitives. In addition, the tree-like structure of the Gaussian hierarchy allows us to efficiently represent the scene at a particular moment with a subset of Gaussian primitives, leading to nearly constant GPU memory usage during the training or rendering regardless of the video length. Extensive experimental results demonstrate the superiority of our method over alternative methods in terms of training cost, rendering speed, and storage usage. To our knowledge, this work is the first approach capable of efficiently handling minutes of volumetric video data while maintaining state-of-the-art rendering quality. Our project page is available at: https://zju3dv.github.io/longvolcap.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2412.09608")

Code

Syntology Ran 0 of 16 code samples harvested from 1 repository linked to this paper; 16 have no recorded run.

By repository: official repository: 16 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

16 samples harvested; 0 ran; 0 honoured the contract we drafted; 16 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

16unverified

Licence: 0 of the 16 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from dendenxu/fast-gaussian-rasterization. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

FORMAT_CUDART_ERROR dendenxu/fast-gaussian-rasterization/fast_gauss/cuda_utils.py official repository unverified MIT (permissive) · 0f8fe090d005efe8 · report
eval_shfs_4d_00 dendenxu/fast-gaussian-rasterization/fast_gauss/sh_utils.py official repository unverified MIT (permissive) · 1787a71af287b1ef · report
eval_shfs_4d_10 dendenxu/fast-gaussian-rasterization/fast_gauss/sh_utils.py official repository unverified MIT (permissive) · 39fe33843594b6cf · report
eval_shfs_4d_20 dendenxu/fast-gaussian-rasterization/fast_gauss/sh_utils.py official repository unverified MIT (permissive) · cc01764c972d1217 · report
line dendenxu/fast-gaussian-rasterization/fast_gauss/console_utils.py official repository unverified MIT (permissive) · 9da3d705ee4df35f · report
load_shader_source dendenxu/fast-gaussian-rasterization/fast_gauss/gl_utils.py official repository unverified MIT (permissive) · e70037d52fdf2b4f · report
normalize dendenxu/fast-gaussian-rasterization/fast_gauss/math_utils.py official repository unverified MIT (permissive) · 4efe614e756cc631 · report
normalize_sum dendenxu/fast-gaussian-rasterization/fast_gauss/math_utils.py official repository unverified MIT (permissive) · 2495f2bb0cc57462 · report
path dendenxu/fast-gaussian-rasterization/fast_gauss/console_utils.py official repository unverified MIT (permissive) · 8c1aa0c6fe0ecaa2 · report
point_padding dendenxu/fast-gaussian-rasterization/fast_gauss/math_utils.py official repository unverified MIT (permissive) · 5f771c4bdef631b9 · report
red dendenxu/fast-gaussian-rasterization/fast_gauss/console_utils.py official repository unverified MIT (permissive) · 0a41221621cd471c · report
register_memory dendenxu/fast-gaussian-rasterization/fast_gauss/cuda_utils.py official repository unverified MIT (permissive) · 672c292014882d13 · report
rgb2sh0 dendenxu/fast-gaussian-rasterization/fast_gauss/gaussian_utils.py official repository unverified MIT (permissive) · a39fb48b94ddfa97 · report
sh02rgb dendenxu/fast-gaussian-rasterization/fast_gauss/gaussian_utils.py official repository unverified MIT (permissive) · f29f26764ed7c042 · report
to_cuda dendenxu/fast-gaussian-rasterization/fast_gauss/data_utils.py official repository unverified MIT (permissive) · 9b018a4c2d6e5fb1 · report
unregister_memory dendenxu/fast-gaussian-rasterization/fast_gauss/cuda_utils.py official repository unverified MIT (permissive) · 167e33b8202e20dc · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections