- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes KG-ReflectGround, a zero-shot 3D visual grounding framework that combines query-aware sparse spatial graph reasoning with selective multimodal verification. It constructs a compact spatial knowledge graph over candidate objects, performs relation-ordered evidence-gain reasoning with adaptive halting, and invokes MLLM-based visual verification only when structural evidence is deemed insufficient.
The main contributions are: (1) an efficient zero-shot 3DVG framework that integrates explicit spatial reasoning with selective MLLM verification; (2) a query-aware sparse spatial knowledge graph and relation-ordered evidence-gain reasoning with adaptive halting; and (3) an evidence-aware verification strategy that selectively activates multimodal reasoning when structural evidence is insufficient.
The method is validated on ScanRefer and Nr3D under the ground-truth-object setting using Qwen3-VL-8B as the backbone. The paper reports zero-shot ScanRefer Overall [email protected]/0.5 of 52.0/47.8 and Nr3D Overall accuracy of 49.2, together with comparisons to supervised and zero-shot methods, ablations, adaptive-halting analysis, and qualitative examples.
Critical strengths
- Clear practical motivation. The paper addresses the accuracy–computation trade-off in zero-shot 3D grounding by combining structural reasoning with selective visual verification. Allocating multimodal computation according to query requirements is a practically relevant direction.
- Several relevant experimental controls. The paper includes a same-backbone SeeGround comparison using Qwen3-VL-8B, component ablations, and fixed-depth versus adaptive-halting comparisons. These provide an initial basis for assessing the proposed components.
Critical weaknesses
Major concerns
-
The candidate object setting may lead to an unfair comparison.
Appendix A.1 states that ScanRefer and Nr3D are evaluated under the ground-truth-object setting using annotated ScanNet object instances as candidates. However, Table 1 does not specify the candidate source used by each baseline. According to the public implementations of methods such as SeeGround, they use object lists predicted by Mask3D. If this is the case, the annotated object list used in this paper provides a stronger prior in terms of instance localization, category, and object count, and the two settings are not directly comparable. The authors should clarify the candidate source for each method and indicate which rows in Table 1 are comparable under the same setting. Annotated objects are available for ScanNet-based benchmarks, but an accurate object list cannot be assumed in real deployment; the conclusions should be qualified accordingly. -
The speed comparison does not specify the conditions under which each method was measured, so the latency difference cannot be attributed to the algorithm.
Table 1 includes methods with different backbone sizes, such as Qwen2-VL-72B and Qwen3-VL-8B. If a larger-model baseline is compared with the 8B model used in this paper, the latency difference does not demonstrate algorithmic efficiency. The manuscript also does not specify the timing boundary: whether the reported time includes query parsing, neighbor search, graph construction, edge reweighting, candidate filtering, rendering, and text/vision model calls. A unified timing protocol and a breakdown into scene-level and query-level costs are needed; otherwise the efficiency claim is not supported. -
The core operations are not fully defined, and the figures are not consistent with the algorithmic procedure.
The geometric scoring function (Eq. 5), the candidate compatibility function (Eq. 10), and the matched anchor object (Eq. 11) are not fully defined. It is also unclear what and in the text–graph conflict formula in Eq. (17) correspond to in the query. Figure 3 shows “Halting-weighted Evidence” with candidate reweighting factors such as ×1.6 and ×1.2, but the equations and pseudocode do not explain how these factors are obtained, at which step they are applied, or whether they affect the final prediction. The candidate counts and normalized scores in Figures 4 and 5 also cannot be reproduced from the manuscript. These issues directly affect whether the method can be independently implemented and verified. -
The visual routing claim is too strong, and the current evidence does not support “invoking vision only when truly needed.”
Candidate entropy, top-two margin, text–graph conflict, and appearance dependency are heuristic rules designed by the authors; they do not guarantee that the selected queries actually require visual information. The manuscript also does not provide verifiable evidence that the routed cases correspond to queries that need visual observation. Showing that performance drops when images are removed is still insufficient: a close score may indicate that color information is genuinely needed, or that the spatial relation was computed incorrectly; a query containing “red” may not require vision if there is only one chair in the scene; and if the true target has already been incorrectly pruned, looking at the remaining candidates may not help. The authors therefore need to provide evidence supporting this claim or weaken the statement. -
The kNN geometric graph is reasonable but conventional, and the current evidence is insufficient to support strong novelty and generalization claims.
Building a kNN graph from object geometry and organizing spatial relations as a graph is a reasonable but relatively conventional design; this alone does not establish strong novelty. ScanRefer and Nr3D are both based on ScanNet RGB source and cannot be regarded as fully independent or heterogeneous datasets. Therefore, results on multiple benchmarks alone cannot demonstrate transferability across data sources or deployment conditions. The authors should more precisely define the contribution of the method or narrow the generalization claim. -
The relation coverage, complex constraint composition, and unsupported queries are not explained.
The manuscript describes a framework that derives pairwise relation weights from object geometry, but it does not provide the full relation set, the scoring function for each relation, or the composition algorithm for complex constraints. It also does not explain how unknown relations are handled. The relations shown in Figure 6, such as between, middle, center, and opposite, need to be mapped to the implementation item by item. If these relations are actually handled by the subsequent LLM/MLLM rather than by the graph, the responsibility boundary between graph reasoning and model reasoning should be clarified. Fixed kNN and irreversible candidate deletion may also miss necessary reference objects; the coverage capability and failure cases need to be discussed.
Minor
- The Overall aggregation in Table 1 needs to be checked. Under the official ScanRefer evaluation and the public implementations of the compared methods, Overall should be the query-count-weighted accuracy of Unique and Multiple, with the same subset proportions used for both IoU thresholds. Some rows in Table 1 do not satisfy this relationship, and the discrepancy cannot be explained simply by rounding in the displayed precision. I am not assuming a specific source of error, but this affects the credibility of the main performance results. The authors should provide the number of queries and correct predictions for each subset, the aggregation formula, and verify whether there is a transcription or aggregation error in Table 1.
- The fonts and annotations in Figures 2 and 3 are too small to read at normal page size.
- An actual execution example would help readers verify the query parsing, anchor objects, candidate changes, halting signals, and visual verification process.
Questions for authors
See Weakness.