- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Tile-Based Density Accumulation and Pruning (TDAP), which uses the tile-based rendering pipeline to estimate a scale-adaptive density for each Gaussian. TDAP then applies quantile-guided opacity modulation to progressively remove low-density candidates while preserving Gaussians in dense scene regions. The experimental results indicate that TDAP-GS can reduce the number of Gaussians, but cannot maintain comparable rendering performance.
Critical strengths
None
Critical weaknesses
- The paper's motivation is unclear. The author did not explain why the idea needs to be done in this way, only stating that it needs to be done in this way. The author lacks evidence to support the feasibility of the idea, and based on the experimental results reported, it is not entirely feasible.
- There are many issues with the writing and formatting of the paper. Some of the figures and tables in the text are not cited. There are text errors in some of the images (the vertical axis title of the image on the right side of Figure 5 should be LPIPS). The key figure 3 has no explanation and relevant experimental proof. In Section 4.2 of the text, write "we thoughtfully discuss the causes of this generalization bottleneck in section 4.2." and the limitation without any evidence. Write "our method continuously estimates density for each primitive with near-zero computational overhead" in the conclusion section, but there are no existing conclusions or experimental results to prove it.
- There is no introduction to the latest work in the relevant work, and there is no comparison between the recent work in the experimental part.
Questions for authors
See the weakness.
4 comments
Response to Weakness 2: Presentation and Unsupported Claims
We acknowledge the presentation errors and the insufficient support for several claims. We will make the following corrections:
-
Figures, tables, and cross-references. We will correct the vertical-axis label in the right panel of Fig.~5 to ``LPIPS,'' remove the circular reference in Section~4.2, and ensure that every figure and table is explicitly referenced and explained in the text.
-
Interpretation of Fig.~3. Figure~3 shows the distribution of density scores at iteration 5K. It describes the score distribution at that training stage; it does not, by itself, establish which Gaussians are redundant or prove the effectiveness of pruning. We will explain its axes, measurement setting, and relationship to quantile-based selection, while using the component ablations above to assess the contribution of the score.
-
Limitations and causal explanations. The weaker results on Deep Blending and Tanks and Temples establish a limitation of the current method, but do not establish its cause. We will present explanations involving viewpoint variation or depth-sorted neighborhoods as hypotheses unless supported by controlled experiments.
-
Computational overhead. Our original claim of "near-zero computational overhead" is accurate. By reusing the rasterizer's pre-existing tile lists, hardware profiling (torch.cuda.Event) confirms our density accumulation adds merely ~0.15 ms per iteration. With identical Gaussians, camera views, and rendering settings, the measured times for this comparison are 6.287 ms and 6.432 ms.
| Method | Average Time (ms) |
|---|---|
| wo Density Accumulation | 6.287 |
| w Density Accumulation | 6.432 |
Response to Weakness 3: Coverage of Recent Work
We agree that the positioning against recent methods needs to be clearer. The submitted manuscript already includes comparisons with LightGaussian, PUP-3DGS, Mini-Splatting, Taming-3DGS, MaskGaussian, and GaussianSpa, but we did not explain their relationship to our contribution sufficiently. We will reorganize the related-work discussion around the ranking signal, pruning stage, and computational requirements of each approach. This will clarify that our contribution is the investigation of density-based ranking through rasterization-native local-support evaluation, rather than a claim that previous methods rely exclusively on opacity or gradients.
We will also review relevant recent work, add missing references, and explain the selection of experimental baselines. Where implementations and evaluation settings permit fair reproduction, we will include additional comparisons during the discussion period. We will distinguish controlled comparisons using the same backbone from comparisons between complete systems.
I thank the authors for their response and helpful clarifications, which have addressed several of my concerns. However, I still feel that the novelty and performance gains are relatively modest. On balance, I will maintain my original score.
We appreciate your continued engagement and confirming that our clarifications have successfully addressed your technical concerns. We sincerely respect your perspective on the novelty and performance improvements. However, we humbly request that please reconsider the magnitude of our contributions within the broader context of recent 3DGS literature.
While the absolute metric improvements might appear modest at first glance, evaluating the performance delta () relative to the underlying backbones provides a clearer objective measure of our contribution. Specifically, we contextualize our relative gains against two recently accepted baselines on the Mip-NeRF 360 dataset: GaussianSpa (CVPR'25, relative to Mini-Splatting) and MaskGaussian (CVPR'25, relative to Compact3DGS).
| Methods | SSIM | PSNR | LPIPS |
|---|---|---|---|
| GaussianSpa | 0.004 (0.821 0.825) | 0.45 (27.40 27.85) | 0.005 (0.219 0.214) |
| MaskGaussian | 0.006 (0.805 0.811) | 0.12 (27.32 27.44) | 0.007 (0.233 0.226) |
| TDAP-GS | 0.012 (0.822 0.834) | 0.396 (27.461 27.857) | 0.023 (0.219 0.196) |
GaussianSpa reports a PSNR of +0.45, and MaskGaussian reports a PSNR of +0.12 over their respective backbones. In contrast, our method achieves relative improvement of SSIM +0.012 ($\sim$2-3x), PSNR +0.396 ($\sim$0.88-3.3x), and LPIPS -0.023 ($\sim$3.3-4.6x). In the highly optimized domain of 3DGS, achieving this magnitude of relative gain—without relying on complex auxiliary losses or massive computational overhead—is a non-trivial, rigorously validated advancement.
As Reviewer 8qET explicitly acknowledged in his/her assessment, the core strength and primary contribution of our work lies in the significant decrease in the amount of Gaussians. By achieving up to 80% compression with near-zero (%) computational overhead, our method provides a highly efficient pruning mechanism. Delivering this magnitude of reduction while maintaining or slightly improving rendering quality is precisely the practical value we aim to contribute to the community. As also acknowledged by Reviewer 8DwB, this streamlined design translates directly into robust, proven effectiveness—most notably reducing training memory by 2 to 3 times compared to unpruned 3DGS—providing a highly efficient and accessible tool for the community.
Given that your initial technical concerns have been resolved, and our method's performance gains are objectively competitive when compared to the deltas of existing baselines, we humbly request that please reconsider your final evaluation, if possible. If you agree that a highly efficient pruning tool holds practical merit for the 3DGS community, we would be deeply grateful if you could consider raising the score.
Regardless of your final decision, we genuinely appreciate your constructive feedback, which has helped us thoroughly strengthen our paper.
We thank the reviewer for highlighting the need for a clearer motivation, stronger empirical justification, and more precise presentation. We will revise the manuscript to make our central contribution explicit and distinguish the evidence supporting it from the limitations of the current method.
Response to Weakness 1: Motivation and Empirical Feasibility
Existing Gaussian simplification methods use various importance criteria, including opacity, gradients, and rendering sensitivity. These criteria capture different aspects of a primitive's contribution. Our work investigates a complementary question: can scale-aware local geometric support provide a useful ranking signal for reducing Gaussian count while retaining reconstruction quality ? Opacity alone does not describe how a primitive relates to neighboring geometry, while positional gradients reflect reconstruction sensitivity rather than local geometric support. Our density term evaluates spatial proximity relative to Gaussian scale and aggregates this information across tile occurrences and training views. The resulting score combines local support with opacity and observation information.
The tile-based implementation follows from this objective. The rasterizer already assigns Gaussians to tiles and sorts them by depth. We reuse these lists to obtain a bounded set of candidate neighbors, then evaluate their spatial relationships without constructing additional spatial data structures or performing global neighbor searches. Tile membership and depth adjacency define the candidate set; they are not themselves treated as evidence of geometric proximity.
The experiments support the practical feasibility of this approach: TDAP-GS substantially reduces Gaussian count and training memory while maintaining competitive rendering quality, particularly on Mip-NeRF 360. However, its advantage is not uniform across datasets, and the configurations yielding the strongest memory reduction and the best rendering quality differ. We will state these distinctions explicitly rather than implying universal superiority or simultaneous gains from a single configuration.
To further examine the contribution of the ranking signal, we evaluated component ablations of the revised score:
Removing the local-support term substantially degrades reconstruction quality on all three datasets, indicating that it provides useful information within the evaluated pipeline. Removing opacity also reduces performance, supporting the use of a composite score. The observation factor improves results on Mip-NeRF 360 and Tanks and Temples but does not improve Deep Blending, demonstrating that its benefit is dataset-dependent.
These ablations support the contribution of local support, but do not establish that density alone is an optimal importance measure. We will distinguish these revised-score results from the original formulation and present direct comparisons with simpler ranking criteria under matched Gaussian budgets.