- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes FDC-GS, a method for compression of 3D Gaussian Splatting with a focus on modeling of high and low frequency components. It relies on 3 components:
- It computes a saliency mask on the high-frequency images. The final loss is applied differently on low-frequency, high-frequency, and salient pixels.
- A progress variable gradually increases and controls the entropy model.
- An additional loss to regularize the number of anchors.
Critical strengths
- The method is evaluated in depth, with qualitative, quantitative, and ablation results, on numerous datasets and against many baselines.
- The proposed frequency-modeling is implemented on both hash- and triplane-based representations, bringing confidence that the proposed method transfers across architectures and consistently brings improvements.
Critical weaknesses
- The information theory and 3DGS backgrounds are insufficiently discussed and poorly introduced. This includes terms such as anchors, conditional likelihood family, residuals, level masks, all of which are commonly used terms but should be clearly defined in this context. Relevant references are discussed approximately and in technical terms that are not explained. For instance, in the first paragraph, Scaffold-GS is described as employing "entropy coding to reduce bitstream size", which is at least not directly true, and "in these methods, the accuracy of probability estimation is a key factor", which does not make sense since there is no probabilistic or entropy modeling in this paper. All in all, these inaccuracies make the paper needlessly hard to read.
- The improvement over previous methods is somewhat limited, both in terms of memory and visual accuracy.
- It seems rather handcrafted and poorly justified to split the image into low-frequency, high-frequency and salient regions with hard masks.
Questions for authors
- What justifies having two levels for low and high frequencies, rather than several bins or some more continuous representation?
2 comments
Clarifications
Background. Thank you for these clarifications, and the revised paper looks to have improved. I am not directly familiar with most of the methods listed, so I cannot check the rest of the paper. However, the one that I am familiar with (Scaffold-GS), was described in misleading terms, which is not reassuring.
Improvements. These remain very small on all metrics except on BungeeNeRF, and visually the difference is also very small.
Saliency mask. I see, thanks for clarifying.
The paper is evaluated in depth and seems technically sound, but overall I still have limited understanding of the method despite careful reading. This is a borderline paper, but I am still leaning slightly towards rejection and will keep my rating.
Response to Reviewer gm47
C1. Background and terminology
We agree that the original text conflated anchor representation with the entropy codecs built on it. Scaffold-GS introduces anchors and shared features but does not perform the learned entropy coding discussed here; probability estimation affects R--D performance in subsequent codecs such as HAC, HAC++, ContextGS, and HEMGS.
We now define the essential terms at first use: an anchor groups nearby Gaussians and shared attributes; a coding level contains anchors first activated by a nested mask; a residual is the quantized difference from an available decoded reference; and a conditional likelihood family is the probability model used for entropy coding. These corrections appear in the Introduction and Sec. 3.1 (lines 51--52 and 214--222).
C2. Magnitude and scope of the improvement
FDC-GS achieves clear gains in its directly optimized PSNR--size R--D objective, while LPIPS gains are limited because LPIPS is not part of the training loss. Across four datasets, average BD-PSNR improves by 0.097 dB over HAC++ and 0.442 dB over TC-GS, demonstrating transfer across hash-grid and triplane contexts. Our objective jointly optimizes pixel-domain reconstruction and bitrate, so its gain is primarily reflected in PSNR and size; LPIPS instead measures learned perceptual-feature distance and is not directly constrained. SSIM remains broadly stable, indicating that the R--D gain is not obtained by substantially sacrificing structural similarity. We now state the claim as improved PSNR--size efficiency rather than uniform improvement of every metric (lines 42--46, 625--647, and 710--716).
Q1/C3. Why low/high components and a saliency mask instead of several hard bins or a continuous representation?
FDC-GS does not hard-quantize the spectrum into two coding levels. It uses the continuous decomposition Ilow=Gσ∗I and Rhf=I−Ilow; the saliency mask only suppresses weak spatial fluctuations within the residual and does not define a hard frequency band.
These two supervision signals are aligned with the multi-level PCGS hierarchy: low frequency supervises S0, while annealing and level weights progressively distribute high-frequency supervision over S1,…,SL−1. Additional spectral bins would require arbitrary cutoffs and bin-to-level rules without addressing the base/refinement mismatch. Ablations support this design: removing the saliency mask, high-frequency supervision, annealing, or level alignment increases average BD-BR by 16.95%, 15.87%, 9.29%, and 19.32%, respectively. Secs. 3.2--3.3 clarify the decomposition and multi-level alignment (lines 273--413).