- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes MemGraphSSC, a temporal 3D semantic scene completion framework that combines observation-conditioned dual memory with occlusion-relation-guided feature refinement. The method retrieves historical features for history-supported voxels and semantic prototypes for observation-unsupported voxels, while leveraging precomputed scene graphs to guide feature refinement through directed occlusion relations. Experiments on SemanticKITTI and SSCBench-KITTI-360 demonstrate competitive performance against existing methods.
Critical strengths
- The observation-conditioned memory mechanism addresses the varying availability of historical evidence across voxels, providing a reasonable strategy for integrating temporal information and semantic priors.
- The framework combines temporal memory with explicit occlusion relations, enabling more structured feature refinement in partially observed scenes.
- The method achieves state-of-the-art performance on two benchmarks, and the ablation studies demonstrate the effectiveness of the proposed components.
Critical weaknesses
- Although occlusion reasoning is a central contribution, the paper mainly reports overall IoU and mIoU. It lacks quantitative evidence showing improvements specifically in occluded regions.
- The experiments do not sufficiently demonstrate whether directed occlusion relations provide benefits beyond simpler alternatives, such as bounding-box priors or undirected feature aggregation.
- Scene-graph construction relies on additional large models, including Grounding DINO and Qwen3-VL-8B. However, the paper does not report end-to-end inference latency or graph-generation overhead, raising concerns about practical deployment.
Questions for authors
- Could the authors provide quantitative evaluations specifically on occluded regions to better demonstrate the effectiveness of the proposed occlusion-guided refinement?
- How does the proposed directed relation reasoning compare with simpler alternatives, such as undirected graph aggregation or bounding-box-based semantic priors?
- Could the authors report the computational overhead, including scene-graph generation time and end-to-end inference latency, compared with existing temporal SSC methods?
If the authors can address most of my concerns, I would be willing to raise my score.