betaFeedback

WorksComputer Science

Reviving the Discarded High-Resolution Feature for Transformer-Based Tiny Object Detection

Abstract

Tiny object detection remains challenging because tiny instances occupy only a few pixels, and their fine-grained details are easily lost during feature downsampling. Although the highest-resolution feature preserves rich local details for tiny objects, DETR-like detectors often discard it due to its large computational cost, while directly reintroducing this feature also brings dense background noise. To address this problem, we propose ReDHF, a novel framework that Revives the Discarded High-resolution Feature for tiny object detection. ReDHF has three cooperative components. Cross-Scale Deformable Fusion (CSDF) first constructs a semantically enhanced highest-resolution feature and injects its fine-grained details into the shallow feature under a moderate cost. Ellipse-Guided Shallow Supervision (EGSS) then guides the enhanced feature to learn more reliable classification and localization priors by applying geometry-adaptive auxiliary supervision. Full-Scale Query Interaction (FSQI) further enables decoder queries to access both low-level details and high-level semantic information, allowing them to aggregate richer cues for tiny objects. Extensive experiments show that ReDHF consistently improves multiple baselines across different DETR variants and achieves state-of-the-art performance on the evaluated benchmarks. The best ReDHF variants surpass their baselines by +1.4 AP on AI-TOD-v2, +1.6 AP on VisDrone, and +1.5 AP on SODA-D, with especially notable gains on tiny and small objects.

Introduction

Object detection has advanced rapidly, with both CNN-based detectors [7, 9, 12, 20, 27, 31, 34, 35, 41, 44] and Transformer-based detectors [4, 5, 38, 25, 29, 30, 52, 56, 59] achieving strong performance. However, detecting tiny objects remains difficult, especially in aerial, remote sensing, and traffic scenarios. Tiny objects occupy only a few pixels, leaving their edges, textures, and geometric cues weak in the image and further weakened by feature downsampling. As a result, high-level features often fail to preserve sufficient discriminative details for tiny objects, as illustrated in Figure 1(b).

Aerial image with tiny object, feature downsampling pipeline, and ultra-tiny object ratios across datasets

Figure 1. (a) Tiny objects may occupy only a few pixels, making their visual evidence extremely weak. (b) Very tiny objects can become nearly invisible on stride-4 feature map in the feature downsampling pipeline. (c) The ratio of ultra-tiny objects (short side ≤4\le4 pixels) is much higher in tiny object datasets such as AI-TOD-v2, VisDrone, and SODA-D than in COCO.

To address the issues of tiny object detection, a natural idea is to preserve these weak cues by using higher-resolution inputs or features. Prior works have shown that high-resolution information is important for tiny objects. For example, Deformable DETR [59] points out that small objects rely on high-resolution feature maps, and DM-EFS [37] shows that shallower high-resolution features can improve tiny-object representation. However, many detectors [26, 52, 59, 25] still discard the highest-resolution backbone feature to control computation. This saves overhead but sacrifices the local details that are critical for tiny objects. As shown in Figure 1(a)(Figure 1c), discarding this feature1 becomes especially detrimental on AI-TOD-v2 [46], VisDrone [58], and SODA-D [6], where ultra-tiny objects with a short side no larger than 4 pixels appear frequently and may be compressed to nearly a single point even on a stride-4 feature map. Meanwhile, directly reintroducing the highest-resolution backbone feature is also impractical, since it has a much larger spatial size that may lead to unacceptable extra cost, and its shallow responses contain dense background activations that may overwhelm weak tiny-object signals. These issues highlight the pressing need for detection frameworks that can balance fine-grained information preservation with computational efficiency.

In this work, we propose ReDHF, a novel and efficient plug-and-play high-resolution detail reintroduction framework for Deformable-DETR-like detectors, which revives the discarded highest-resolution backbone feature while controlling computation and background disturbance through three cooperative components. First, to address the contradiction between the limited representation of small objects and the high cost of utilizing high-resolution features, we design a lightweight Cross-Scale Deformable Fusion (CSDF) module that semantically enhances the highest-resolution feature to provide more useful fine-grained cues with moderate cost. Second, considering that high-resolution features mainly include low-level edges and textures and are more likely to introduce background noise, we apply Ellipse-Guided Shallow Supervision (EGSS) to guide the shallow feature to learn more stable classification and localization priors. Moreover, since final predictions in DETR-like detectors are query-driven, we further propose Full-Scale Query Interaction (FSQI), which integrates the semantically enhanced highest-resolution feature together with higher-level features into the encoder memory, so that decoder queries can directly access pixel-level details and improve their ability of detecting tiny objects. Overall, ReDHF makes more effective use of the highest-resolution backbone feature with only a modest extra cost and significantly improves tiny object detection.

Extensive experiments show that ReDHF consistently improves multiple DETR-like [52, 59, 14] baselines and achieves state-of-the-art performance. Specifically, the best ReDHF model achieves 35.7%35.7\% AP on AI-TOD-v2 [46], improving APvtAP_{vt} to 20.8%20.8\% (+1.2%) over its corresponding baseline. In addition, the ReDHF variant built upon DINO-4scale [52] reduces GFLOPs by 86.7% compared with directly integrating the highest-resolution feature, as detailed in Appendix § 11. On VisDrone [58] and SODA-D [6], ReDHF again brings consistent gains. The best ReDHF model achieves 40.6%40.6\% AP and 38.7%38.7\% AP, and also improves APsAP_s to 33.1%33.1\% (+1.6%) and APesAP_{es} to 21.4%21.4\% (+1.7%), respectively. These results support our claim that the highest-resolution feature, though often discarded for efficiency, can be effectively revived through semantic enhancement. In summary, our main contributions are:

  • We revisit the commonly discarded highest-resolution backbone feature in DETR-like detectors and show that its effective reuse requires addressing not only computational cost, but also weak semantics and noisy shallow responses.

  • We propose ReDHF, which revives the discarded feature through semantically enhanced highest-resolution feature construction (CSDF), training-time shallow auxiliary supervision (EGSS), and decoder full-scale query interaction (FSQI), thereby enabling efficient high-resolution detail reintroduction for tiny-object detection.

  • We validate ReDHF on multiple DETR-like baselines across AI-TOD-v2, VisDrone, and SODA-D. It achieves state-of-the-art performance and consistently improves the baselines with average gains of +1.5 APvtAP_{vt}, +1.7 APsAP_s, and +1.8 APeSAP_{eS} on the three datasets, respectively.

Related work

Tiny object detection

Identifying tiny objects is inherently difficult because tiny instances provide limited visual evidence and are vulnerable to complex background noise. Early CNN-based detectors, such as Faster R-CNN [9, 35], often struggle with such objects due to inadequate feature representation and limited context modeling. Some works improve tiny-object learning by enriching training samples, such as copy-pasting augmentation [18] and instance-level transformations [60]. Recently, transformer-based models [4, 19, 25, 30, 38, 52, 56, 59] have shown strong potential by bypassing hand-crafted post-processing like NMS and leveraging self-attention mechanisms. Cross-DINO [3] combines deep MLP representations with transformer encoder features through a Cross Coding Twice Module to enhance small-object details. DQ-DETR [15] introduces density maps to adjust query numbers and positions based on instance density, while Dome-DETR [14] further improves tiny object detection by generating density-oriented features. However, these methods often rely heavily on specific density modeling or carefully designed query mechanisms, which may complicate the optimization process and limit their flexibility across different datasets.

Multi-scale and high-resolution features

Feature pyramids [20] are widely used to handle object scale variation. Advanced architectures like BiFPN [40] and DetectoRS [32], improve cross-level information flow through bidirectional fusion or recursive feedback. For tiny objects, fusion factors [10] further regulate adjacent pyramid levels to reduce the learning burden. Recent works also explore high-resolution information more explicitly. QueryDet [49] refines sparse locations from low to high resolutions. ESOD [24] uses patch slicing and sparse prediction to reduce redundant computation on high-resolution features. DM-EFS [37] expands feature sets to enrich small-object representations. These works show the value of high-resolution cues for tiny objects. However, many detection pipelines still discard the highest-resolution backbone feature to keep computation affordable, leaving the finest local details underused. In contrast, our method revives this discarded feature through semantic enhancement, making its fine-grained details more compatible and usable for tiny object detection.

Auxiliary supervision and label assignment

Auxiliary supervision has been widely used to strengthen intermediate representations in object detection. In CNN-based detectors, DSFPN [50], LAF-YOLOv10 [8] and Jin et al. [16] attach auxiliary prediction heads to early backbone stages or bottom-up pathways to improve feature learning. A similar idea is adopted in DETR-like models [52, 15, 14, 30, 38], where auxiliary losses on intermediate decoder layers are commonly used to stabilize training and facilitate optimization. Beyond intermediate decoder supervision, MLP-DINO [2] introduces query-independent category supervision to mitigate the sensitivity of category predictions to bounding box prediction.

Label assignment is another key factor affecting detection performance. ATSS [53] shows that positive and negative sample definitions are critical. For generic object detection, AutoAssign [57] and IQDet [28] select high-quality regions according to predicted quality scores, while FCOS [43] formulates detection as dense per-pixel prediction. For transformer-based detectors, DS-DNet [11] introduces a unified Single-Query paradigm and disentangles cross-attention-based box localization with one-to-many assignment from self-attention-based deduplication with one-to-one assignment. However, tiny objects make assignment more difficult because small localization shifts can strongly affect matching quality. Recent methods therefore redesign assignment for tiny objects. UGS [39] shows that IoU-based assignment can be unstable for tiny objects and proposes a classification-based objective. DCNet [55] uses dynamic scale-aware assignment, while RFLA [47] matches Gaussian receptive fields with ground truth to alleviate positive-sample scarcity. Unlike these methods that mainly design assignment for final prediction, our work focuses on strengthening intermediate representations. Specifically, we propose a geometry-adaptive assignment strategy and auxiliary supervision to build coarse classification and localization priors for tiny objects, while the auxiliary head is removed during inference.

Method

Overall framework

Given an input image, let {Ci}i=1l\{C_i\}_{i=1}^{l} denote the multi-level backbone features, and let {Pi}i=1l\{P_i\}_{i=1}^{l} denote the corresponding multi-scale features after encoder context modeling, where C1C_1 is the highest-resolution feature. To revive the discarded highest-resolution feature without incurring excessive computation or amplifying background responses, we propose ReDHF, a plug-and-play framework for transformer-based tiny object detection. As shown in Figure 2, ReDHF consists of three components: Cross-Scale Deformable Fusion (CSDF, § 3.2), Ellipse-Guided Shallow Supervision (EGSS, § 3.3), and Full-Scale Query Interaction (FSQI, § 3.4). During training, CSDF and FSQI are optimized end-to-end in the main detection pipeline, while EGSS supervises the shallow feature to learn stable classification and localization priors. During inference, EGSS is completely removed, and only CSDF and FSQI remain for feature construction and decoder interaction.

Overview of ReDHF

Figure 2. Overview of ReDHF. CSDF revives the discarded highest-resolution feature C1C_1 as a semantically enhanced feature P1P_1 and injects its fine-grained details into P2P_2 to obtain the detail-enhanced shallow feature P2′P'_2. EGSS further supervises P2′P'_2 with ellipse-guided auxiliary supervision during training, while FSQI exposes P1P_1, P2′P'_2, and deeper features to decoder queries for final detection.

Cross-scale deformable fusion

CSDF is designed to exploit the fine-grained details of the highest-resolution backbone feature while reducing the side effect of its noisy background responses. Instead of directly using raw C1C_1, CSDF first constructs a semantically enhanced highest-resolution feature P1P_1, and then injects its high-resolution details into the shallow feature P2P_2.

Semantically enhanced highest-resolution feature construction. Directly using C1C_1 is suboptimal because it contains rich details but weak semantics [20], making it sensitive to background noises. To address this issue, we inject the semantic information from P2P_2 into C1C_1 through a lightweight RepNCSPELAN4 block [30]. Since lower layers preserve local details while higher layers aggregate more global context [33], we only upsample P2P_2 and fuse it with the projected C1C_1 as follows:

P1=FRepNCSPELAN4(Concat⁡(Up⁡(P2),ϕ(C1))),(1)P_1 = \mathcal{F}_{\mathrm{RepNCSPELAN4}}\left(\operatorname{Concat}\left(\operatorname{Up}(P_2), \phi(C_1)\right)\right), \tag*{(1)}

where ϕ(⋅)\phi(\cdot) denotes channel projection and FRepNCSPELAN4\mathcal{F}_{\mathrm{RepNCSPELAN4}} denotes the fusion block. In this way, P1P_1 preserves the high-resolution local details of C1C_1 while inheriting the semantic prior from P2P_2, alleviating the semantic gaps between different depth features.

