- Rating
- 2(−1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduce an important setting, that the query can arrive at any time, how to conduct 4d point cloud segmentation accordingly. And the method proposed by this paper is to compress the history point cloud representations, and retrieve relevant "3D frame" to conduct segmentation.
Critical strengths
The proposed task setting is interesting and practically meaningful, and the experimental results provide evidence of the framework's effectiveness.
The overall framework is reasonable and well-structured. Image-point features are used for query-driven temporal retrieval, while point-voxel features support fine-grained instance segmentation. This design effectively separates temporal localization from spatial segmentation and achieves a favorable trade-off between accuracy and computational efficiency.
Critical weaknesses
The paper appears to overstate its methodological contributions. The proposed framework essentially follows a retrieval-and-segmentation paradigm, rather than introducing a fundamentally new query-driven segmentation mechanism.
The proposed approach does not fully address the challenge of efficient historical representation management. Although SET compresses visual features for retrieval, the framework still needs to retain dense historical representations for subsequent segmentation.
A more compelling approach would enable query-agnostic compression of historical representations while preserving sufficient information for accurate segmentation upon query arrival.
Questions for authors
What are the specific advantages of the proposed framework over simply augmenting an existing 4D segmentation method with a standard retrieval-and-segmentation pipeline? Are there any architectural adaptations specifically designed for the anytime-query setting beyond the additional retrieval module? A comparison with such a baseline would help clarify the methodological contributions.
Is it possible to develop a more memory-efficient mechanism that compresses historical representations in a query-agnostic manner while preserving sufficient information for future segmentation? Currently, the framework appears to cache dense historical features continuously, which raises concerns about its scalability to long-duration streams and the extent to which it addresses the claimed online processing challenge.