mlsanityData to 7 Oct 2026

GaussianPOP: Principled Simplification Framework for Compact 3D Gaussian Splatting via Error Quantification

arXiv 2602.06830 ↗First posted 6 Feb 2026cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Existing 3D Gaussian Splatting simplification methods commonly use importance scores, such as blending weights or sensitivity, to identify redundant Gaussians. However, these scores are not driven by visual error metrics, often leading to suboptimal trade-offs between compactness and rendering fidelity. We present GaussianPOP, a principled simplification framework based on analytical Gaussian error quantification. Our key contribution is a novel error criterion, derived directly from the 3DGS rendering equation, that precisely measures each Gaussian's contribution to the rendered image. By introducing a highly efficient algorithm, our framework enables practical error calculation in a single forward pass. The framework is both accurate and flexible, supporting on-training pruning as well as post-training simplification via iterative error re-quantification for improved stability. Experimental results show that our method consistently outperforms existing state-of-the-art pruning methods across both application scenarios, achieving a superior trade-off between model compactness and high rendering quality.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 26 of its 33 references that are in the map. First posted on arXiv 6 Feb 2026.

Builds on

26 of 33 references.

References · 26

  1. 20233D Gaussian Splatting for Real-Time Radiance Field Renderingcited by 6,141
  2. 2023LightGaussian: Unbounded 3D Gaussian Compression with 15x Reduction and 200+ FPScited by 420
  3. 2023Compact 3D Gaussian Representation for Radiance Fieldcited by 365
  4. 2023Compressed 3D Gaussian Splatting for Accelerated Novel View Synthesiscited by 232
  5. 2024Mini-Splatting: Representing Scenes with a Constrained Number of Gaussianscited by 208
  6. 2024HAC: Hash-grid Assisted Context for 3D Gaussian Splatting Compressioncited by 202
  7. 2024Taming 3DGS: High-Quality Radiance Fields with Limited Resourcescited by 198
  8. 2023EAGLES: Efficient Accelerated 3D Gaussians with Lightweight EncodingScited by 191
  9. 2023CompGS: Smaller and Faster Gaussian Splatting with Vector Quantizationcited by 127
  10. 2024RadSplat: Radiance Field-Informed Gaussian Splatting for Robust Real-Time Rendering with 900+ FPScited by 110
  11. 2024Speedy-Splat: Fast 3D Gaussian Splatting with Sparse Pixels and Sparse Primitivescited by 90
  12. 2024PUP 3D-GS: Principled Uncertainty Pruning for 3D Gaussian Splattingcited by 85
14 more
  1. 2024CompGS: Efficient 3D Scene Representation via Compressed Gaussian Splattingcited by 80
  2. 2024End-to-End Rate-Distortion Optimized 3D Gaussian Representationcited by 71
  3. 20243DGS.zip: A survey on 3D Gaussian Splatting Compression Methodscited by 66
  4. 2024MesonGS: Post-training Compression of 3D Gaussians via Efficient Attribute Transformationcited by 54
  5. 2024LP-3DGS: Learning to Prune 3D Gaussian Splattingcited by 53
  6. 2024MaskGaussian: Adaptive 3D Gaussian Representation from Probabilistic Maskscited by 39
  7. 2025CAT-3DGS: A Context-Adaptive Triplane Approach to Rate-Distortion-Optimized 3DGS Compressioncited by 39
  8. 2025Compression of 3D Gaussian Splatting with Optimized Feature Planes and Standard Video Codecscited by 24
  9. 2025Locality-aware Gaussian Compression for Fast and High-quality Renderingcited by 24
  10. 2024Compact 3D Gaussian Splatting for Static and Dynamic Radiance Fieldscited by 22
  11. 2024ELMGS: Enhancing memory and computation scaLability through coMpression for 3D Gaussian Splattingcited by 19
  12. 2024F-3DGS: Factorized Coordinates and Representations for 3D Gaussian Splattingcited by 18
  13. 2025Optimized Minimal 3D Gaussian Splattingcited by 16
  14. 2025Improving 3D Gaussian Splatting Compression by Scene-Adaptive Lattice Vector Quantizationcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.