High-resolution detail injection for tiny objects. After obtaining P1P_1, we further use it to compensate for the fine-grained details that are missing in the shallow feature P2P_2. However, either a direct dense convolution or a bidirectional cross attention for the fusion of P1P_1 and P2P_2 will cause computational bottlenecks due to the large spatial size of P1P_1. We therefore adopt a deformable cross-attention design, where P2P_2 serves as query and P1P_1 serves as key and value:

P^1=DeformAttn⁡(Q=P2,K=P1,V=P1).(2)\hat{P}_1 = \operatorname{DeformAttn}(Q = P_2, K = P_1, V = P_1). \tag*{(2)}

Here, P^1\hat{P}_1 denotes the retrieved detail feature, which is adaptively extracted from P1P_1 according to the spatial prior of P2P_2. Since P^1\hat{P}_1 is essentially local detail responses from P1P_1, it cannot replace the original P2P_2. Instead, we fuse it back into P2P_2 to form the final detail-enhanced shallow feature P2′P'_2:

P2′=Fact(Fnorm(Conv⁡1×1(Concat⁡(P2,P^1)))),(3)P'_2 = \mathcal{F}_{\mathrm{act}}\left(\mathcal{F}_{\mathrm{norm}}\left(\operatorname{Conv}_{1 \times1}\left(\operatorname{Concat}(P_2,\hat{P}_1)\right)\right)\right), \tag*{(3)}

where Fnorm\mathcal{F}_{\mathrm{norm}} and Fact\mathcal{F}_{\mathrm{act}} denote normalization and activation, respectively. The resulting P2′P'_2 retains the semantic content of P2P_2 and the local detail supplement from the highest-resolution P1P_1. Compared with the global or deformable self-attention interaction, the computational cost of CSDF is more acceptable, as analyzed in Appendix § 11, making the use of the highest-resolution feature more practical in tiny object detection.

Ellipse-guided shallow supervision

EGSS aims to guide P2′P'_2 to learn reliable foreground classification and coarse localization priors, rather than making final predictions on the intermediate representation. Although CSDF enriches P2′P'_2 with high-resolution details, it may also transfer dense background responses from P1P_1 to P2P_2. As shown in Figure 4, both P1P_1 and P2P_2 can respond strongly to background textures and local patterns. When injecting detail cues from P1P_1 into P2P_2, these background responses may be transferred together with object-related details, thereby amplifying non-object responses in complex scenes. To address this side effect, we introduce EGSS, which applies shallow auxiliary supervision to P2′P'_2 during training and is completely removed during inference, introducing no additional inference cost.

Feature visualization and response analysis of CSDF

Figure 4. Feature visualization and response analysis of CSDF. We compare C1C_1 vs. P1P_1 and P2P_2 vs. P2′P_2'. The bottom-left statistics report μin\mu_{\mathrm{in}}, μout\mu_{\mathrm{out}}, and FBR defined in Eq. (7). After CSDF enhancement, P1P_1 and P2′P_2' show stronger response concentration on GT regions.

Ellipse-guided label assignment. Standard FCOS-style dense supervision [43] usually adopts box-shaped assignment or fixed-radius center sampling, which is not ideal for tiny objects. Since tiny objects occupy only a few pixels, box boundaries often include background pixels and introduce noisy supervision. Center sampling can reduce boundary noise, but a fixed region cannot adapt well to different aspect ratios and may even remove all valid positives for extremely tiny objects.

At the same time, the detail-enhanced shallow feature P2′P'_2 has a limited receptive field and is more suitable for detecting small objects. For large objects, a feature point on P2′P'_2 often perceives only a small part of the instance and cannot understand the complete structure well. Assigning such objects to supervise P2′P'_2 may introduce ambiguous signals and distract the shallow feature from tiny-object regions. Motivated by the scale-aware design of FCOS [43], we restrict EGSS to size-matched objects and define positive samples with a scale filtering strategy and an ellipse-guided geometric constraint. Let G\mathcal{G} denote the set of ground-truth boxes, P\mathcal{P} denote the set of feature locations on P2′P'_2, and s2s_2 denote the stride of P2′P'_2. The positive sample set Apos\mathcal{A}_{\mathrm{pos}} is defined as:

Apos={(pi,qj)∣pi=(xi,yi)∈P, qj=(cx(j),cy(j),wj,hj)∈G,\mathcal{A}_{\mathrm{pos}} = \left\{(p_i,q_j)\mid p_i=(x_i,y_i)\in\mathcal{P},\ q_j=(c_x^{(j)},c_y^{(j)},w_j,h_j)\in\mathcal{G}, \right.
rmin⁡≤wjhjs2≤rmax⁡,(xi−cx(j))2(wj/2)2+(yi−cy(j))2(hj/2)2≤1}.(4)\left. r_{\min}\le\frac{\sqrt{w_jh_j}}{s_2}\le r_{\max},\quad\frac{(x_i-c_x^{(j)})^2}{(w_j/2)^2}+\frac{(y_i-c_y^{(j)})^2}{(h_j/2)^2}\le1\right\}. \tag*{(4)}

Here, (cx(j),cy(j),wj,hj)(c_x^{(j)},c_y^{(j)},w_j,h_j) denote the center, width, and height of the jj-th ground-truth box, and [rmin⁡,rmax⁡][r_{\min},r_{\max}] filters objects whose sizes do not match the receptive field of P2′P'_2. Compared with rectangular assignment, the elliptical constraint naturally adapts better to object aspect ratios and suppresses boundary noise for tiny objects, while the scale filter focuses supervision on size-matched tiny objects, which helps P2′P'_2 pay more attention to learning to perceive tiny objects. Meanwhile, when a feature point matches multiple objects, we assign it to the smallest one to reduce ambiguity and bias the supervision toward smaller instances.

Shallow auxiliary supervision. Based on the above assignment, we attach a lightweight FCOS-style [43] auxiliary head to P2′P'_2 during training. The head contains two parallel towers for classification and regression, respectively. Each tower consists of two 3×33 \times3 convolution layers, followed by a prediction layer that outputs class logits or box regression results. The auxiliary loss is:

Laux=λclsLcls+λregLreg,(5)\mathcal{L}_{aux} = \lambda_{cls}\mathcal{L}_{cls} + \lambda_{reg}\mathcal{L}_{reg}, \tag*{(5)}

where λcls\lambda_{cls} and λreg\lambda_{reg} are the loss weights. We use focal loss for Lcls\mathcal{L}_{cls} to handle the severe foreground-background imbalance and a combination of ℓ1\ell_1 loss and GIoU [36] loss for Lreg\mathcal{L}_{reg} to provide more stable regression supervision.

Tiny-object regression is naturally sensitive to small localization shifts [39], especially on noisy shallow features. Since P2′P'_2 still contains non-negligible background responses, as shown in Figure 4, a strong regression loss may force the auxiliary branch to fit unstable box targets and disturb foreground discrimination. We therefore assign a small regression weight. In addition, we do not adopt centerness supervision by default, since tiny objects have only a few valid locations on the feature map and their centerness targets can vary sharply and become unreliable on the noisy shallow feature. EGSS therefore focuses on foreground classification and coarse localization, while final box refinement is left to the decoder. We empirically validate this design choice in Appendix § 14.§ 18.

Full-scale query interaction

In DETR-like detectors [4, 59, 25], final predictions are generated by decoder queries. Instead of attending only to high-level features, FSQI enables these queries to directly access the fine-grained details in P1P_1, further improving tiny object detection performance. Here, “full-scale” means that the decoder can attend to all feature levels, from the highest-resolution P1P_1 to deeper semantic features.

Full-scale encoder memory. We flatten and concatenate the semantically enhanced highest-resolution feature P1P_1, the detail-enhanced shallow feature P2′P'_2, and the higher-level features {P3,…,Pl}\{P_3, \ldots, P_l\} to construct the full-scale encoder memory:

