- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes ORDO-GS, a post-training compression framework for dynamic 3DGS, aiming to improve rate–distortion performance by considering the rendering sensitivity of Gaussian attributes and the redundancy among primitives. The paper first introduce a render-space observability analysis based on the rendering Jacobian to characterize the sensitivity of different attribute groups, revealing a mismatch between their storage costs and rendering importance. Then the render-aware structural reduction strategy combines reconstruction-gradient-based pruning with trajectory-aware Gaussian deletion and merging. A lightweight probe selects the more suitable reduction strategy for each scene, followed by teacher-guided recovery. For attribute compression, the method employs an observability-based position-precision prior with render-based calibration, together with quantization and compact neural representations for the remaining attributes. Experiments on N3DV and SelfCap demonstrate improved rate–distortion performance over existing dynamic Gaussian compression methods.
Critical strengths
- Effective Rate–Distortion Performance: The proposed method achieves favorable rate–distortion performance on both N3DV and SelfCap, consistently improving reconstruction quality while reducing storage compared with the OMG4 baseline. The experiments also demonstrate its applicability to different dynamic Gaussian representations.
- Adaptive Structural Reduction: The proposed structural reduction strategy considers both the reconstruction importance of Gaussian primitives and their potential redundancy through trajectory-aware merging. The adaptive selection between pruning and merging provides a reasonable way to accommodate different scene characteristics, and the ablation studies demonstrate the effectiveness of these design choices.
Critical weaknesses
-
Limited Ablation Studies on Structural Reduction: Although the paper provides ablations on different pruning and merging strategies, comparisons with simpler pruning baselines, such as opacity-based or random pruning followed by the same fine-tuning procedure, are missing. Such comparisons would help better isolate the benefits of the proposed structural reduction strategy from those of the subsequent recovery process. Additionally, given that the complete compression pipeline takes approximately 20 minutes per scene, a breakdown of the computational costs across different stages would be helpful for understanding the efficiency of the proposed framework.
-
Limited Novelty and Practical Benefits of Attribute Compression: The attribute compression pipeline in Section 4.3 largely builds upon established techniques. For instance, compact latent features and shared MLPs for Gaussian attribute prediction have been explored in Scaffold-GS [1], while vector quantization have been investigated in prior Gaussian compression methods. The main distinctive component is the observability-based position-precision model. However, the analytic prior is followed by render-based calibration to determine the final bit depth. Since a straightforward search over candidate bit depths could potentially achieve the same rate–distortion performance with modest computational overhead, the practical benefit of the proposed observability-based precision selection remains unclear.
[1] Lu, T., Yu, M., Xu, L., Xiangli, Y., Wang, L., Lin, D., Dai, B.: Scaffold-gs: Structured 3d gaussians for view-adaptive rendering. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2024)
Questions for authors
-
Could the authors provide a comparison against a simpler structural reduction baseline, such as opacity-based pruning followed by the same teacher-guided fine-tuning procedure under an identical primitive budget and optimization schedule? This would help clarify how much of the reconstruction improvement comes from the proposed pruning and merging strategy rather than the subsequent recovery process.
-
Could the authors clarify the key methodological contributions of the attribute compression pipeline beyond existing neural attribute coding and quantization techniques? Additionally, please provide a comparison of the total computational cost between the proposed observability-guided position-precision selection and a straightforward render-based bit-depth search, including the overhead of observability estimation.
3 comments
Thanks for the response. The authors have provided additional clarifications on the methodological details, which have addressed most of my concerns. I will raise my rating to Weak Accept.
Thank you for taking the time to review our responses and additional results. We appreciate your constructive feedback and your positive reassessment of our work.
Structural reduction, attribute compression, and efficiency
We appreciate your recognition of the rate–distortion improvements, transfer across representations, and adaptive structural reduction. We have completed the requested pruning and timing comparisons, with additional evidence on the contribution of attribute compression.
W1-1 / Q1. Structural selection improves recovered quality. ORDO-GS gains 0.518/0.234 dB over opacity/random pruning after the same 16K teacher-guided recovery, outperforming random pruning in all six scenes. The table reports N3DV six-scene mean PSNR at 90K before attribute compression (three-run mean ± standard deviation; 500K teacher: 32.77 dB):
ORDO-GS exceeds both baselines' 16K mean PSNR with one quarter of the recovery iterations. At 4K, it leads both by 0.79 dB and wins in all six scenes:
The submitted ablations test deletion scores and reduction operators (Table 4), as well as branch selection, recovery, and attribute coding (Table 5).
We further separate the two-stage contributions by encoding each method's recovered models with both codecs, keeping recovery fixed. Entries are six-scene mean PSNR gains on SelfCap/90K:
W1-2. Per-stage computational cost. Thank you for suggesting this analysis. A 250K run on corgi2 takes 13.7 minutes on an RTX 4090. We have included the stage breakdown in Table S5 of the revised manuscript (Appendix C.5):
W2-1 / Q2-1. Methodological contribution of attribute compression. We introduce render-space observability as a diagnostic tool for understanding and compressing dynamic Gaussian representations. The analysis identifies positions as precision-critical despite their low storage cost, while temporal and appearance attributes tolerate more aggressive compression (Table 1). We further derive an analytic model that predicts rendering distortion from position quantization and yields scene-specific precision estimates for a given quality tolerance (Section 4.3).
Measured observability improves distortion prediction across dynamic Gaussian representations (Table S7). At 16 bits, the cross-scene Spearman correlation for FTGS-family models increases from 0.769 with count/range prediction to 0.993 with the full model. The precision prior also generalizes to 4DGS and Swift4D, agreeing with codec-calibrated bit depths to within two bits in all 24 models (Appendix C.8).
The resulting codec improves quality and reduces storage over OMG4 on the same OMG4-selected and recovered models:
We have also expanded Related Work to discuss connections to prior neural attribute-prediction methods, including Scaffold-GS.
W2-2 / Q2-2. Cost of position-precision selection. Calibration checks and refines the model's predicted precision against the rendering-quality target. Prior-initialized calibration reaches the same final precisions as ascending render-based search with 24.0% less total selection time, including observability estimation. Both searches use the same candidate bit depths, training queries, and PSNR tolerance on the twelve FTGS-family scenes:
More broadly, the prediction results discussed in W2-1 (Table S7 and Appendix C.8 of the revised manuscript) validate the quantitative relationship between rendering sensitivity, position precision, and rendering distortion across scenes and representations. This relationship provides scene-specific precision estimates that let calibration find the same final bit depths in less time.