- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes C$^3$Splat, a framework that exploits cross-view redundancy in latent feature compression for feed-forward 3DGS. The method is built upon CodecSplat, and further introduces causal cross-view context modeling to improve entropy coding efficiency. Specifically, it uses predicted depths and camera parameters at the decoder side to warp previously decoded features into the target view, followed by reliability-aware aggregation to construct cross-view contexts. These contexts are then used to refine the hierarchical entropy prior for more accurate probability estimation. Experiments on the 2-view RE10K and 8-view DL3DV benchmarks demonstrate improved rate-distortion performance over baseline methods. The paper further analyzes the relationship between geometric overlap and bitrate reduction, showing that higher overlap generally leads to greater coding gains.
Critical strengths
-
Efficient design and easy integration: The proposed method leverages predicted depth and camera geometry to construct cross-view contexts through simple feature warping, offering a more straightforward and geometrically grounded alternative to other complex learned cross-view interaction mechanisms. Moreover, the proposed cross-view branches can be readily integrated into pretrained compression models with minimal architectural modifications.
-
Effective experimental validation: The paper provides extensive experiments on both 2-view and 8-view benchmarks, demonstrating the effectiveness of cross-view context modeling under different settings. In particular, the entropy-only adaptation experiments isolate the bitrate savings from improved probability estimation without affecting reconstruction quality. The additional analysis of geometric overlap further supports the motivation and effectiveness of the proposed method.
Critical weaknesses
-
Limited evaluation of decoding complexity: The proposed cross-view context modeling introduces additional geometric warping, multi-reference aggregation, and entropy refinement operations. However, the paper only provides theoretical complexity analysis without reporting actual runtime measurements, making it difficult to assess the practical decoding overhead of the proposed method.
-
The ablation studies could be deeper: Although the paper provides ablation studies on several key components, the experimental analysis remains somewhat limited. For example, the effectiveness of the proposed causal view ordering strategy is not sufficiently investigated. The impact of the number of input views on compression performance also remains unclear.
Questions for authors
-
Could the authors compare different view ordering strategies, such as random ordering and overlap-aware ordering, to justify the proposed strategy or evaluate the robustness of the method to different decoding orders?
-
Could the authors provide additional experiments with different numbers of input views on the same dataset to investigate how the compression gains scale with the number of available reference views? If supported by the pretrained models, an evaluation using the original CodecSplat and entropy-only C³Splat checkpoints without additional training could provide a lightweight analysis of this behavior.
2 comments
Thank you for your response. The additional experiments further demonstrate the robustness of the proposed method and have addressed my concerns. I will maintain my positive rating.
1. Practical Encoding and Decoding Complexity
We agree that actual runtime measurements are important for assessing the practical overhead of cross-view causal compression. We have therefore added encoding and independent decoding benchmarks across 2, 4, 8, and 16 input views, reporting runtime and peak allocated GPU memory in Appendix F (Table 10). The experiments use a deployed compression pipeline in which the encoder generates a real scene bitstream, and a separate decoder reconstructs Gaussians using only the bitstream and model parameters. On a single RTX 4090 with eight input views at λ = 256, C³Splat requires 1.018 s for encoding and 0.806 s for decoding, compared with 0.507 s and 0.361 s for CodecSplat, while introducing approximately 0.08 GiB of additional peak GPU memory at each endpoint. As analyzed in Section 4.6, the computational overhead mainly arises from constructing cross-view conditions for previously decoded reference–target pairs, whose number grows quadratically with the input-view count. However, aggregating references before condition encoding avoids repeated condition-encoder computation, and the implementation optimizations described in Appendix E further reduce unnecessary overhead without changing the probability model or bitstream. These measurements clarify the trade-off between improved compression efficiency and increased decoding latency, which we have also explicitly acknowledged in the revised manuscript.
2. View-ordering Strategies
Following the reviewer's suggestion, we have added a dedicated experiment in Section 5.3 (Table 3) comparing five decoding strategies: temporal forward, temporal reverse, medoid + random, fully random, and our proposed medoid + nearest-set ordering. All five strategies achieve the same reported PSNR at each operating point, while our ordering consistently yields the smallest bitstreams and the best overall PSNR BD-rate of −20.96% relative to CodecSplat. Temporal orderings remain close, with bitrate increases of only 0.07%–0.34%, whereas random orderings result in increases of 0.67%–1.31%. These relatively modest differences indicate that the compression gains are robust to different decoding orders, rather than relying on a particular view sequence. The ability to aggregate multiple decoded references may help reduce sensitivity to individual reference choices, while geometry-based ordering provides a consistent additional benefit. We have also clarified the deterministic view-selection procedure in Section 4.4 and Appendix E.1, which allows the encoder and decoder to reconstruct the same ordering without transmitting additional information.
Table 3. View-ordering comparison on DL3DV-Benchmark.
3. Effect of Input-view Count
We appreciate the suggestion to investigate how compression gains scale with the number of available reference views. We have added experiments with 2, 4, 8, and 16 input views on DL3DV-Benchmark, as reported in Section 5.4 (Figure 5) and Appendix H. For each view count, we independently trained a CodecSplat baseline and initialized the corresponding C³Splat model from that checkpoint, performing entropy-only adaptation while keeping the quantized latents and reconstruction path fixed. This ensures that the observed bitrate reductions arise from improved probability modeling rather than changes in reconstruction quality within each view-count setting. As shown below, at λ = 1024, the bitrate savings increase from 4.55% with 2 views to 23.67% with 16 views. Across all seven rate-control operating points, the corresponding PSNR BD-rate reductions are −1.77%, −5.72%, −12.00%, and −16.92%, respectively. These results show that C³Splat benefits increasingly from additional reference views, consistent with the availability of more shared scene information for cross-view entropy conditioning. Together with the geometric-overlap analysis in Section 5.4 (Figure 4), these findings provide further evidence that the compression improvements are associated with exploitable cross-view redundancy.
Input-view Count Analysis on DL3DV-Benchmark (λ = 1024).