Papers › Compact 3D Scene Representation via Self-Organizing Gaussian Grids

Compact 3D Scene Representation via Self-Organizing Gaussian Grids

19 Dec 2023arXiv:2312.13299archive 2025-07-28

Wieland Morgenstern, Florian Barthel, Anna Hilsmann, Peter Eisert

3D Gaussian Splatting has recently emerged as a highly promising technique for modeling of static 3D scenes. In contrast to Neural Radiance Fields, it utilizes efficient rasterization allowing for very fast rendering at high-quality. However, the storage size is significantly higher, which hinders practical deployment, e.g. on resource constrained devices. In this paper, we introduce a compact scene representation organizing the parameters of 3D Gaussian Splatting (3DGS) into a 2D grid with local homogeneity, ensuring a drastic reduction in storage requirements without compromising visual quality during rendering. Central to our idea is the explicit exploitation of perceptual redundancies present in natural scenes. In essence, the inherent nature of a scene allows for numerous permutations of Gaussian parameters to equivalently represent it. To this end, we propose a novel highly parallel algorithm that regularly arranges the high-dimensional Gaussian parameters into a 2D grid while preserving their neighborhood structure. During training, we further enforce local smoothness between the sorted parameters in the grid. The uncompressed Gaussians use the same structure as 3DGS, ensuring a seamless integration with established renderers. Our method achieves a reduction factor of 17x to 42x in size for complex scenes with no increase in training time, marking a substantial leap forward in the domain of 3D scene distribution and consumption. Additional information can be found on our project page: https://fraunhoferhhi.github.io/Self-Organizing-Gaussians/

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="2312.13299")

Code

Syntology Ran 1 of 1 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 1 ran · honoured contract.

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

fraunhoferhhi/Self-Organizing-Gaussians officialmentioned on GitHubpytorch report
facebookresearch/uco3d mentioned on GitHubpytorchCC-BY-4.0 report

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

1 sample harvested; 1 ran; 1 honoured the contract we drafted; 0 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.

1ran · honoured contract

Licence: 1 of the 1 sample is 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 fraunhoferhhi/Self-Organizing-Gaussians. “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.

normalize_img fraunhoferhhi/Self-Organizing-Gaussians/compression/codec.py official repository ran · honoured contract fingerprinted licence not identified · pointer only · bb1a101c33c97d1e · report

Tasks

3D Scene Reconstruction3DGSData CompressionImage CompressionNovel View SynthesisQuantization

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Novel View Synthesis Deep Blending Self-Organizing Gaussians LPIPS 0.258 #1 of 1 Archive leaderboard report
Novel View Synthesis Deep Blending Self-Organizing Gaussians PSNR 30.35 #1 of 1 Archive leaderboard report
Novel View Synthesis Deep Blending Self-Organizing Gaussians SSIM 0.909 #1 of 1 Archive leaderboard report
Novel View Synthesis Deep Blending Self-Organizing Gaussians Size (MB) 16.8 #1 of 1 Archive leaderboard report
Novel View Synthesis Mip-NeRF 360 Self-Organizing Gaussians LPIPS 0.22 #6 of 14 Archive leaderboard report
Novel View Synthesis Mip-NeRF 360 Self-Organizing Gaussians PSNR 27.64 #6 of 14 Archive leaderboard report
Novel View Synthesis Mip-NeRF 360 Self-Organizing Gaussians SSIM 0.864 #6 of 14 Archive leaderboard report
Novel View Synthesis Mip-NeRF 360 Self-Organizing Gaussians Size (MB) 40.3 #6 of 14 Archive leaderboard report
Novel View Synthesis NeRF Self-Organizing Gaussians LPIPS 0.031 #2 of 12 Archive leaderboard report
Novel View Synthesis NeRF Self-Organizing Gaussians PSNR 33.7 #2 of 12 Archive leaderboard report
Novel View Synthesis NeRF Self-Organizing Gaussians SSIM 0.969 #2 of 12 Archive leaderboard report
Novel View Synthesis NeRF Self-Organizing Gaussians Size (MB) 4.1 #2 of 12 Archive leaderboard report
Novel View Synthesis Tanks and Temples Self-Organizing Gaussians LPIPS 0.208 #4 of 10 Archive leaderboard report
Novel View Synthesis Tanks and Temples Self-Organizing Gaussians PSNR 25.63 #4 of 10 Archive leaderboard report
Novel View Synthesis Tanks and Temples Self-Organizing Gaussians Size (MB) 21.4 #4 of 10 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

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