- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents an ultrafast textured surfel rendering framework that combines neural appearance learning with explicit texture atlas baking. It further introduces a Beta-kernel falloff regularizer and an optimized ray-surfel intersection formulation to reduce primitive count and rendering overhead. Extensive experiments demonstrate impressive rendering speed and competitive visual quality.
Critical strengths
The paper presents a well-engineered rendering framework with substantial practical improvements in rendering efficiency and perceptual quality. The experimental evaluation is comprehensive, covering numerous baselines, detailed ablations, hardware-matched rendering comparisons, and quality–speed trade-offs. The implementation details are also well documented.
Critical weaknesses
-
Limited novelty of the individual components. The proposed framework largely builds upon existing techniques, including NeST-Splatting, Beta-Splatting, FastGS, neural texture baking, and conventional perspective-correct interpolation. Although their integration is effective, the fundamental methodological novelty remains somewhat limited.
-
Insufficient isolation of the contributions relative to the closest prior work. Since the implementation builds upon NeST-Splatting, a direct comparison incorporating the same baking and rendering optimizations into that baseline would better establish the contributions of the proposed representation and regularization.
-
Memory and rendering-quality trade-offs. The substantial frame-rate improvements come with considerably larger texture storage than competing sparse methods. Furthermore, the default renderer disables mipmapping, raising concerns about texture aliasing and temporal stability under challenging viewing conditions.
Questions for authors
- Could the authors provide a controlled comparison against NeST-Splatting equipped with the same texture baking, atlas finetuning, and rendering optimizations?
- How does the proposed method compare with FastGS and Speedy-Splat under matched rendering quality and GPU memory budgets?
- Could the authors evaluate rendering performance and temporal stability across different GPU classes, image resolutions, and camera-motion conditions, particularly with and without mipmapping?
Reply to Reviewer NcgU
We thank the reviewer for the specific requests. Each of the three questions asks for a measurement, and the revised PDF provides them in the new Appendix M, in blue.
W1, novelty. We agree that the method combines known components, and the paper credits each of them. The contribution we claim is the pipeline that turns a neural appearance model into a static per-primitive texture at no loss: the view-independence constraint on the residual, the bake, and the finetune in which the atlas exceeds its network (Table 3; Table 13 shows that training the network longer does not). To our knowledge, this has not been done for splatting primitives before. Each remaining component is measured in isolation: the kernel, the prior, and the closed-form intersection in Table 2, the density criterion in Table 16, and the whole chain in Table 22.
W2 / Q1, NeST-Splatting with our baking and renderer. We would gladly have run this comparison, but NeST-Splatting decodes appearance per pixel in screen space from the blended features and the view direction (their Eq. 5), so it has no static texel values to bake; making the appearance bakeable is the change our method introduces. The network is also the largest cost of its renderer, so the rendering optimizations alone would not move its frame rate considerably. The closest controlled comparison is our own neural model before baking, which is NeST-style rendering of the same surfels: 111 to 155 FPS against 1479 to 2392 FPS baked, at 0.24 to 0.47 dB lower quality than the finetuned atlas (Tables 3 and 22).
W3 / Q2, storage and matched quality. Table 23 compares at equal total bytes on four scenes: with the atlas sized to the released FastGS model we keep the LPIPS and SSIM lead within 0.12 dB PSNR, at 1.4 to 1.9 times its hardware frame rate. Matching quality exactly across architectures is not possible, so we report configurations slightly above and slightly below FastGS instead. At PSNR parity on the benchmark means we run at 1.2 to 1.8 times FastGS's frame rate, and no FastGS configuration reaches our LPIPS. A sparser variant with 27 to 39 percent fewer primitives is 0.12 to 0.32 dB below our paper model and still ahead of FastGS in LPIPS (Table 23).
Q3, GPU classes, resolutions, motion, mipmapping. Table 24 reports HD (1920 wide) and 4K (3840 wide) on the RTX 5090 on both rasterizers. On the hardware rasterizer we are the fastest of the three methods for every scene at both resolutions, and our margin over FastGS and Speedy-Splat is larger at 4K than at HD. On the software path our fragment is more expensive and we fall behind at 4K, which we now state. Table 25 adds an Apple M3 Pro laptop at three resolutions, where we are fastest or tied at the evaluation resolution on all four scenes.
For temporal stability under camera motion, the demo linked below can be orbited with and without the mip chain, and the split-screen videos of the supplementary material show the paper's renderer in motion against FastGS and Nexels. Appendix E.4 explains why mipmapping is off by default. At the evaluation resolution one pixel spans about one texel, so the atlas is barely minified. Sampling one mip level finer than the pixel footprint gives the same quality as no mipmapping; sampling at the footprint's own level costs 0.32 dB, because the texels were finetuned at the full atlas resolution (mip level 0). An anonymous demo at https://bitymi.github.io/mip-demos/ renders the paper's models with a six-level atlas chain and a toggle between anisotropic filtering and plain full-resolution sampling; the per-pixel mip modes cost 18 to 22 percent of the frame on the laptop and nothing on the 5090. Anisotropic filtering removes the texture's share of the aliasing; the primitives' own aliasing is shared by all splatting methods and would call for Mip-Splatting-style filtering, which we consider outside the scope of this work.