- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Reasoning-DETR, an RT-DETR-based framework for aerial object detection, targeting the challenges of tiny, densely distributed, and visually ambiguous objects. The method contains two main components. First, a Scene-Aware Dynamic Query Allocation module adaptively introduces supplementary queries according to regional density estimates and a prototype-based Scene Memory, aiming to improve query coverage in scenes with varying object densities. Second, an Uncertainty-Aware Semantic and Relational Query Reasoner identifies ambiguous supplementary queries, refines them using category prototypes, and selectively aggregates information from reliable nearby queries through gated relational interaction. Experiments on VisDrone and AI-TOD-V2 show consistent improvements over RT-DETR and several aerial detection baselines, particularly for tiny objects, while introducing a moderate increase in computational complexity. Overall, the paper presents a coherent framework that combines adaptive query allocation with contextual query refinement for aerial detection.
Critical strengths
- The paper is clearly organized, and the proposed framework is presented in a structured manner.
- The experimental results are generally solid, showing consistent improvements over the RT-DETR baseline and competitive performance on both VisDrone and AI-TOD-V2.
Critical weaknesses
-
The key motivation behind the proposed query reasoner is insufficiently validated. The paper assumes that ambiguous small object queries are harmed by misleading background or neighboring-query interactions, but provides no direct analysis showing that this failure mode actually occurs or that the proposed module specifically alleviates it. As a result, the motivation remains largely intuitive rather than empirically established.
-
The Scene-Aware Dynamic Query Allocation module has limited novelty and relies on several heuristic, dataset-dependent design choices:
- The module is closely related to prior density-guided dynamic-query approaches such as DQ-DETR. Its main additional design is to partition the high-resolution feature map into overlapping regions and perform query budgeting at the regional level. Therefore, the contribution appears to mainly refine the spatial granularity of existing dynamic-query allocation rather than introducing a fundamentally new query generation or allocation mechanism.
- The allocation mechanism contains many heuristic design choices and manually specified hyperparameters. The proposed pipeline introduces a considerable number of hyperparameters, including the regional partition parameter , overlap ratio , Scene Memory size , number of retrieved prototypes , number of density levels , predefined density-to-budget mappings , Scene Memory weighting coefficient , and the maximum number of supplementary queries . In particular, the regional query demand formulation is largely hand-crafted.
- Scene Memory may overly rely on dataset-specific contextual biases. Scene Memory is constructed exclusively from training regions containing ground-truth objects, meaning that the resulting prototypes largely encode object-context co-occurrence patterns observed in the training set. Such priors can be effective under an IID evaluation protocol, but their robustness under scene or domain shifts remains unclear.
-
The Uncertainty-Aware Semantic and Relational Reasoning module have several insufficiently justified design choices:
- The individual components are largely built upon standard techniques, including entropy-based uncertainty estimation, classifier weights as category prototypes, prototype attention, spatial nearest-neighbor selection, geometric relation bias, and gated feature aggregation. Therefore, the contribution mainly lies in combining these existing mechanisms for aerial query refinement rather than introducing a fundamentally new reasoning formulation.
- Several components are heuristic. The method normalizes sigmoid classification scores to construct a categorical distribution for entropy estimation, defines neighbor reliability as , filters queries using a manually specified threshold , and further selects a fixed number of eight spatial neighbors. The rationale and robustness of these choices are not sufficiently justified, and their sensitivity should be more thoroughly evaluated.
- The term ``reasoning'' appears somewhat overstated for the proposed mechanism. In practice, the module mainly performs uncertainty-based query selection, prototype retrieval, local neighbor aggregation, and gated feature fusion, all of which are relatively standard representation refinement operations.
-
The experimental evaluation has several limitations:
- The actual inference efficiency is not sufficiently evaluated. Although the paper reports Params and GFLOPs, it does not provide FPS or inference latency. This is particularly important because the proposed method introduces dynamic supplementary queries, prototype retrieval, neighbor selection, and additional attention operations, whose practical runtime overhead may not be fully reflected by GFLOPs. Reporting FPS under a clearly specified hardware would make the efficiency claim more convincing.
- The comparison with recent detectors is not sufficiently comprehensive. Several baselines in the main table are relatively old, while stronger and more recent real-time detectors are missing. For example, the paper does not include newer YOLO variants such as YOLO11, DEIM, RT-DETRv4, nor other recent competitive detectors under comparable training and input-resolution settings.
-
The period at line 394 should be carefully revised.
Questions for authors
See Weakness.
6 comments
Additional Responses to the Reviewer
Weakness 4: The actual inference efficiency is insufficiently evaluated.
A: We supplemented the evaluation with inference latency and FPS measurements on a single NVIDIA RTX 3090 GPU, using 640 × 640 inputs, FP16 precision, and batch size 1.
Table 5. Inference efficiency comparison on RTX 3090.
| Model | Params (M) | GFLOPs | Latency (ms) | FPS |
|---|---|---|---|---|
| RT-DETR-L | 32.9 | 108.0 | 16.0 | 62.5 |
| + Adaptive Query Allocation | 33.5 | 116.5 | 17.5 | 57.1 |
| Reasoning-DETR | 34.0 | 118.0 | 18.2 | 54.9 |
Although supplementary-query decoding and refinement introduce additional overhead, Reasoning-DETR maintains real-time inference speed while improving AP from 29.7 to 33.5. We will include these efficiency measurements and the hardware configuration in the revised manuscript.
Weakness 5: The comparison with recent object detectors is not sufficiently comprehensive.
A: We expanded the comparisons to include YOLO11, DEIM, and RT-DETRv4, using the same VisDrone split and 640 × 640 input resolution.
Table 6. Comparison with recent object detectors on VisDrone.
| Method | Input Size | AP | AP50 |
|---|---|---|---|
| YOLO11-L | 640 × 640 | 30.8 | 51.8 |
| DEIM-D-FINE-L | 640 × 640 | 31.7 | 52.9 |
| RT-DETRv4-L | 640 × 640 | 31.4 | 52.4 |
| RT-DETR-L | 640 × 640 | 29.7 | 50.6 |
| Reasoning-DETR (Ours) | 640 × 640 | 33.5 | 54.2 |
The results demonstrate the competitiveness of our method against recent real-time detectors.
Weakness 6: The period at line 394 should be carefully revised.
A: Thank you for identifying this issue. We have corrected the punctuation and further checked the manuscript for similar typographical and formatting errors.
Dear Reviewer Rci6,
Thank you again for your constructive suggestions. Following our previous responses in the rebuttal, we have further revised the manuscript by incorporating additional experimental analyses, including inference efficiency evaluations and hyperparameter sensitivity studies. We have also carefully checked the manuscript for typographical and formatting issues. We sincerely hope these revisions address your concerns and further strengthen our work. The corresponding changes are highlighted in purple.
Thank you for your constructive feedback and for recognizing our work. We considered the concerns and conducted additional analyses to validate our method. We hope our responses clarify its contributions and improvements, and appreciate your consideration of a higher score.
Weakness 1: The motivation behind the proposed query reasoner is insufficiently validated.
A: To directly investigate the influence of unreliable neighboring information, we conducted additional controlled experiments.
(1) We compared semantic refinement, unfiltered nearest-neighbor aggregation, reliability filtering, and reliability filtering with the proposed gate.
(2) As shown in Table 1, unfiltered aggregation introduces 38.5% background neighbors, resulting in lower query accuracy (44.9%) and higher NLL (1.33).
(3) Reliability filtering and gating improve query accuracy to 50.2%, reduce NLL to 1.14, and achieve 33.5 AP, demonstrating their effectiveness in suppressing misleading neighboring information.
Table 1. Analysis of unreliable neighboring information on VisDrone.
Weakness 2: The Scene-Aware Dynamic Query Allocation module has limited novelty and relies on heuristic, dataset-dependent designs.
A: We further clarify the distinction from DQ-DETR and Dome-DETR. Unlike methods primarily relying on image-dependent density information, our method introduces Scene Memory as an additional contextual prior.
(1) As shown in the original ablation, increasing Top-K queries from 300 to 500 improves AP from 29.7 to 30.7; adding Scene Memory raises it to 31.2, and incorporating density prediction further improves it to 32.0.
(2) GT coverage also improves from 90.8% to 91.7%, with small-object coverage increasing from 84.3% to 86.1% (Table 7).
To examine the heuristic designs, we conducted sensitivity analyses on representative parameters, as shown in Tables 2–4.
Table 2. Sensitivity analysis of reliability threshold and scene-memory weight on UAVDT.
Table 3. Sensitivity analysis of supplementary query budget on VisDrone.
Table 4. Sensitivity analysis of representative hyperparameters on VisDrone.
These results show that the selected configurations perform consistently well. Other settings, such as density-to-budget mappings, are coupled with the overall allocation policy and are therefore evaluated through the corresponding budget analysis. We will provide complete default configurations for reproducibility.
We also acknowledge that Scene Memory may reflect training-distribution characteristics and will clarify its potential limitations under domain shifts.
Weakness 3: The Uncertainty-Aware Reasoning module relies on standard techniques and insufficiently justified heuristic choices.
A: Our contribution lies in integrating semantic evidence and reliable local relations into a structured query refinement process, rather than introducing each underlying operation independently.
(1) Category prototypes provide semantic guidance, while reliable neighbors supply complementary local information through gated aggregation.
(2) As shown in Table 8, progressive refinement improves AP from 32.0 to 32.7, 33.1, and 33.5, while uncertain-query accuracy increases from 42.1% to 50.2% and NLL decreases from 1.39 to 1.14.
Regarding the term Reasoning, we use it to describe structured semantic and relational evidence refinement at the query level, rather than multi-step symbolic reasoning. We will clarify this definition to avoid overstating the method's scope.