M=Concat⁡(Flatten⁡(P1),Flatten⁡(P2′),…,Flatten⁡(Pl)).(6)\mathcal{M} = \operatorname{Concat}(\operatorname{Flatten}(P_1), \operatorname{Flatten}(P'_2), \ldots, \operatorname{Flatten}(P_l)). \tag*{(6)}

Here, M\mathcal{M} serves as the value tokens for decoder cross-attention. Since P1P_1 is semantically enhanced from raw C1C_1, its tokens are more compatible with the encoded features {P3,…,Pl}\{P_3, \ldots, P_l\}, alleviating the distribution gap between different-level features. To avoid noisy shallow responses disturbing query selection, FSQI excludes P1P_1 from query initialization and exposes it only during decoder cross-attention, where decoder queries can adaptively retrieve relevant high-resolution details.

Scale-aware sparse sampling. Since the receptive field of P1P_1 is relatively small, if we keep its sampling setting the same as other feature levels, decoder queries may fail to collect enough information from P1P_1. We therefore allocate more sampling points on P1P_1 in decoder deformable cross-attention phase. In practice, FSQI increases the number of sampling points on P1P_1 from 4 to 8, while keeping it unchanged for the remaining feature levels. This gives queries a larger local search radius on P1P_1 and improves their access to fine-grained spatial cues for tiny object detection.

Experiments

Datasets and evaluation metrics

Datasets. We evaluate ReDHF on three challenging tiny-object detection datasets: AI-TOD-v2 [46], VisDrone [58], and SODA-D [6]. AI-TOD-v2 and VisDrone cover dense aerial scenes with many tiny instances, while SODA-D provides high-resolution traffic scenes with many small and extremely small objects. These datasets cover both aerial and driving scenarios, making them suitable for evaluating the generality of ReDHF. Detailed dataset statistics are provided in Appendix § 9.

Evaluation metrics. We use Average Precision (AP) [21] as the main metric, which is calculated as the mean AP over the range of IoU thresholds from 0.50 to 0.95, with an interval of 0.05. To better evaluate performance on tiny objects, we also report dataset-specific scale-aware metrics. For AI-TOD-v2 [46], we follow [45] and report APvt_{vt}, APt_t, APs_s, and APm_{m}. For VisDrone [58] and SODA-D [6], we report APs_s and APeS_{eS} as the tiny-object metrics, respectively. Full scale-aware metrics are provided in Appendix § 10.

Implementation details

We evaluate ReDHF on three representative baselines: DINO-4scale [52], DQ-DETR [15], and Dome-DETR [14]. Dome-DETR uses HGNetv2 [56] as the backbone, while DINO-4scale and DQ-DETR use ResNet-50 [13]. All experiments are trained end-to-end and evaluated on 4 Tesla V100 GPUs. Unless otherwise stated, we keep all the baseline architectures unchanged and only introduce the three components of our method. For Dome-DETR and DQ-DETR, we follow their original configurations on AI-TOD-v2 and VisDrone. Since SODA-D is not included in their original benchmarks, we reuse the VisDrone training configuration for this dataset. For DINO-4scale, we adopt its default COCO [21] 24-epoch training recipe for all three datasets, changing only dataset-specific settings. For EGSS, we set τmin⁡=0\tau_{\min}=0 for all datasets, with τmax⁡=8\tau_{\max}=8 for AI-TOD-v2 and τmax⁡=16\tau_{\max}=16 for VisDrone and SODA-D. Complete training and implementation details are provided in Appendix § 8.

Main results

AI-TOD-v2. Table 1 reports the results on the AI-TOD-v2 [46] test split. ReDHF consistently improves all evaluated DETR-like variants, with average gains of +1.1 AP and +1.5 APvtAP_{vt}. Dome-DETR-L w/ ReDHF achieves the best result of 35.7 AP, surpassing previous state-of-the-art methods. The improvement is more notable on very tiny objects, with an average gain of +1.5 APvt_{\mathrm{vt}} across the three baseline variants. ReDHF brings consistent gains for most metrics except for APs_{\mathrm{s}} or APm_{\mathrm{m}}, which is expected since medium objects rely less on fine-grained local details and can already be well represented by deeper semantic features.

Method#Params.GFLOPsAPAP50AP_{50}AP75AP_{75}APvtAP_{vt}APtAP_tAPsAP_sAPmAP_m
CNN-based models
Cascade R-CNN [1]68.9M88.715.134.211.20.111.526.738.5
DetectoRS [32]134.8M≈160\approx16016.135.512.50.112.628.340.0
DetectoRS w/ RFLA [47]––24.855.218.59.324.830.338.2
YOLOv12-X [42]59.3M185.416.133.513.45.417.021.428.5
Transformer-based models
DNTR [23]128.4M298.126.256.720.212.826.431.037.0
Deformable-DETR[59]40M232.518.259.710.25.816.825.234.0
DINO-4scale† [52]47M354.425.160.816.312.124.031.040.5
DQ-DETR† [15]58.7M1805.4⋆1805.4^{\star}30.268.622.315.330.536.544.6
Dome-DETR-S† [14]13.2M173.1⋆173.1^{\star}32.166.326.917.532.138.245.0
Dome-DETR-M† [14]23.9M252.6⋆252.6^{\star}34.068.829.418.934.138.947.4
Dome-DETR-L† [14]36.0M358.7⋆358.7^{\star}34.669.230.419.635.639.847.3
Our method
DINO-4scale w/ ReDHF49.7M407.826.0+0.926.0_{+0.9}62.117.313.8+1.713.8_{+1.7}25.232.039.6
DQ-DETR w/ ReDHF61.9M1872.3⋆1872.3^{\star}31.4+1.231.4_{+1.2}69.822.616.6+1.316.6_{+1.3}31.236.744.3
Dome-DETR-S w/ ReDHF15.9M188.2⋆188.2^{\star}33.5+1.433.5_{+1.4}68.128.918.9+1.418.9_{+1.4}33.538.745.8
Dome-DETR-M w/ ReDHF26.7M304.7⋆304.7^{\star}35.0+1.035.0_{+1.0}68.930.620.7+1.820.7_{+1.8}34.839.247.7
Dome-DETR-L w/ ReDHF39.0M415.3⋆415.3^{\star}35.7+1.135.7_{+1.1}70.231.520.8+1.220.8_{+1.2}35.939.847.4

Table 1. Experiments on AI-TOD-v2 test split. All models are evaluated with 800×800800 \times800 input resolution. We compare ReDHF with both CNN-based and Transformer-based detectors. † denotes our re-implementation of the corresponding baseline. ⋆ denotes the average GFLOPs measured over the whole split when the computational cost varies across images.

VisDrone and SODA-D. Table 2 reports results on VisDrone [58] and SODA-D [6]. ReDHF improves all baselines on both datasets, with average gains of +1.4 AP / +1.7 APs_{\mathrm{s}} on VisDrone and +1.3 AP / +1.8 APeS_{\mathrm{eS}} on SODA-D. The best variants achieve 40.6 AP on VisDrone and 38.7 AP on SODA-D, respectively. Full scale-aware results are provided in Appendix § 10.

BaselineVisDrone APVisDrone APsAP_sSODA-D APSODA-D APeSAP_{eS}
DINO-4scale [52]34.3 → 35.4 (+1.1)25.6 → 27.4 (+1.8)28.6 → 30.1 (+1.5)10.5 → 12.6 (+2.1)
DQ-DETR [15]35.7 → 37.1 (+1.4)28.2 → 29.6 (+1.4)34.4 → 35.5 (+1.1)17.0 → 18.5 (+1.5)
Dome-DETR-S [14]35.9 → 37.5 (+1.6)28.3 → 30.3 (+2.0)35.4 → 36.8 (+1.4)17.6 → 19.6 (+2.0)
Dome-DETR-M [14]38.9 → 40.2 (+1.3)31.4 → 33.1 (+1.7)37.2 → 38.4 (+1.2)18.6 → 20.4 (+1.8)
Dome-DETR-L [14]39.0 → 40.6 (+1.6)31.5 → 33.1 (+1.6)37.6 → 38.7 (+1.1)19.7 → 21.4 (+1.7)
Avg. gain+1.4+1.7+1.3+1.8

Table 2. Experiments on VisDrone validation split and SODA-D test split. Each entry reports baseline → ReDHF, with the gain over the corresponding baseline shown in parentheses. APsAP_s is used as the tiny-object metric for VisDrone, and APeSAP_{eS} is used for SODA-D.

Efficiency analysis

ReDHF aims to improve tiny object detection with moderate overhead. As shown in Table 1, it consistently improves DETR-like baselines with limited increases in model size and computation. For example, on Dome-DETR-S [14], ReDHF improves AP by +1.4 while just increasing the average GFLOPs from 173.1 to 188.2. Similar trends are observed on DINO-4scale [52], DQ-DETR [15], and other Dome-DETR variants. Appendix § 11 provides a detailed complexity analysis.

Ablation study

We conduct ablation studies on AI-TOD-v2 [46] to analyze the effectiveness of ReDHF and its key design choices. Unless otherwise stated, Dome-DETR-S [14] is used as the default baseline. Additional ablations on sampling points, and EGSS loss design are provided in Appendix § 14.

Main ablation experiment. Table 3 reports the contribution of each component. For CSDF, raw C1C_1 reduces AP from 32.1 to 31.1, while the semantically aligned P1P_1 improves AP to 32.7, indicating that raw high-resolution details suffer from background responses and semantic mismatch. For FSQI, adding raw C1C_1 to the encoder memory improves AP to 32.5 since decoder queries can selectively attend to useful high-resolution details and are therefore less sensitive to shallow noise, and replacing it with P1P_1 further improves AP to 32.8. In contrast, using P1P_1 for query initialization drops AP to 31.9, suggesting that shallow high-resolution features are unsuitable for initializing decoder queries. When cooperating CSDF and FSQI together, AP can increase to 33.1, and EGSS further improves the full model to 33.5 AP and 18.9 APvt_{\mathrm{vt}}, confirming the complementary effects of all components.

CSDF C1C_1CSDF P1P_1FSQI C1C_1FSQI P1P_1q. init.EGSSAPAPvt_{\mathrm{vt}}APt_{\mathrm{t}}
32.117.532.1
✓31.116.830.8
✓32.718.032.7
✓32.517.832.4
✓✓31.917.632.0
✓32.818.132.8
✓✓33.118.333.0
✓✓✓33.518.933.5

Table 3. Component ablation of ReDHF. C1C_1 and P1P_1 denote the raw highest-resolution feature and its semantically enhanced one. “q. init.” means query initialization with P1P_1.

Design ablations. Table 4 and Table 5 study two key design choices of ReDHF. For EGSS, Rectangle, Circle, and Ellipse denote box-based, short-axis circle-based, and ellipse-guided assignment, respectively. Our method achieves the best performance, improving APvt_{\mathrm{vt}} by +1.3 over Rectangle and +0.8 over Circle. For CSDF, injecting high-resolution details only into P2P_2 gives the best result, reaching 33.5 AP and 18.9 APvt_{\mathrm{vt}}. Full results and analysis are provided in Appendix § 14.§ 1 and Appendix § 14.§ 2.

AssignmentAPAP50_{50}APvt_{\mathrm{vt}}
Rectangle33.266.917.6
Circle33.367.818.1
Ellipse (ours)33.568.118.9

Table 4. Comparison of different label assignment strategies for EGSS. The best result is highlighted in bold.

Inject layerAPAP50_{50}APvt_{\mathrm{vt}}
P2∼P3P_2 \sim P_332.866.518.0
P2∼P5P_2 \sim P_532.466.318.3
P2P_2 only33.568.118.9

Table 5. Ablation on the detail injection level.

Visualization analysis

Detection visualization. Figure 3 compares ReDHF with corresponding baselines across different scenarios on AI-TOD-v2 [46]. ReDHF makes better predictions and recovers more ultra-tiny objects, showing that our method helps detectors better preserve and use fine-grained details for tiny objects.

Qualitative comparison of baseline detectors and ReDHF variants across three scenarios

Figure 3. (a) DINO-4scale: baseline (left) vs. ReDHF (right); (b) DQ-DETR: baseline (left) vs. ReDHF (right); (c) Dome-DETR-L: baseline (left) vs. ReDHF (right). Qualitative comparison on the AI-TOD-v2 test split. Each pair compares a baseline detector with its ReDHF variant on the same scene. The green, red, yellow, and blue boxes represent TP, FP, FN with ground-truth box short side ≤4\le4 pixels, and the remaining FN, respectively. Compared with the baselines, ReDHF produces cleaner predictions and helps recover more tiny objects, with more green boxes and fewer red/yellow/blue boxes. Class labels are omitted for clarity.

Feature maps visualization. To further analyze CSDF, we compute channel-wise ℓ2\ell_2 response maps and measure their mean responses inside and outside GT regions, denoted as μin\mu_{\mathrm{in}} and μout\mu_{\mathrm{out}}. The foreground-to-background response ratio (FBR) is then defined as:

μin=1∣Ωin∣∑(x,y)∈ΩinR(x,y),μout=1∣Ωout∣∑(x,y)∈ΩoutR(x,y),FBR=μinμout.(7)\mu_{\mathrm{in}} = \frac{1}{\lvert\Omega_{\mathrm{in}}\rvert} \sum_{(x,y)\in\Omega_{\mathrm{in}}} R(x,y), \qquad\mu_{\mathrm{out}} = \frac{1}{\lvert\Omega_{\mathrm{out}}\rvert} \sum_{(x,y)\in\Omega_{\mathrm{out}}} R(x,y), \qquad\mathrm{FBR} = \frac{\mu_{\mathrm{in}}}{\mu_{\mathrm{out}}}. \tag*{(7)}

Here, R(x,y)R(x,y) denotes the normalized response at location (x,y)(x,y), while Ωin\Omega_{\mathrm{in}} and Ωout\Omega_{\mathrm{out}} denote the set of locations inside and outside GT regions. A larger FBR indicates stronger response concentration on object regions. As shown in Figure 4, P1P_1 achieves higher FBR than raw C1C_1, and P12P_1^2 shows the same improvement over P2P_2. This suggests that CSDF makes the highest-resolution feature more object-focused and transfers more effective fine-grained details to the shallow feature.

Conclusion

In this paper, we propose ReDHF, a plug-and-play framework that revives the discarded highest-resolution feature for tiny object detection. Motivated by the contradiction between the limited representation of tiny objects and the high cost of utilizing high-resolution features, we introduce CSDF, EGSS, and FSQI to effectively address these issues, achieving consistent improvements across different DETR-like models on the AI-TOD-v2, VisDrone and SODA-D datasets. Although retaining the highest-resolution representation introduces additional computation, ReDHF yields consistent gains that are most pronounced on tiny objects, and we only observe localized degradation for large objects in dense scenes with smaller-capacity variants. Detailed analyses are provided in Appendix § 13. Future work will explore more adaptive high-resolution feature utilization under low-resource and crowded scenes. We hope ReDHF can inspire continued progress in this area.

Acknowledgments and Disclosure of Funding

This work was supported by the Pengcheng Laboratory Research Project (PCL2025A14), the Guangdong Basic and Applied Basic Research Foundation (Grant No. 2024A1515011292, Project No. 2024A1515011437, Project No. 2025B1515120012), and the National Natural Science Foundation of China (Grant No. 62606254). The authors declare no competing interests.

Appendix

This appendix provides additional implementation details, complete experimental results, and supplementary analyses for ReDHF. Section A describes the training and method-specific configurations. Section B provides detailed statistics of the three benchmarks, while Section C reports the complete results on VisDrone and SODA-D. Section D analyzes the practical efficiency and cost-accuracy trade-off of high-resolution feature reuse. Section E examines performance across object scales and generalization to a general-purpose detection benchmark. Section F discusses the practical limitations and failure cases of ReDHF. Finally, Section G provides additional ablations and robustness analyses of the key design choices.

Additional Implementation Details

Baselines and backbones. We evaluate ReDHF on three representative DETR-based detectors: DINO-4scale [52], DQ-DETR [15], and Dome-DETR [14]. Dome-DETR adopts HGNetv2 [56] as its backbone, while DINO-4scale and DQ-DETR use ResNet-50 [13]. All experiments are trained end-to-end and evaluated on 4 Tesla V100 GPUs. Unless otherwise stated, we keep all the baseline architectures unchanged and only introduce the three components of our method.

Training configurations. For Dome-DETR and DQ-DETR, we follow their original training configurations on AI-TOD-v2 and VisDrone. Since SODA-D is not included in their original benchmarks, we use the corresponding VisDrone training configuration for SODA-D. For DINO-4scale, we follow its default COCO [21] 24-epoch training recipe on all three datasets, while adapting only the dataset-specific settings.

ReDHF settings. For EGSS, we set rmin⁡=0r_{\min} = 0 on all datasets. We use rmax⁡=8r_{\max} = 8 on AI-TOD-v2 and rmax⁡=16r_{\max} = 16 on VisDrone and SODA-D. The default auxiliary-loss weights are λcls=1.0\lambda_{\mathrm{cls}} = 1.0 and λreg=0.10\lambda_{\mathrm{reg}} = 0.10, and centerness supervision is not used. For the deformable interactions, we use 8 sampling points by default in both CSDF and FSQI. The sensitivity analyses of the sampling-point number and the EGSS loss configuration are provided in Sec. G.4 and Sec. G.6, respectively.

Dataset details

AI-TOD-v2. AI-TOD-v2 [46] contains 28,036 aerial images with 752,745 annotated object instances. The dataset is split into 11,214 training images, 2,804 validation images, and 14,018 test images. It is characterized by extremely small object sizes, with an average object size of only 12.7 pixels. In particular, 86% of the objects are smaller than 16 pixels, and the largest object does not exceed 64 pixels. The object density also varies greatly across images, ranging from 1 to 2,667 objects per image, with an average of 24.64 and a standard deviation of 63.94.

VisDrone. VisDrone [58] contains 14,018 images across 10 distinct categories, with 6,471 images for training, 548 for validation, and 3,190 for testing. It covers diverse objects such as pedestrians, bicycles, and vehicles, and presents severe challenges in terms of diverse crowd densities. Specifically, the average number of objects per image is 40.7, with a standard deviation of 46.41.

SODA-D. SODA-D [6] contains 24,828 high-quality traffic-scene images with 278,433 annotated instances across 9 categories. The training, validation, and test subsets are split with an approximate ratio of 50% : 20% : 30%. The dataset includes high-resolution driving scenes with many small and extremely small objects under diverse real-world conditions, including different viewpoints, weather, and illumination. These properties make SODA-D a challenging benchmark for small object detection in driving scenarios.

Full results on VisDrone and SODA-D

VisDrone. Table 6 reports the results on the VisDrone [58] validation split. Our ReDHF on DQ-DETR [15] improves AP by +1.4%. On Dome-DETR-S and Dome-DETR-M, it raises AP from 35.9 to 37.5 and from 38.9 to 40.2, respectively. When applied to Dome-DETR-L, ReDHF achieves the best AP(40.6%), improving AP, AP50_{50}, and AP75_{75} by +1.6%, +1.7%, and +2.2%, respectively.

Method#Params.GFLOPsImage ScaleAPAP50_{50}AP75_{75}APs_sAPm_mAPl_l
CNN-based models
YOLOv11 [17]25.3M86.6640×64027.9––18.140.953.1
YOLOv12 [42]26.3M88.6640×64029.2––18.741.851.7
RFLA [47]69.2M162.0800×80024.3––14.435.945.8
YOLC [22]––1024×64039.6––32.949.356.2
CFINet [51]41.4M291.91200×120023.9––16.334.757.4
ESOD [24]–232.91920×192039.462.9–31.1––
Transformer-based models
DDQ DETR [54]–2701333×80031.6––23.242.151.1
DPAKS [48]218.3M1457.61333×80039.1––32.149.563.4
UGS [39]––1333×80038.161.9–24.247.356.6
DINO-4scale† [52]47M544.31333×80034.357.334.825.645.659.5
DQ-DETR† [15]58.7M2826.6⋆1333×80035.759.436.428.245.855.1
Dome-DETR-S† [14]13.2M167.3⋆800×80035.958.037.228.345.958.9
Dome-DETR-M† [14]23.9M296.2⋆800×80038.962.140.731.449.362.3
Dome-DETR-L† [14]36.0M385.1⋆800×80039.062.340.631.549.362.8
Our method
DINO-4scale w/ ReDHF49.7M627.61333×80035.4+1.158.136.227.4+1.845.659.4
DQ-DETR w/ ReDHF61.9M2928.3⋆1333×80037.1+1.461.037.929.6+1.446.557.1
Dome-DETR-S w/ ReDHF15.9M180.8⋆800×80037.5+1.659.439.530.3+2.047.158.6
Dome-DETR-M w/ ReDHF26.7M338.3⋆800×80040.2+1.363.342.633.1+1.750.062.0
Dome-DETR-L w/ ReDHF39.0M449.3⋆800×80040.6+1.664.042.833.1+1.651.063.1
Method#Params.GFLOPsImage ScaleAPAP50AP_{50}AP75AP_{75}APeSAP_{eS}APrSAP_{rS}APgsAP_{gs}APNAP_{N}
CNN-based models
Faster RCNN [35]41.2M292.31200×120028.959.724.213.925.634.343.2
Cascade RCNN [1]68.9M320.11200×120031.259.927.814.127.537.146.9
RFLA [47]41.2M292.11200×120029.760.225.213.226.935.444.6
Transformer-based models
Deformable-DETR[59]35.2M739.11200×120019.244.813.76.315.424.934.2
DINO-4scale† [52]47M354.4800×80028.659.324.210.524.236.247.4
DQ-DETR† [15]58.7M1802.6⋆800×80034.462.631.817.030.941.251.4
Dome-DETR-S† [14]13.2M160.12800×80035.463.933.017.631.842.152.2
Dome-DETR-M† [14]23.9M291.78800×80037.266.634.718.634.144.853.6
Dome-DETR-L† [14]36.0M373.12800×80037.667.535.219.734.144.554.8
Our method
DINO-4scale w/ ReDHF49.7M407.8800×80030.1+1.559.626.312.6+2.125.637.347.6
DQ-DETR w/ ReDHF61.9M1867.5800×80035.5+1.163.633.318.5+1.532.241.951.4
Dome-DETR-S w/ ReDHF15.9M184.08800×80036.8+1.465.734.519.6+2.033.643.252.8
Dome-DETR-M w/ ReDHF26.7M332.34800×80038.4+1.267.935.820.4+1.834.945.154.6
Dome-DETR-L w/ ReDHF39.0M435.78800×80038.7+1.168.436.321.4+1.735.145.455.0

Table 6. Experiments on VisDrone val split. We compare ReDHF with both CNN-based and Transformer-based detectors. † denotes our re-implementation of the corresponding baseline. ⋆ denotes the average GFLOPs measured over the whole split when the computational cost varies across images.

SODA-D. Table 7 reports the results on the SODA-D [6] test split. ReDHF brings +1.5% AP on DINO-4scale, +1.1% AP on DQ-DETR, and +1.4%, +1.2%, +1.1% AP on Dome-DETR-S/M/L, respectively. The gains are more pronounced on extremely small objects. Dome-DETR-L w/ ReDHF achieves the best result, with 38.7 AP and 21.4 APeS_{eS}.

Detailed efficiency analysis

Computational cost of high-resolution feature reuse

Let NiN_i denote the number of tokens in PiP_i, and KK denote the number of sampling points. Standard global self attention for PiP_i and Pi+1P_{i+1} has a complexity of O(Ni2⋅Ni+12)O(N_i^2 \cdot N_{i+1}^2), while that in deformable self attention is O(K⋅Ni+K⋅Ni+1)O(K \cdot N_i + K \cdot N_{i+1}), which becomes expensive when the spatial resolution is large. In contrast, the complexity of our deformable interactions in CSDF is O(K⋅Ni+1)O(K \cdot N_{i+1}), where K≪NiK \ll N_i, making the use of the highest-resolution feature P1P_1 much more practical. Table 8 compares the computational cost of different ways to use the highest-resolution feature on DINO-4scale [52]. Directly adding raw C1C_1 into the encoder and decoder causes a large cost increase, raising the whole-model GFLOPs from 354.4 to 3057.7. The main cost comes from the encoder, whose GFLOPs increase from 203.9 to 2709.5 due to dense interaction on the highest-resolution feature. The decoder cost also increases from 34.9 to 161.0. This is because each decoder layer performs value projection on the multi-scale memory, and the very large spatial size of C1C_1 makes repeated projection expensive.

Table 8: Computational cost comparison on DINO-4scale. We report GFLOPs of the backbone, encoder, decoder, other parts, and the whole model. “Direct C1C_1” denotes directly adding the raw highest-resolution feature into the encoder and decoder. “Others” includes components not counted in the backbone, encoder, or decoder.

ModelBackboneEncoderDecoderOthersWhole
DINO-4scale [52]104.5203.934.911.1354.4
DINO-4scale w/ direct C1C_1104.5(–)2709.5(+2505.6)161.0(+126.1)82.7(+71.6)3057.7(+2703.3)
DINO-4scale w/ ReDHF104.5(–)251.2(+47.3)40.7(+5.8)11.4(+0.3)407.8(+53.4)

Table 8.

In contrast, ReDHF increases the whole-model GFLOPs only to 407.8. Compared with direct C1C_1 usage, ReDHF reduces the total computation by about 86.7%, the encoder computation by about 90.7%, and the decoder computation by about 74.7%. This reduction comes from two designs. First, CSDF retrieves high-resolution details through sparse deformable interaction instead of dense global interaction. Second, FSQI exposes P1P_1 to decoder cross-attention in a lightweight manner. In our

implementation, the value projection for the highest-resolution feature is applied only once, while the remaining feature levels follow the original per-layer projection. Although FSQI allocates more sampling points to P1P_1, the total GFLOPs increase remains moderate, as shown in Figure 5. Moreover, EGSS is only used during training and removed during inference, so it does not add test-time computation. Overall, ReDHF is an efficient high-resolution detail reintroduction framework for tiny object detection. It avoids the expensive computational cost of utilizing raw C1C_1, while still effectively releasing the potential of the highest-resolution feature for tiny object detection.

Sensitivity analysis of the sampling-point numbers in CSDF and FSQI

Figure 5. Sensitivity analysis of the sampling-point numbers in CSDF and FSQI. The bottom x-axis shows the number of sampling points, the top x-axis shows the corresponding GFLOPs. The left y-axis reports AP, while the right y-axis reports APvtAP_{vt}. In the left subplot, we vary the CSDF points while fixing the FSQI points to 8. In the right subplot, we vary the FSQI points while fixing the CSDF points to 8.

Compute-matched comparison with input resolution scaling

One misconception for the improvement of ReDHF is that it introduces additional computation for high-resolution feature processing. To distinguish the contribution of the proposed design from simply increasing the computational budget, we compare ReDHF with resolution-scaled baselines while keeping the remaining detector and training settings unchanged.

As shown in Table 9, increasing the input resolution of DINO-4scale from 800 to 864 raises the computation from 354.4 to 412.4 GFLOPs, but improves AP and APvtAP_{vt} by only 0.3 points. In contrast, ReDHF achieves 26.0 AP and 13.8 APvtAP_{vt} at 407.8 GFLOPs, outperforming the resolution-scaled baseline by 0.6 AP and 1.4 APvtAP_{vt} under a comparable computational budget. A similar trend is observed for Dome-DETR-L. These results indicate that the gains of ReDHF cannot be reproduced by uniformly increasing the input resolution, supporting the effectiveness of explicitly recovering and exploiting the discarded high-resolution representation.

ModelInputGFLOPsAPAPvtAP_{\mathrm{vt}}
DINO-4scale800354.425.112.1
DINO-4scale864412.425.412.4
DINO-4scale w/ ReDHF800407.826.013.8
Dome-DETR-L800358.734.619.6
Dome-DETR-L880481.135.020.0
Dome-DETR-L w/ ReDHF800415.335.720.8

Table 9. Compute-matched comparison with input-resolution scaling on AI-TOD-v2. We increase only the input resolution of the baselines while keeping the detector and training settings unchanged. The best result within each baseline family is highlighted in bold.

Inference latency and GPU memory

GFLOPs do not fully characterize the practical cost of retaining the highest-resolution feature. We therefore measure wall-clock inference latency and GPU memory under identical baseline and ReDHF settings. All measurements are conducted on a Tesla V100 with batch size 1.

Table 10 shows that ReDHF introduces additional latency and memory consumption due to retaining and querying P1P_1. Across the evaluated Dome-DETR variants on AI-TOD-v2 and VisDrone, the additional latency ranges from 98.0 to 208.3 ms, while the increase in average GPU memory ranges from 0.19 to 0.29 GiB. Meanwhile, ReDHF consistently improves the corresponding tiny-object AP by 1.2-2.0 points. These results quantify the practical cost associated with recovering high-resolution evidence and complement the GFLOPs analysis above. Overall, ReDHF achieves a favorable accuracy-efficiency trade-off, where the additional runtime and memory are accompanied by consistent improvements in tiny-object detection.

DatasetVariantTiny AP ↑\uparrowLatency (ms) ↓\downarrowAvg. memory (GiB) ↓\downarrowPeak memory (GiB) ↓\downarrow
AI-TOD-v2Dome-DETR-S17.5→18.917.5 \to\mathbf{18.9}409.6→507.6409.6 \to507.60.30→0.560.30 \to0.560.63→1.720.63 \to1.72
AI-TOD-v2Dome-DETR-M18.9→20.718.9 \to\mathbf{20.7}450.0→578.0450.0 \to578.00.39→0.650.39 \to0.650.77→1.860.77 \to1.86
AI-TOD-v2Dome-DETR-L19.6→20.819.6 \to\mathbf{20.8}487.8→655.2487.8 \to655.20.47→0.760.47 \to0.760.86→1.990.86 \to1.99
VisDroneDome-DETR-S28.3→30.328.3 \to\mathbf{30.3}454.5→584.1454.5 \to584.10.27→0.460.27 \to0.460.63→1.720.63 \to1.72
VisDroneDome-DETR-M31.4→33.131.4 \to\mathbf{33.1}512.8→680.1512.8 \to680.10.36→0.570.36 \to0.570.77→1.860.77 \to1.86
VisDroneDome-DETR-L31.5→33.131.5 \to\mathbf{33.1}543.5→751.8543.5 \to751.80.47→0.690.47 \to0.690.88→2.010.88 \to2.01

Table 10. Practical inference cost of ReDHF on AI-TOD-v2 and VisDrone. Wall-clock latency and GPU memory are measured on a single Tesla V100 with batch size 1 under identical baseline and ReDHF settings. Each entry reports baseline →\to ReDHF. Tiny AP denotes APvtAP_{\mathrm{vt}} on AI-TOD-v2 and APsAP_{\mathrm{s}} on VisDrone.

Detection Quality and Generalization

Scale-wise analysis

Because ReDHF is designed primarily for tiny objects, we further examine whether recovering high-resolution evidence introduces a systematic trade-off at larger object scales. Table 11 summarizes the average gains over the five evaluated DETR variants, with the scale categories ordered from the smallest to larger objects for each dataset.

Table 11: Scale-wise performance gains of ReDHF averaged over the five evaluated DETR variants. The dataset-specific metrics are ordered from smaller to larger object scales.

DatasetSmallest objectsIntermediate objectsLarger objects
AI-TOD-v2APvtAP_{vt} +1.48APtAP_t +0.86APsAP_s +0.40, APmAP_m +0.00
VisDroneAPsAP_s +1.70APmAP_m +0.86APlAP_l +0.32
SODA-DAPeSAP_{eS} +1.82APrSAP_{rS} +1.26APgSAP_{gS} +0.82, APNAP_N +0.40

Table 11.

The improvements are consistently largest on the smallest object categories and gradually decrease with object size. Nevertheless, the averaged gains on the remaining scales are non-negative across all three datasets. This indicates that ReDHF concentrates its benefits on objects most affected by feature downsampling without systematically sacrificing the detection quality of larger objects.

Generalization on COCO

To further examine whether ReDHF remains effective beyond tiny-object-focused benchmarks, we evaluate DINO-4scale with ReDHF on COCO using the same training recipe as the baseline. As shown in Table 12, ReDHF improves the overall AP from 49.0 to 49.6. Improvements are also observed across all object scales, with APsAP_s, APmAP_m, and APlAP_l increasing by 0.6, 0.8, and 0.5 points, respectively. These results suggest that recovering high-resolution evidence does not require sacrificing medium- or large-object performance and that ReDHF can also provide complementary information on a general-purpose detection benchmark.

Table 12: Generalization of ReDHF on COCO using DINO-4scale. Both models use the same 12-epoch training recipe.

ModelAPAPsAP_sAPmAP_mAPlAP_l
DINO-4scale49.032.052.363.0
DINO-4scale w/ ReDHF49.6 (+0.6)32.6 (+0.6)53.1 (+0.8)63.5 (+0.5)

Table 12.

Limitations Analysis

Retaining and querying an additional highest-resolution feature P1P_1 inevitably introduces extra computation and memory compared with the original detectors. As quantified in Table 8, however, this overhead is substantially smaller than that of directly incorporating the raw highest-resolution feature. More importantly, the additional cost is accompanied by consistent improvements in tiny-object detection, indicating a favorable accuracy-efficiency trade-off for exploiting high-resolution evidence.

As analysed in Sec. E, the benefits of ReDHF are concentrated on tiny objects, and the average improvement gradually decreases as object size increases, although no systematic degradation is observed at larger scales. This behavior is consistent with the motivation of ReDHF: high-resolution evidence is most useful for objects whose visual information is severely affected by feature downsampling. To identify where the occasional degradation on larger objects occurs, we divide the VisDrone validation set into two equally sized subsets according to the number of annotated instances per image and evaluate the same trained checkpoints on both subsets.

As shown in Table 13, across all three variants, ReDHF improves all object scales in sparse scenes. In dense scenes, APsAP_s and APmAP_m remain consistently improved, whereas APlAP_l decreases for Dome-DETR-S and Dome-DETR-M but increases for Dome-DETR-L. Dense scenes contain many spatially adjacent high-resolution responses, which may increase background interference and hinder smaller-capacity detectors from preserving the broader semantic context required for large-object recognition.

Table 13: Density-wise analysis on the VisDrone validation set. Images are ranked by the number of annotated instances and divided into two equally sized sparse and dense subsets. Each entry reports baseline →\rightarrow ReDHF, with the absolute change in parentheses.

VariantSparse APsAP_sSparse APmAP_mSparse APlAP_lDense APsAP_sDense APmAP_mDense APlAP_l
Dome-DETR-S28.24 →\rightarrow 30.31 (+2.07)47.09 →\rightarrow 48.91 (+1.82)60.60 →\rightarrow 63.12 (+2.52)28.11 →\rightarrow 30.58 (+2.47)44.76 →\rightarrow 45.96 (+1.20)57.15 →\rightarrow 55.60 (-1.55)
Dome-DETR-M30.86 →\rightarrow 33.02 (+2.16)50.80 →\rightarrow 51.10 (+0.30)64.86 →\rightarrow 65.13 (+0.27)32.02 →\rightarrow 33.46 (+1.44)48.46 →\rightarrow 49.41 (+0.95)60.76 →\rightarrow 59.80 (-0.96)
Dome-DETR-L31.54 →\rightarrow 32.90 (+1.36)50.12 →\rightarrow 52.09 (+1.97)68.34 →\rightarrow 68.86 (+0.52)31.71 →\rightarrow 33.37 (+1.66)49.15 →\rightarrow 50.40 (+1.25)55.60 →\rightarrow 56.62 (+1.02)

Table 13.

Therefore, the degradation is specific to large objects in dense scenes for smaller-capacity detectors, rather than a systematic trade-off across object scales.

Additional ablations and Robustness analyses

Label assignment strategy in EGSS

Table 14 compares different label assignment strategies for EGSS. The results show that the positive sample definition is important for shallow auxiliary supervision. Rectangle-based assignment reaches 33.2 AP, but its APvt_{vt} is 17.6. This suggests that using the whole box region as positives may introduce boundary background pixels, which is harmful for very tiny objects.

Assignment strategyAPAP50_{50}AP75_{75}APvt_{vt}APt_tAPs_sAPm_m
Rectangle-based33.266.928.717.633.038.245.0
Short-axis circle-based33.367.828.418.132.938.446.1
Ellipse-guided (ours)33.568.128.918.933.538.745.8

Table 14. Comparison of different label assignment strategies for EGSS. The best result in each column is highlighted in bold.

We further compare a short-axis circle-based strategy, where the positive region is a circle centered at the object center and its radius is set to the short semi-axis of the corresponding ground-truth box. This strategy reduces boundary noise and improves APvt_{vt} from 17.6 to 18.1, but it still ignores object aspect ratios and may discard valid positive regions along the long axis.

In contrast, ellipse-guided assignment adapts to the object geometry by using both the long and short axes. It achieves the best AP, AP50_{50}, AP75_{75}, APvt_{vt}, APt_t, and APs_s. Compared with rectangle-based and short-axis circle-based assignment, it improves APvt_{vt} by +1.3 and +0.8, respectively. These results show that the elliptical constraint better suppresses boundary noise while preserving sufficient valid positives for tiny objects. Although the circle-based strategy obtains the best APm_m, EGSS mainly targets tiny and small objects, where ellipse-guided assignment gives more consistent gains. Therefore, we adopt ellipse-guided assignment as the default strategy.

Detail injection level analysis

Table 15 studies where the highest-resolution details from P1P_1 should be injected. All settings keep the other components unchanged and only vary which feature levels receive the highest-resolution details. Injecting details only into P2P_2 gives the best result, reaching 33.5 AP and 18.9 APvt_{vt}. This suggests that P2P_2 is the most suitable level to receive highest-resolution details, because it is spatially closest to P1P_1 while still containing more semantic information than raw shallow features. In contrast, injecting details into more levels does not bring further gains. When the injection range is extended to P2∼P3P_2 \sim P_3 or P2∼P5P_2 \sim P_5, AP decreases to 32.8 and 32.4, respectively. This is likely because deeper feature levels are more responsible for medium and large objects, while excessive high-resolution details may become redundant or even introduce noise into semantic features. These results support our design choice of injecting high-resolution details only into P2P_2.

Inject layerAPAP50_{50}AP75_{75}APvt_{vt}APt_tAPs_sAPm_m
P2∼P3P_2 \sim P_332.866.528.118.032.738.545.0
P2∼P5P_2 \sim P_532.466.327.318.332.238.244.6
P2P_2 only33.568.128.918.933.538.745.8

Table 15. Ablation on the detail injection level. We keep other components unchanged and only vary the target feature levels. The best result in each column is highlighted in bold.

Downsampling strategy for semantically enhanced highest-resolution feature

Table 16 compares different strategies for adapting P1P_1 to the resolution of P2P_2 in CSDF. The results show that simple fixed-rule downsampling is not always effective. Bilinear interpolation severely degrades performance, suggesting that directly resizing high-resolution responses may blur tiny-object details and introduce background interference. AvgPool and strided convolution perform better, but they still remain inferior to deformable cross-attention on the main metrics.

Aggregation modeParamsGFLOPsAPAP50_{50}AP75_{75}APvt_{vt}APt_tAPs_sAPm_m
Bilinear15.88182.329.461.924.014.929.436.641.5
AvgPool15.88182.333.166.928.718.432.938.845.0
Strided Conv15.95187.532.866.727.918.132.838.044.7
Deform. Cross-Attn15.93188.233.568.128.918.933.538.745.8

Table 16. Comparison of different strategies for downsampling P1P_1 to the P2P_2 resolution in CSDF. We keep the semantically enhanced P1P_1 and other ReDHF components unchanged, and only vary the strategies. The best result in each column is highlighted in bold.

Deformable cross-attention achieves the best AP and APvt\mathrm{AP}_{vt}. This is because it allows P2P_2 to sparsely retrieve more relevant local responses from P1P_1. Rather than uniformly aggregating all nearby high-resolution signals, it can preserve more useful details for tiny object while reducing the redundant interferences of P1P_1 more effectively. Although AvgPool obtains a slightly higher APs\mathrm{AP}_s, deformable cross-attention provides the best overall trade-off between accuracy and complexity, especially on very tiny objects. We therefore use deformable cross-attention as the default downsampling strategy for P1P_1 in CSDF.

To better understand the large performance gap between different downsampling strategies, we further measure their foreground-to-background response ratios. As shown in Table 17, bilinear interpolation increases FBR by only 0.04 over the original P2P_2, whereas deformable cross-attention increases it by 0.38 and achieves the highest APvt\mathrm{AP}_{vt}. AvgPool and strided convolution show intermediate improvements. These results indicate that the degradation of bilinear interpolation is associated with indiscriminate mixing of shallow high-resolution responses, while selective aggregation better concentrates the injected information on object regions.

Aggregationμin(P2′)\mu_{\mathrm{in}}(P'_2)μout(P2′)\mu_{\mathrm{out}}(P'_2)FBR(P2′)\mathrm{FBR}(P'_2)FBR(P2)\mathrm{FBR}(P_2)ΔFBR\Delta\mathrm{FBR}APvt\mathrm{AP}_{vt}
Bilinear0.490.331.481.440.0414.9
AvgPool0.450.271.671.450.2218.4
Strided Conv0.520.321.631.450.1818.1
Deformable cross-attn0.570.311.841.460.3818.9

Table 17. Foreground-to-background response analysis for different downsampling strategies in CSDF. Δ\DeltaFBR denotes the increase from P2P_2 to P2′P'_2. The best result in each column is highlighted in bold.

Sampling points in CSDF and FSQI

We further study the influence of sampling-point numbers in CSDF and FSQI, as shown in Figure 5. Both modules achieve the best performance with 8 sampling points, suggesting that sufficient sparse sampling is important for capturing fine-grained cues from the highest-resolution feature. However, further increasing the number of sampling points leads to noticeable drops in both AP and APvt\mathrm{AP}_{vt}, indicating that overly dense sampling may introduce redundant or noisy responses from high-resolution features.

The two modules also show different sensitivities to the sampling-point number. CSDF performs encoder-side detail injection from P1P_1 to P2P_2, so the sampled responses are directly fused into the shallow feature. As a result, inappropriate sampling may more easily introduce background responses and disturb the feature representation. In contrast, FSQI exposes P1P_1 to decoder queries through cross-attention, where each query can adaptively retrieve useful high-resolution responses together with information from other feature levels. This query-driven selection makes FSQI relatively more stable under different sampling settings, although excessive sampling is still harmful. Therefore, we set the number of sampling points to 8 for both CSDF and FSQI by default.

Scale threshold in EGSS

We further analyze the scale threshold rmax⁡r_{\max} used by EGSS. Since rmax⁡r_{\max} determines which ground-truth objects are considered size-matched to the shallow feature P2′P'_2, its appropriate value depends on the object-scale distribution of each dataset.

Table 18 reports both the percentage of valid ground-truth instances covered by each threshold and the resulting detection performance. On AI-TOD-v2, rmax⁡=8r_{\max}=8 already covers 98.17% of valid ground-truth instances and performs slightly better than rmax⁡=16r_{\max}=16. In contrast, VisDrone and SODA-D contain broader object-scale distributions, for which increasing rmax⁡r_{\max} from 8 to 16 raises the coverage from 64.14% to 90.28% and from 73.69% to 100%, respectively, with small corresponding performance improvements. Importantly, both settings consistently outperform their baselines on all three datasets. These results show that rmax⁡r_{\max} mainly controls scale coverage rather than requiring sensitive model-specific tuning.

Table 18: Sensitivity to the scale threshold rmax⁡r_{\max} in EGSS. GT coverage denotes the percentage of valid ground-truth instances selected for supervising P2′P'_2 under the corresponding threshold. Tiny AP denotes APvtAP_{vt}, APsAP_s, and APeSAP_{eS} on AI-TOD-v2, VisDrone, and SODA-D, respectively. The adopted setting for each dataset is highlighted in bold.

DatasetBaseline AP / Tiny APGT coverage @8 / @16 (%)AP / Tiny AP @8AP / Tiny AP @16Default rmax⁡r_{\max}
AI-TOD-v232.1 / 17.598.17 / 100.0033.5 / 18.933.4 / 18.78
VisDrone35.9 / 28.364.14 / 90.2837.1 / 29.837.5 / 30.316
SODA-D35.4 / 17.673.69 / 100.0036.6 / 19.336.8 / 19.616

Table 18. Sensitivity to the scale threshold rmax⁡r_{\max} in EGSS. GT coverage denotes the percentage of valid ground-truth instances selected for supervising P2′P'_2 under the corresponding threshold. Tiny AP denotes APvtAP_{vt}, APsAP_s, and APeSAP_{eS} on AI-TOD-v2, VisDrone, and SODA-D, respectively. The adopted setting for each dataset is highlighted in bold.

Loss design in EGSS

Table 19 studies the loss design of EGSS. The classification-only setting already achieves 33.2 AP, suggesting that foreground discrimination is essential for supervising the shallow feature. Adding a lightweight regression loss further improves AP to 33.5 and APvtAP_{vt} from 18.1 to 18.9, indicating that coarse localization guidance is helpful for very tiny objects. However, adding centerness supervision causes a clear drop to 32.1 AP and 15.8 APvtAP_{vt}. This suggests that centerness targets are unreliable on noisy shallow features, especially when tiny objects have only a few valid locations.

Table 19: Ablation study on the EGSS loss design. The centerness loss weight is set to 0.1 when used. The best result is highlighted in bold.

Settingλcls\lambda_{\mathrm{cls}}λreg\lambda_{\mathrm{reg}}APAP50_{50}APvt_{vt}APt_tAPs_s
cls only1.0–33.268.218.133.238.5
cls + reg1.00.1033.568.118.933.538.7
cls + reg + ctr1.00.1032.166.515.832.238.2
cls + reg1.00.0533.367.118.733.339.2
cls + reg1.00.2033.167.217.633.738.6
cls + reg1.00.5032.867.717.332.338.6
cls + reg0.50.1032.667.016.032.438.2

Table 19.

We further vary the classification-regression weights. A small regression weight works better than a strong one: increasing λreg\lambda_{\mathrm{reg}} from 0.10 to 0.20 or 0.50 reduces APvt_{vt} from 18.9 to 17.6 and 17.3, respectively. Reducing the classification weight to 0.5 also degrades performance, showing that foreground classification should remain dominant in EGSS. Therefore, we use λcls=1.0\lambda_{\mathrm{cls}} = 1.0 and λreg=0.10\lambda_{\mathrm{reg}} = 0.10 by default, and omit centerness supervision.

To examine whether the degradation caused by centerness results from a particular loss weight, we vary λctr\lambda_{\mathrm{ctr}} from 0 to 0.10. As shown in Table 20, the performance decreases monotonically as the centerness weight increases, with APvt_{vt} dropping from 18.9 without centerness to 18.0 and 15.8 at weights 0.05 and 0.10, respectively. We then analyze the sparsity of centerness targets across object scales as shown in Table 22. Very tiny objects have only 1.90 positive locations on average, and 93.90% of them contain at most one location with a centerness target no smaller than 0.5. In comparison, the number of valid locations increases rapidly with object size. This analysis explains why explicit centerness supervision becomes excessively sparse and unstable for very tiny objects, supporting its exclusion from EGSS.

Table 20: Sensitivity to the centerness loss weight in EGSS. All other settings are kept unchanged.

λctr\lambda_{\mathrm{ctr}}APAPvt_{vt}
033.518.9
0.0532.918.0
0.1032.115.8

Table 20.

Table 22: Statistics of centerness targets across object scales on AI-TOD-v2. NposN_{\mathrm{pos}} denotes the number of positive feature locations assigned to each ground-truth instance, and Nc≥0.5N_{c\geq0.5} denotes the number of positive locations whose centerness target is at least 0.5.

ScaleNum. GTAvg. NposN_{\mathrm{pos}}Npos≤2N_{\mathrm{pos}} \leq2 (%)Avg. Nc≥0.5N_{c\geq0.5}Nc≥0.5≤1N_{c\geq0.5} \leq1 (%)
Very tiny473171.9078.260.5493.90
Tiny2768656.4423.691.7933.76
Small4561219.193.185.211.57
Medium678281.050.1321.590.93

Table 22.

Robustness across random seeds

To examine whether the reported gains depend on a favorable random initialization, we repeat the full ReDHF configuration using three random seeds. As shown in Table 21, ReDHF achieves 33.49 ±\pm 0.04 AP and 18.81 ±\pm 0.07 APvt_{vt}. The small standard deviations indicate that the improvements of ReDHF are stable across different random seeds.

Table 21: Robustness of the full ReDHF model across three random seeds on AI-TOD-v2.

RunAPAPvt_{vt}
Original33.5218.88
Seed 233.4418.74
Seed 333.5018.82
Mean ±\pm Std.33.49 ±\pm 0.0418.81 ±\pm 0.07

Table 21.

NeurIPS Paper Checklist

  1. Claims

Question: Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope?

Answer: [Yes]

Justification: We provide a detailed and accurate description of the paper’s contributions and scope in both the abstract and introduction.

Guidelines:

  • The answer [N/A] means that the abstract and introduction do not include the claims made in the paper.

  • The abstract and/or introduction should clearly state the claims made, including the contributions made in the paper and important assumptions and limitations. A [No] or [N/A] answer to this question will not be perceived well by the reviewers.

  • The claims made should match theoretical and experimental results, and reflect how much the results can be expected to generalize to other settings.

  • It is fine to include aspirational goals as motivation as long as it is clear that these goals are not attained by the paper.

  1. Limitations

Question: Does the paper discuss the limitations of the work performed by the authors?

Answer: [Yes]

Justification: We discuss the limitations of ReDHF in Sec. 5 and Appendix F, including additional computational overhead, scale-dependent gains, and localized degradation for large objects in dense scenes.

Guidelines:

  • The answer [N/A] means that the paper has no limitation while the answer [No] means that the paper has limitations, but those are not discussed in the paper.

  • The authors are encouraged to create a separate “Limitations” section in their paper.

  • The paper should point out any strong assumptions and how robust the results are to violations of these assumptions (e.g., independence assumptions, noiseless settings, model well-specification, asymptotic approximations only holding locally). The authors should reflect on how these assumptions might be violated in practice and what the implications would be.

  • The authors should reflect on the scope of the claims made, e.g., if the approach was only tested on a few datasets or with a few runs. In general, empirical results often depend on implicit assumptions, which should be articulated.

  • The authors should reflect on the factors that influence the performance of the approach. For example, a facial recognition algorithm may perform poorly when image resolution is low or images are taken in low lighting. Or a speech-to-text system might not be used reliably to provide closed captions for online lectures because it fails to handle technical jargon.

  • The authors should discuss the computational efficiency of the proposed algorithms and how they scale with dataset size.

  • If applicable, the authors should discuss possible limitations of their approach to address problems of privacy and fairness.

  • While the authors might fear that complete honesty about limitations might be used by reviewers as grounds for rejection, a worse outcome might be that reviewers discover limitations that aren’t acknowledged in the paper. The authors should use their best judgment and recognize that individual actions in favor of transparency play an important role in developing norms that preserve the integrity of the community. Reviewers will be specifically instructed to not penalize honesty concerning limitations.

  1. Theory assumptions and proofs

Question: For each theoretical result, does the paper provide the full set of assumptions and a complete (and correct) proof? Answer: [N/A]

Justification: The paper does not include theoretical results.

Guidelines:

  • The answer [N/A] means that the paper does not include theoretical results.

  • All the theorems, formulas, and proofs in the paper should be numbered and cross-referenced.

  • All assumptions should be clearly stated or referenced in the statement of any theorems.

  • The proofs can either appear in the main paper or the supplemental material, but if they appear in the supplemental material, the authors are encouraged to provide a short proof sketch to provide intuition.

  • Inversely, any informal proof provided in the core of the paper should be complemented by formal proofs provided in appendix or supplemental material.

  • Theorems and Lemmas that the proof relies upon should be properly referenced.

Experimental result reproducibility

Question: Does the paper fully disclose all the information needed to reproduce the main experimental results of the paper to the extent that it affects the main claims and/or conclusions of the paper (regardless of whether the code and data are provided or not)?

Answer: [Yes]

Justification: The paper provide the network architectures and hyperparameters required for the experiments in Sec. 3 and Sec. 4.2.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • If the paper includes experiments, a [No] answer to this question will not be perceived well by the reviewers: Making the paper reproducible is important, regardless of whether the code and data are provided or not.

  • If the contribution is a dataset and/or model, the authors should describe the steps taken to make their results reproducible or verifiable.

  • Depending on the contribution, reproducibility can be accomplished in various ways. For example, if the contribution is a novel architecture, describing the architecture fully might suffice, or if the contribution is a specific model and empirical evaluation, it may be necessary to either make it possible for others to replicate the model with the same dataset, or provide access to the model. In general. releasing code and data is often one good way to accomplish this, but reproducibility can also be provided via detailed instructions for how to replicate the results, access to a hosted model (e.g., in the case of a large language model), releasing of a model checkpoint, or other means that are appropriate to the research performed.

  • While NeurIPS does not require releasing code, the conference does require all submissions to provide some reasonable avenue for reproducibility, which may depend on the nature of the contribution. For example (a) If the contribution is primarily a new algorithm, the paper should make it clear how to reproduce that algorithm. (b) If the contribution is primarily a new model architecture, the paper should describe the architecture clearly and fully. (c) If the contribution is a new model (e.g., a large language model), then there should either be a way to access this model for reproducing the results or a way to reproduce the model (e.g., with an open-source dataset or instructions for how to construct the dataset). (d) We recognize that reproducibility may be tricky in some cases, in which case authors are welcome to describe the particular way they provide for reproducibility. In the case of closed-source models, it may be that access to the model is limited in some way (e.g., to registered users), but it should be possible for other researchers to have some path to reproducing or verifying the results.

Open access to data and code

Question: Does the paper provide open access to the data and code, with sufficient instructions to faithfully reproduce the main experimental results, as described in supplemental material?

Answer: [Yes]

Justification: The code are provided in the supplemental material. The data is public available and have been widely used.

Guidelines:

  • The answer [N/A] means that paper does not include experiments requiring code.

  • Please see the NeurIPS code and data submission guidelines (https://neurips.cc/public/guides/CodeSubmissionPolicy) for more details.

  • While we encourage the release of code and data, we understand that this might not be possible, so [No] is an acceptable answer. Papers cannot be rejected simply for not including code, unless this is central to the contribution (e.g., for a new open-source benchmark).

  • The instructions should contain the exact command and environment needed to run to reproduce the results. See the NeurIPS code and data submission guidelines (https://neurips.cc/public/guides/CodeSubmissionPolicy) for more details.

  • The authors should provide instructions on data access and preparation, including how to access the raw data, preprocessed data, intermediate data, and generated data, etc.

  • The authors should provide scripts to reproduce all experimental results for the new proposed method and baselines. If only a subset of experiments are reproducible, they should state which ones are omitted from the script and why.

  • At submission time, to preserve anonymity, the authors should release anonymized versions (if applicable).

  • Providing as much information as possible in supplemental material (appended to the paper) is recommended, but including URLs to data and code is permitted.

Experimental setting/details

Question: Does the paper specify all the training and test details (e.g., data splits, hyperparameters, how they were chosen, type of optimizer) necessary to understand the results?

Answer: [Yes]

Justification: We provide detailed descriptions of all the training and test details, including backbones, hyperparameters, and training recipes in § 4.2.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • The experimental setting should be presented in the core of the paper to a level of detail that is necessary to appreciate the results and make sense of them.

  • The full details can be provided either with the code, in appendix, or as supplemental material.

Experiment statistical significance

Question: Does the paper report error bars suitably and correctly defined or other appropriate information about the statistical significance of the experiments?

Answer: [Yes]

Justification: We report the mean and standard deviation across three random seeds for the full ReDHF model on AI-TOD-v2, as shown in Table 21.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • The authors should answer [Yes] if the results are accompanied by error bars, confidence intervals, or statistical significance tests, at least for the experiments that support the main claims of the paper.

  • The factors of variability that the error bars are capturing should be clearly stated (for example, train/test split, initialization, random drawing of some parameter, or overall run with given experimental conditions).

  • The method for calculating the error bars should be explained (closed form formula, call to a library function, bootstrap, etc.)

  • The assumptions made should be given (e.g., Normally distributed errors).

  • It should be clear whether the error bar is the standard deviation or the standard error of the mean.

  • It is OK to report 1-sigma error bars, but one should state it. The authors should preferably report a 2-sigma error bar than state that they have a 96% CI, if the hypothesis of Normality of errors is not verified.

  • For asymmetric distributions, the authors should be careful not to show in tables or figures symmetric error bars that would yield results that are out of range (e.g., negative error rates).

  • If error bars are reported in tables or plots, the authors should explain in the text how they were calculated and reference the corresponding figures or tables in the text.

Experiments compute resources

Question: For each experiment, does the paper provide sufficient information on the computer resources (type of compute workers, memory, time of execution) needed to reproduce the experiments?

Answer: [Yes]

Justification: We provide the hardware specifications required for the experiments.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • The paper should indicate the type of compute workers CPU or GPU, internal cluster, or cloud provider, including relevant memory and storage.

  • The paper should provide the amount of compute required for each of the individual experimental runs as well as estimate the total compute.

  • The paper should disclose whether the full research project required more compute than the experiments reported in the paper (e.g., preliminary or failed experiments that didn’t make it into the paper).

Code of ethics

Question: Does the research conducted in the paper conform, in every respect, with the NeurIPS Code of Ethics https://neurips.cc/public/EthicsGuidelines?

Answer: [Yes]

Justification: The research conducted in the paper conform with the NeurIPS Code of Ethics Guidelines:

  • The answer [N/A] means that the authors have not reviewed the NeurIPS Code of Ethics.

  • If the authors answer [No], they should explain the special circumstances that require a deviation from the Code of Ethics.

  • The authors should make sure to preserve anonymity (e.g., if there is a special consideration due to laws or regulations in their jurisdiction).

Broader impacts

Question: Does the paper discuss both potential positive societal impacts and negative societal impacts of the work performed?

Answer: [Yes]

Justification: Our method significantly improves tiny object detection and can benefit applications such as remote sensing, traffic monitoring, and safety inspection.

Guidelines:

  • The answer [N/A] means that there is no societal impact of the work performed.

  • If the authors answer [N/A] or [No], they should explain why their work has no societal impact or why the paper does not address societal impact.

  • Examples of negative societal impacts include potential malicious or unintended uses (e.g., disinformation, generating fake profiles, surveillance), fairness considerations (e.g., deployment of technologies that could make decisions that unfairly impact specific groups), privacy considerations, and security considerations.

  • The conference expects that many papers will be foundational research and not tied to particular applications, let alone deployments. However, if there is a direct path to any negative applications, the authors should point it out. For example, it is legitimate to point out that an improvement in the quality of generative models could be used to generate Deepfakes for disinformation. On the other hand, it is not needed to point out that a generic algorithm for optimizing neural networks could enable people to train models that generate Deepfakes faster.

  • The authors should consider possible harms that could arise when the technology is being used as intended and functioning correctly, harms that could arise when the technology is being used as intended but gives incorrect results, and harms following from (intentional or unintentional) misuse of the technology.

  • If there are negative societal impacts, the authors could also discuss possible mitigation strategies (e.g., gated release of models, providing defenses in addition to attacks, mechanisms for monitoring misuse, mechanisms to monitor how a system learns from feedback over time, improving the efficiency and accessibility of ML).

Safeguards

Question: Does the paper describe safeguards that have been put in place for responsible release of data or models that have a high risk for misuse (e.g., pre-trained language models, image generators, or scraped datasets)?

Answer: [Yes]

Justification: Our method exclusively utilizes open-source models and datasets, ensuring that there is no risk of misuse.

Guidelines:

  • The answer [N/A] means that the paper poses no such risks.

  • Released models that have a high risk for misuse or dual-use should be released with necessary safeguards to allow for controlled use of the model, for example by requiring that users adhere to usage guidelines or restrictions to access the model or implementing safety filters.

  • Datasets that have been scraped from the Internet could pose safety risks. The authors should describe how they avoided releasing unsafe images.

  • We recognize that providing effective safeguards is challenging, and many papers do not require this, but we encourage authors to take this into account and make a best faith effort.

Licenses for existing assets

Question: Are the creators or original owners of assets (e.g., code, data, models), used in the paper, properly credited and are the license and terms of use explicitly mentioned and properly respected?

Answer: [Yes]

Justification: Our method exclusively utilizes open-source models and datasets.

Guidelines:

  • The answer [N/A] means that the paper does not use existing assets.

  • The authors should cite the original paper that produced the code package or dataset.

  • The authors should state which version of the asset is used and, if possible, include a URL.

  • The name of the license (e.g., CC-BY 4.0) should be included for each asset.

  • For scraped data from a particular source (e.g., website), the copyright and terms of service of that source should be provided.

  • If assets are released, the license, copyright information, and terms of use in the package should be provided. For popular datasets, paperswithcode.com/datasets has curated licenses for some datasets. Their licensing guide can help determine the license of a dataset.

  • For existing datasets that are re-packaged, both the original license and the license of the derived asset (if it has changed) should be provided.

  • If this information is not available online, the authors are encouraged to reach out to the asset’s creators.

13. New assets

Question: Are new assets introduced in the paper well documented and is the documentation provided alongside the assets?

Answer: [N/A]

Justification: The paper does not release new assets.

Guidelines:

  • The answer [N/A] means that the paper does not release new assets.

  • Researchers should communicate the details of the dataset/code/model as part of their submissions via structured templates. This includes details about training, license, limitations, etc.

  • The paper should discuss whether and how consent was obtained from people whose asset is used.

  • At submission time, remember to anonymize your assets (if applicable). You can either create an anonymized URL or include an anonymized zip file.

14. Crowdsourcing and research with human subjects

Question: For crowdsourcing experiments and research with human subjects, does the paper include the full text of instructions given to participants and screenshots, if applicable, as well as details about compensation (if any)?

Answer: [N/A]

Justification: This study does not involve any crowdsourced experiments or research with human subjects.

Guidelines:

  • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects.

  • Including this information in the supplemental material is fine, but if the main contribution of the paper involves human subjects, then as much detail as possible should be included in the main paper.

  • According to the NeurIPS Code of Ethics, workers involved in data collection, curation, or other labor should be paid at least the minimum wage in the country of the data collector.

15. Institutional review board (IRB) approvals or equivalent for research with human subjects

Question: Does the paper describe potential risks incurred by study participants, whether such risks were disclosed to the subjects, and whether Institutional Review Board (IRB) approvals (or an equivalent approval/review based on the requirements of your country or institution) were obtained?

Answer: [N/A]

Justification: The paper does not involve crowdsourcing nor research with human subjects.

Guidelines:

  • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects.

  • Depending on the country in which research is conducted, IRB approval (or equivalent) may be required for any human subjects research. If you obtained IRB approval, you should clearly state this in the paper.

  • We recognize that the procedures for this may vary significantly between institutions and locations, and we expect authors to adhere to the NeurIPS Code of Ethics and the guidelines for their institution.

  • For initial submissions, do not include any information that would break anonymity (if applicable), such as the institution conducting the review.

Declaration of LLM usage

Question: Does the paper describe the usage of LLMs if it is an important, original, or non-standard component of the core methods in this research? Note that if the LLM is used only for writing, editing, or formatting purposes and does not impact the core methodology, scientific rigor, or originality of the research, declaration is not required.

Answer: [N/A]

Justification: The core method development in this research does not involve LLMs as any important, original, or non-standard components.

Guidelines:

  • The answer [N/A] means that the core method development in this research does not involve LLMs as any important, original, or non-standard components.

  • Please refer to our LLM policy in the NeurIPS handbook for what should or should not be described.

References

  1. [1]Zhaowei Cai and Nuno Vasconcelos. Cascade r-cnn: Delving into high quality object detection. In CVPR, 2018.arxiv.org/abs/1712.00726
  2. [2]Guiping Cao, Wenjian Huang, Xiangyuan Lan, Jianguo Zhang, Dongmei Jiang, and Yaowei Wang. Mlp-dino: category modeling and query graphing with deep mlp for object detection. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (IJCAI-24), Jeju, Republic of Korea, pages 3–9, 2024.
  3. [3]Guiping Cao, Wenjian Huang, Xiangyuan Lan, Jianguo Zhang, Dongmei Jiang, and Yaowei Wang. Cross-dino: Cross the deep mlp and transformer for small object detection. IEEE Transactions on Multimedia, 27:7369–7379, 2025.arxiv.org/abs/2505.21868
  4. [4]Nicolas Carion, Francisco Massa, Gabriel Synnaeve, Nicolas Usunier, Alexander Kirillov, and Sergey Zagoruyko. End-to-end object detection with transformers. In European conference on computer vision, pages 213–229. Springer, 2020.arxiv.org/abs/2005.12872
  5. [5]Qiang Chen, Xiangbo Su, Xinyu Zhang, Jian Wang, Jiahui Chen, Yunpeng Shen, Chuchu Han, Ziliang Chen, Weixiang Xu, Fanrong Li, et al. Lw-detr: A transformer replacement to yolo for real-time detection. arXiv preprint arXiv:2406.03459, 2024.arxiv.org/abs/2406.03459
  6. [6]Gong Cheng, Xiang Yuan, Xiwen Yao, Kebing Yan, Qinghua Zeng, Xingxing Xie, and Junwei Han. Towards large-scale small object detection: Survey and benchmarks. IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(11):13467–13488, 2023.DOI
  7. [7]Jifeng Dai, Yi Li, Kaiming He, and Jian Sun. R-fcn: Object detection via region-based fully convolutional networks. Advances in neural information processing systems, 29, 2016.arxiv.org/abs/1605.06409
  8. [8]Sohail Ali Farooqui, Zuhair Ahmed Khan Taha, Mohammed Mudassir Uddin, and Shahnawaz Alam. Laf-yolov10 with partial convolution backbone, attention-guided feature pyramid, auxiliary p2 head, and wise-iou loss for small object detection in drone aerial imagery. arXiv preprint arXiv:2602.13378, 2026.arxiv.org/abs/2602.13378
  9. [9]Ross Girshick. Fast r-cnn. In Proceedings of the IEEE international conference on computer vision, pages 1440–1448, 2015.
  10. [10]Yuqi Gong, Xuehui Yu, Yao Ding, Xiaoke Peng, Jian Zhao, and Zhenjun Han. Effective fusion factor in fpn for tiny object detection. In Proceedings of the IEEE/CVF winter conference on applications of computer vision, pages 1160–1168, 2021.arxiv.org/abs/2011.02298
  11. [11]Cao Guiping, Huang Xiangyuan, Lan Wenjian, Zhang Jianguo, Jiang Dongmei, and Yaowei Wang. Ds-det: Single-query paradigm and attention disentangled learning for flexible object detection. In Proceedings of the 33rd ACM International Conference on Multimedia, 2025.DOI
  12. [12]Kaiming He, Georgia Gkioxari, Piotr Dollár, and Ross Girshick. Mask r-cnn. In Proceedings of the IEEE international conference on computer vision, pages 2961–2969, 2017.
  13. [13]Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 770–778, 2016.arxiv.org/abs/1512.03385
  14. [14]Zhangchi Hu, Peixi Wu, Jie Chen, Huyue Zhu, Yijun Wang, Yansong Peng, Hebei Li, and Xiaoyan Sun. Dome-detr: Detr with density-oriented feature-query manipulation for efficient tiny object detection, 2025.arxiv.org/abs/2505.05741
  15. [15]Yi-Xin Huang, Hou-I Liu, Hong-Han Shuai, and Wen-Huang Cheng. Dq-detr: Detr with dynamic query for tiny object detection. In European Conference on Computer Vision, pages 290–305. Springer, 2025.arxiv.org/abs/2404.03507
  16. [16]Zhenchao Jin, Dongdong Yu, Luchuan Song, Zehuan Yuan, and Lequan Yu. You should look at all objects. In European conference on computer vision, pages 332–349. Springer, 2022.arxiv.org/abs/2207.07889
  17. [17]Rahima Khanam and Muhammad Hussain. Yolov11: An overview of the key architectural enhancements (2024). arXiv preprint arXiv:2410.17725, 2024.
  18. [18]Mate Kisantal, Zbigniew Wojna, Jakub Murawski, Jacek Naruniec, and Kyunghyun Cho. Augmentation for small object detection. arXiv preprint arXiv:1902.07296, 2019.arxiv.org/abs/1902.07296
  19. [19]Feng Li, Hao Zhang, Shilong Liu, Jian Guo, Lionel M Ni, and Lei Zhang. Dn-detr: Accelerate detr training by introducing query denoising. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 13619–13627, 2022.
  20. [20]Tsung-Yi Lin, Piotr Dollár, Ross Girshick, Kaiming He, Bharath Hariharan, and Serge Belongie. Feature pyramid networks for object detection. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 2117–2125, 2017.arxiv.org/abs/1612.03144
  21. [21]Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollár, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In European conference on computer vision, pages 740–755. Springer, 2014.arxiv.org/abs/1405.0312
  22. [22]Chenguang Liu, Guangshuai Gao, Ziyue Huang, Zhenghui Hu, Qingjie Liu, and Yunhong Wang. Yolc: You only look clusters for tiny object detection in aerial images. IEEE Transactions on Intelligent Transportation Systems, 25(10):13863–13875, 2024.arxiv.org/abs/2404.06180
  23. [23]Hou-I Liu, Yu-Wen Tseng, Kai-Cheng Chang, Pin-Jyun Wang, Hong-Han Shuai, and Wen-Huang Cheng. A denoising fpn with transformer r-cnn for tiny object detection. IEEE Transactions on Geoscience and Remote Sensing, 62:1–15, 2024.arxiv.org/abs/2406.05755
  24. [24]Kai Liu, Zhihang Fu, Sheng Jin, Ze Chen, Fan Zhou, Rongxin Jiang, Yaowu Chen, and Jiepeng Ye. Esod: Efficient small object detection on high-resolution images. IEEE Transactions on Image Processing, 34:183–195, 2024.
  25. [25]Shilong Liu, Feng Li, Hao Zhang, Xiao Yang, Xianbiao Qi, Hang Su, Jun Zhu, and Lei Zhang. DAB-DETR: Dynamic anchor boxes are better queries for DETR. In International Conference on Learning Representations, 2022.arxiv.org/abs/2201.12329
  26. [26]Shu Liu, Lu Qi, Haifang Qin, Jianping Shi, and Jiaya Jia. Path aggregation network for instance segmentation. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 8759–8768, 2018.arxiv.org/abs/1803.01534
  27. [27]Wei Liu, Dragomir Anguelov, Dumitru Erhan, Christian Szegedy, Scott Reed, Cheng-Yang Fu, and Alexander C Berg. Ssd: Single shot multibox detector. In European conference on computer vision, pages 21–37. Springer, 2016.
  28. [28]Yuchen Ma, Songtao Liu, Zeming Li, and Jian Sun. Iqdet: Instance-wise quality distribution sampling for object detection. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 1717–1725, 2021.arxiv.org/abs/2104.06936
  29. [29]Depu Meng, Xiaokang Chen, Zejia Fan, Gang Zeng, Houqiang Li, Yuhui Yuan, Lei Sun, and Jingdong Wang. Conditional detr for fast training convergence. In Proceedings of the IEEE/CVF international conference on computer vision, pages 3651–3660, 2021.arxiv.org/abs/2108.06152
  30. [30]Yansong Peng, Hebei Li, Peixi Wu, Yueyi Zhang, Xiaoyan Sun, and Feng Wu. D-fine: Redefine regression task in detr as fine-grained distribution refinement, 2024.arxiv.org/abs/2410.13842
  31. [31]Yansong Peng, Hebei Li, Yueyi Zhang, Xiaoyan Sun, and Feng Wu. Scene adaptive sparse transformer for event-based object detection. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 16794–16804, 2024.arxiv.org/abs/2404.01882
  32. [32]Siyuan Qiao, Liang-Chieh Chen, and Alan Yuille. Detectors: Detecting objects with recursive feature pyramid and switchable atrous convolution. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 10213–10224, 2021.arxiv.org/abs/2006.02334
  33. [33]Maithra Raghu, Thomas Unterthiner, Simon Kornblith, Chiyuan Zhang, and Alexey Dosovitskiy. Do vision transformers see like convolutional neural networks? Advances in neural information processing systems, 34:12116–12128, 2021.arxiv.org/abs/2108.08810
  34. [34]Joseph Redmon, Santosh Divvala, Ross Girshick, and Ali Farhadi. You only look once: Unified, real-time object detection. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 779–788, 2016.arxiv.org/abs/1506.02640
  35. [35]Shaoqing Ren, Kaiming He, Ross Girshick, and Jian Sun. Faster r-cnn: Towards real-time object detection with region proposal networks. Advances in neural information processing systems, 28, 2015.arxiv.org/abs/1506.01497
  36. [36]Hamid Rezatofighi, Nathan Tsoi, JunYoung Gwak, Amir Sadeghian, Ian Reid, and Silvio Savarese. Generalized intersection over union: A metric and a loss for bounding box regression. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 658–666, 2019.arxiv.org/abs/1902.09630
  37. [37]Aashish Sharma. Dm-efs: Dynamically multiplexed expanded features set form for robust and efficient small object detection. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 24569–24579, 2025.DOI
  38. [38]Huang Shihua, Lu Zhic​hao, Cun Xiaodong, Yu Yongjun, Zhou Xiao, and Shen Xi. Deim: Detr with improved matching for fast convergence, 2025.arxiv.org/abs/2412.04234
  39. [39]H. Sun, Y. Li, L. Yang, X. Cao, and B. Zhang. Uncertainty-aware gradient stabilization for small object detection. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), pages 8407–8417, 2025.arxiv.org/abs/2303.01803
  40. [40]Mingxing Tan, Ruoming Pang, and Quoc V Le. Efficientdet: Scalable and efficient object detection. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 10781–10790, 2020.arxiv.org/abs/1911.09070
  41. [41]Shiyi Tang, Shu Zhang, and Yini Fang. Hic-yolov5: Improved yolov5 for small object detection. In 2024 IEEE international conference on robotics and automation (ICRA), pages 6614–6619. IEEE, 2024.arxiv.org/abs/2309.16393
  42. [42]Yunjie Tian, Qixiang Ye, and David Doermann. Yolov12: Attention-centric real-time object detectors. arXiv preprint arXiv:2502.12524, 2025.arxiv.org/abs/2502.12524
  43. [43]Zhi Tian, Chunhua Shen, Hao Chen, and Tong He. FCOS: Fully convolutional one-stage object detection. In Proc. Int. Conf. Computer Vision (ICCV), 2019.arxiv.org/abs/1904.01355
  44. [44]Chengcheng Wang, Wei He, Ying Nie, Jianyuan Guo, Chuanjian Liu, Yunhe Wang, and Kai Han. Gold-yolo: Efficient object detector via gather-and-distribute mechanism. Advances in neural information processing systems, 36:51094–51112, 2023.arxiv.org/abs/2309.11331
  45. [45]Jinwang Wang, Wen Yang, Haowen Guo, Ruixiang Zhang, and Gui-Song Xia. Tiny object detection in aerial images. In 2020 25th international conference on pattern recognition (ICPR), pages 3791–3798. IEEE, 2021.DOI
  46. [46]Chang Xu, Jinwang Wang, Wen Yang, Huai Yu, Lei Yu, and Gui-Song Xia. Detecting tiny objects in aerial images: A normalized wasserstein distance and a new benchmark. In ISPRS Journal of Photogrammetry and Remote Sensing, volume 190, pages 79–93, 2022.DOI
  47. [47]Chang Xu, Jinwang Wang, Wen Yang, Huai Yu, Lei Yu, and Gui-Song Xia. Rfla: Gaussian receptive field based label assignment for tiny object detection. In European conference on computer vision, pages 526–543. Springer, 2022.arxiv.org/abs/2208.08738
  48. [48]Haozhi Xu, Xiaofang Yuan, and Yaonan Wang. Dpaks: Reliable detr guided by prior auxiliary knowledge for small object detection. IEEE Transactions on Multimedia, 2026.DOI
  49. [49]Chenhongyi Yang, Zehao Huang, and Naiyan Wang. Querydet: Cascaded sparse query for accelerating high-resolution small object detection. In Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition, pages 13668–13677, 2022.arxiv.org/abs/2103.09136
  50. [50]Fan Yang, Cheng Lu, Yandong Guo, Longin Jan Latecki, and Haibin Ling. Dually supervised feature pyramid for object detection and segmentation. arXiv preprint arXiv:1912.03730, 2019.arxiv.org/abs/1912.03730
  51. [51]Xiang Yuan, Gong Cheng, Kebing Yan, Qinghua Zeng, and Junwei Han. Small object detection via coarse-to-fine proposal generation and imitation learning. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), pages 6317–6327, October 2023.arxiv.org/abs/2308.09534
  52. [52]Hao Zhang, Feng Li, Shilong Liu, Lei Zhang, Hang Su, Jun Zhu, Lionel M Ni, and Heung-Yeung Shum. Dino: Detr with improved denoising anchor boxes for end-to-end object detection. arXiv preprint arXiv:2203.03605, 2022.arxiv.org/abs/2203.03605
  53. [53]Shifeng Zhang, Cheng Chi, Yongqiang Yao, Zhen Lei, and Stan Z Li. Bridging the gap between anchor-based and anchor-free detection via adaptive training sample selection. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 9759–9768, 2020.arxiv.org/abs/1912.02424
  54. [54]Shilong Zhang, Xinjiang Wang, Jiaqi Wang, Jiangmiao Pang, Chengqi Lyu, Wenwei Zhang, Ping Luo, and Kai Chen. Dense distinct query for end-to-end object detection. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 7329–7338, June 2023.arxiv.org/abs/2303.12776
  55. [55]Tianyang Zhang, Xiangrong Zhang, Chaozhuo Hua, Guanchun Wang, Xiao Han, and Licheng Jiao. Tiny object detection based on dynamic scale-awareness label assignment and contextual enhancement. Pattern Recognition, page 112449, 2025.DOI
  56. [56]Yian Zhao, Wenyu Lv, Shangliang Xu, Jinman Wei, Guanzhong Wang, Qingqing Dang, Yi Liu, and Jie Chen. Detrs beat yolos on real-time object detection. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 16965–16974, 2024.arxiv.org/abs/2304.08069
  57. [57]Benjin Zhu, Jianfeng Wang, Zhengkai Jiang, Fuhang Zong, Songtao Liu, Zeming Li, and Jian Sun. Autoassign: Differentiable label assignment for dense object detection. arXiv preprint arXiv:2007.03496, 2020.arxiv.org/abs/2007.03496
  58. [58]Pengfei Zhu, Longyin Wen, Dawei Du, Xiao Bian, Heng Fan, Qinghua Hu, and Haibin Ling. Detection and tracking meet drones challenge. IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(11):7380–7399, 2021.DOI
  59. [59]Xizhou Zhu, Weijie Su, Lewei Lu, Bin Li, Xiaogang Wang, and Jifeng Dai. Deformable detr: Deformable transformers for end-to-end object detection. arXiv preprint arXiv:2010.04159, 2020.arxiv.org/abs/2010.04159
  60. [60]Barret Zoph, Ekin D Cubuk, Golnaz Ghiasi, Tsung-Yi Lin, Jonathon Shlens, and Quoc V. Le. Learning data augmentation strategies for object detection. In European conference on computer vision, pages 566–583. Springer, 2020.arxiv.org/abs/1906.11172

Paper details

vlnc:W_w2vgy6qu
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 15

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents