- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes SetOPD to combine text and visual examples for remote sensing open-prompt detection. It encodes pooled example features into a compact visual memory, generates text-based and visual detection candidates separately, and combines paired candidate features to produce the final predictions. Across 11 datasets, including four excluded from adaptation training, it reports Macro11 AP of 55.57.
Critical strengths
The paper addresses a practical way for users to specify RS detection targets. The paper offers a useful perspective on combining different sources of evidence.
The main comparison has useful breadth and shares a base detector. PQA exceeds Joint Prompt Representation on all eleven sources. The experiments are solid.
The paper examines limitations directly.
Critical weaknesses
The practical flexibility of the open-prompt interface is insufficiently demonstrated. The introduction argues that "direct target specification becomes a central requirement" (p. 1), but the main evaluation uses a harmonized 153-category space and five boxed exemplars per category (p. 7). Held-out datasets provide useful evidence of source transfer, but do not by themselves demonstrate reliable control through varied user prompts. There are no controlled evaluations of ambiguous category descriptions, conflicting text and exemplars, or prompts selecting different subtypes within one category. The results therefore leave the central benefit of flexible target specification insufficiently tested.
The practical value of the added system complexity is unclear. The paper highlights a 1.57-point Macro11 AP gain with "only 0.63M trainable parameters" (p. 3), but the full prediction path includes separate text and visual decoding streams, support-example encoding, and candidate fusion. End-to-end latency and memory measurements under comparable prompting conditions is required.
Index consistency is not an object-correspondence guarantee. The introduction says PQA “resolves it structurally” about cross-modal assignment (p. 2). Shared initialization and permutation equivariance ensure consistent indexing, but two modality-conditioned decoders can still associate an index with different objects.
Questions for authors
See above.
4 comments
Answer 2
Q2: Computational overhead of the dual-reader SetOPD framework
We thank the reviewer for this comment. We clarify that the additional 0.63M trainable parameters refer to the PQA module, rather than the computational cost of the entire dual-reader system. To quantify the actual inference overhead, we conducted additional profiling under identical experimental conditions.
All methods were evaluated on a single NVIDIA RTX 3090 GPU using FP32, with the same 120 DOTA-v2.0 images, identical preprocessing (short side 800 pixels, long side at most 1333 pixels), 5 visual exemplars per class, and a maximum of 300 output detections.
Text and visual support prompt encodings were cached. After warm-up, latency measurements included image loading, preprocessing, model inference, and postprocessing. We measured computation, peak allocated GPU memory, inference latency, and throughput under the same conditions.
| Method | GFLOPs/Image | Peak Memory (MiB) | Latency (ms) | FPS (B=1) | FPS (B=60) |
|---|---|---|---|---|---|
| Joint Prompting | 372.66 | 858.17 | 113.46 | 8.81 | 11.60 |
| Late Fusion | 410.42 | 858.17 | 124.14 | 8.06 | 12.16 |
| Relation-Aware Selection | 411.48 | 1334.24 | 136.70 | 7.32 | 10.56 |
| SetOPD (Ours) | 411.82 | 860.56 | 128.98 | 7.75 | 11.80 |
GFLOPs were measured using the same PyTorch profiler scope, counting one multiply-add as two floating-point operations. Custom deformable-attention operations are not fully covered. Peak GPU memory was measured at batch size 1. The reported latency reflects image inference with cached prompt encodings rather than first-time support encoding.
Compared with Joint Prompting, SetOPD increases measured computation by 39.16 GFLOPs (10.5%), latency by 15.52 ms (13.7%), and peak GPU memory by 2.39 MiB.
More importantly, Late Fusion provides a direct computational reference because it also requires two modality-specific decoding streams. Compared with Late Fusion, SetOPD adds only 1.40 measured GFLOPs (0.34%) and 4.84 ms (3.9%) per image.
These results distinguish the computational cost of the complete dual-reader inference path from the incremental overhead of PQA. While maintaining separate modality-specific readers incurs additional computation compared with Joint Prompting, the candidate-level collaboration introduced by PQA adds relatively little overhead beyond the dual-reader architecture.
Q3: On index consistency and object-level correspondence
We thank the reviewer for this important observation. We clarify that shared query initialization provides a structural pairing prior rather than a strict guarantee of object-level correspondence. The phrase "resolves it structurally" refers to establishing index-aligned candidate pairs without requiring explicit cross-modal assignment.
Our original Table 5 already provides pairing-consistency analyses on DIOR, DOTA-v2.0, and HRSC2016. To further validate the reliability of shared initialization across additional data sources, we conducted a new, independent reader-to-reader correspondence analysis on three other datasets: FAIR1M, SODA-A, and HRRSD, including the held-out HRRSD dataset.
For each dataset, we evaluated 128 images and all 900 same-index query pairs per image. When both readers produced class-correct detections at IoU , we examined whether they corresponded to the same ground-truth object.
| Dataset | Same GT | Different GT | Same-GT Rate |
|---|---|---|---|
| FAIR1M | 3,196 | 9 | 99.72% |
| SODA-A | 3,859 | 6 | 99.84% |
| HRRSD (Held-out) | 197 | 0 | 100.00% |
| Total | 7,252 | 15 | 99.79% |
Among 7,267 jointly correct query pairs, only 15 pairs (0.21%) correspond to different GT objects, while 7,252 pairs (99.79%) refer to the same object.
These results provide further empirical support for our PQA design. Since the two readers independently decode from shared initial queries, the vast majority of jointly correct candidate pairs exhibit consistent object correspondence, enabling direct index-based arbitration without an additional cross-modal matching procedure.
We acknowledge that object-level mismatches can still occur. Therefore, PQA uses index alignment as an effective structural prior rather than assuming guaranteed object identity. The learned gate adaptively arbitrates within each candidate pair, while SetBlock enables interactions across the fused candidate set.
We sincerely thank the reviewer again for the constructive comments and valuable suggestions. The additional computational profiling and three-dataset candidate-correspondence analysis further strengthen the empirical evidence for SetOPD. We will incorporate these results and clarify the scope of our method and the role of shared query initialization in the revised manuscript.
Thank you for the clarifications and additional experiments. The rebuttal addresses my main concerns. I will keep my rating.
Thank you for your positive feedback and for considering our additional experiments and clarifications. We sincerely appreciate your time and thoughtful assessment.
Answer 1
Dear Reviewer u4HL,
We sincerely thank you for your careful review, constructive feedback, and recognition of the strengths of our work. We particularly appreciate your positive assessment of the candidate-level multimodal collaboration framework, the breadth of our evaluation across 11 datasets, and the experimental evidence supporting PQA. Your comments have helped us further clarify the scope, computational efficiency, and candidate-pairing mechanism of SetOPD. We address your concerns point by point below.
Q1: On the practical flexibility of the open-prompt interface
We thank the reviewer for this comment. However, we disagree that evaluations involving ambiguous descriptions, contradictory text–visual prompts, or arbitrary intra-category subtype selection are necessary to validate the central contributions of SetOPD.
Our evaluation follows established practices in remote-sensing open-vocabulary and open-prompt detection. For example, OpenRSD (ICCV 2025) evaluates text- and image-prompt detection on public remote-sensing benchmarks, while LAE-DINO (AAAI 2025) evaluates open-vocabulary detection on DIOR, DOTA-v2.0, and LAE-80C. Similarly, RS-MPOD (2026) evaluates textual, visual, and multimodal prompting through standard, cross-dataset, and fine-grained detection benchmarks.
Importantly, specialized semantic capabilities constitute distinct research objectives. For instance, Hi-OPD (2026) specifically investigates hierarchical category prompting and introduces dedicated parent/grandparent-query evaluations to assess hierarchical retrieval. Such evaluations are appropriate when semantic hierarchy is the methodological focus, but they are not prerequisites for evaluating every open-prompt detection framework.
SetOPD addresses a different methodological question: how to encode a few visual exemplars into an effective visual memory and how to combine independently decoded text- and visual-conditioned detection candidates. It does not propose a natural-language ambiguity resolver or a mechanism for resolving contradictory user intentions.
The unified 153-category space serves as a consistent evaluation taxonomy rather than a fixed 153-class prediction head. Our experiments directly evaluate the proposed mechanisms through Text-only, Visual-only, and Text+Visual prompting, different support-example counts, and 11 heterogeneous datasets, including four held-out sources.
Therefore, we believe these experiments provide appropriate and comprehensive evidence for our stated contributions. While ambiguity resolution, conflicting prompts, and intra-category semantic control are valuable research directions, they address capabilities beyond the specific mechanisms investigated in this paper.