Semi-Supervised Person Detection in Aerial Images with Instance Segmentation and Maximum Mean Discrepancy Distance

Abstract

Detecting sparse, small, lost persons with only a few pixels in high-resolution aerial images was, is, and remains an important and difficult mission, in which a vital role is played by accurate monitoring and intelligent co-rescuing for the search and rescue (SaR) system. However, many problems have not been effectively solved in existing remote-vision-based SaR systems, such as the shortage of person samples in SaR scenarios and the low tolerance of small objects for bounding boxes. To address these issues, a copy-paste mechanism (ISCP) with semi-supervised object detection (SSOD) via instance segmentation and maximum mean discrepancy distance is proposed (MMD), which can provide highly robust, multi-task, and efficient aerial-based person detection for the prototype SaR system. Specifically, numerous pseudo-labels are obtained by accurately segmenting the instances of synthetic ISCP samples to obtain their boundaries. The SSOD trainer then uses soft weights to balance the prediction entropy of the loss function between the ground truth and unreliable labels. Moreover, a novel evaluation metric MMD for anchor-based detectors is proposed to elegantly compute the IoU of the bounding boxes. Extensive experiments and ablation studies on Heridal and optimized public datasets demonstrate that our approach is effective and achieves state-of-the-art person detection performance in aerial images.

1. Introduction

Search and rescue (SaR) of survivors involves a race against time, which is of great significance to the construction of aerial SaR systems. The traditional method puts both pending rescuers and SaR workers in danger because of bad terrain and inefficient rescue measures. Unmanned aerial vehicles (UAVs) can provide immediate situational awareness over large areas. This makes SaR operations much cheaper and safer by reducing the time and number of rescuers needed in emergencies. In recent years, SaR missions based on drones, which allow for quick aerial views of huge regions with potentially difficult-to-reach terrain, have been developed in many countries [1,2,3,4]. While object detection as a crucial SaR mission step has advanced somewhat, it is still far from meeting the technical requirements for ground application, which may warrant further research.

In recent years, aerial-based person detection (APD) has gradually become a hot and challenging research topic in the field of low-altitude remote sensing. Researchers have attempted to create datasets of persons in aerial images and have obtained some promising results by utilizing existing creative object detection algorithms based on natural images. However, the results have been weak and lack robustness [5,6,7,8]. Compared to remote sensing objects [9,10,11,12,13,14,15], such as ships, vehicles, and airplanes, persons in aerial images are frequently costly to identify in SaR scenes, difficult to label manually, have fewer available datasets, and have multi-view shooting features that vary greatly. As a result, detecting persons is more difficult and prevents implementation of applications. The key step in APD is to collect a sufficient number of clear drone-based person objects and labeled instances, also addressing the issue of the person’s weak features and sparse distribution in high-resolution aerial images. Existing methods present a range of problems which urgently need to be solved, which are discussed below.

To tackle the few-shot problem, some popular approaches aim to get enough pseudo-labels through semi-supervised learning, which can effectively improve the performance of the anchor-based object detector. Since there are not many person labels in SaR scenes, the detector needs to be trained on unlabeled data that was generated by synthetic or online techniques. Several studies have used transfer learning [16] and active learning [17] to achieve high-accuracy results with less training data, using consistency-based and pseudo-label-based methods. First, [18] used unlabeled data to learn the model’s consistency, while [19] created fake labels to enable model training. The authors of [20] proposed a consistency-based semi-supervised object detection (CSD) method that can work on both single-stage and two-stage detectors by flipping the unlabeled samples horizontally and feeding them into the feature map of the detector network to calculate the consistency loss at the corresponding position. In [21], hard pseudo-labels were used for self-training and incorporated consistent regularization as a data augmentation principle into the training. The authors of [22] devised the co-rectify scheme, which involved training two models to check and correct each other’s pseudo-labels, which stopped false predictions from increasing and improved model accuracy by obtaining pseudo-labels online. In [23] the average RPN score of the proposal was used, which was identified through multi-stage learning, as a measure of uncertainty at the image level to make pseudo-labels and solve the problem of label noise overfitting caused by direct fitting. The authors of [24] suggested that there was a natural category imbalance in object detection. The authors designed an “unbiased teacher”, which uses the structure of a “mean teacher” to make a fake label to supervise both RPN and ROI heads. However, existing works focus solely on confidence scores for pseudo-labels, which cannot guarantee the localization accuracy of pseudo-boxes; in terms of consistency training, the widely used random resizing training only considers label-level consistency, while ignoring feature-level consistency. In this article, cooperative training strategies are designed for a soft threshold between reliable and pseudo-labels and candidate bounding boxes are sorted by probability predictive entropy to improve detection performance.

To detect small and indistinct persons in high-resolution aerial images, anchor-based detectors with intersection over union (IoU) for label assignment can be a reliable choice. IoU is the ratio of two boxes’ intersection to their union by calculating the overlap of the ground truth (GT) and prediction bounding boxes (PBBs), which has been used to assess the performance of object detection and segmentation. In anchor-based object detectors, several candidate bounding boxes are often generated simultaneously by the model, the boxes are sorted by their confidence level, and then the IoU [25] is calculated between the boxes to determine which one is the real object with others being deleted by non-maximal suppression (NMS). Some typical algorithms for optimizing IoU, for example, ref. [25], determine the similarity of two images in terms of their shapes, but they cannot show their distance and aspect ratio.The authors of [26] solved the problem of comparing the distance between two bounding boxes that do not overlap by generalizing to improve the way that the bounding boxes’ overlap is calculated. However, this still does not give a good picture of how close two bounding boxes are in terms of their distance and aspect ratio. In [27], how the two boxes overlapped, how far apart they were, and how big they were were considered. Then, the distance between them was made as small as possible, which made the loss function converge more quickly. To better reflect the difference between the two boxes, the CIoU of [27] added an image similarity influence factor to the DIoU of [27]. Ref. [28] broke down the aspect ratios and added anchor-based focal focus quality to improve the regression accuracy, as adding aspect ratios to CIoU can make it difficult for the model to find the best way to maximize similarity. Although the above methods have been shown to be effective in detecting natural images, using a fixed IoU threshold in aerial images could result in the loss of the small-scale object boxes, and the performance of detectors could be severely harmed by a person’s slight deviation.

In this article, we propose a simple and efficient semi-supervised learning method for detecting persons in high-resolution aerial images. We introduce an instance segmentation copy-paste mechanism (ISCP) to increase the number of hard examples, and solve the training of GT and pseudo-labels by use of SSOD in unlabeled images. A maximum mean discrepancy distance (MMD) [29] is designed to improve the anchor-based detector’s evaluation metrics in SaR scenes. This work represents a significant step forward for person detection in aerial images.

In summary, the article makes the following contributions:

• A semi-supervised learning strategy with pseudo-labels is developed for SaR scenarios, which mainly consists of three steps: training high-confidence teacher models from reliable labels, data augmentation with the instance segmentation copy-paste mechanism, and use of a teacher-student model with consistent loss function.
• To further boost the performance and effectiveness, the algorithm utilizes an MMD distance to evaluate the detector’s metrics, which can be easily embedded in single-stage and two-stage object detectors.
• The detection results of both public and optimized datasets are compared. Moreover, the detection results are also compared with other detection algorithms. The experimental results show that our proposed method achieved SOTA.
• To explore the robustness of person detection from aerial images for different SaR applications, datasets with multiple scenes are created and evaluated for non-commercial purposes.

The work presented in the article is structured as follows: Section 2 briefly describes anchor-based detectors with semi-supervised learning and maximum mean discrepancy distance for person detection, and presents a precise description of our approach. Section 3 describes a detailed investigation of detection results and quantitative performance evaluation with and without our optimized datasets and improved algorithms. Moreover, we discuss how different training strategies and hyperparameter settings affect detector performance. Section 4 summarizes the work and discusses future directions.

2. Materials and Methods

2.1. General Framework of Our Proposed Approach

In this work, we present a person detection method for aerial images. The overall framework, along with its technical components, is illustrated in Figure 1. The system is mainly categorized into four different modules: an object implantation module (OIM), a semi-supervised training module (SSTM), a maximum mean discrepancy distance evaluation module (MMD) and a detector. The OIM’s primary function is to generate masks from hard or not-detected samples and to implant them around the original objects, while retaining information about other objects. The SSTM takes real labels and high-confidence pseudo-labels to train and update the model by setting different weight ratios between the source teacher and the adapted student. The MMD evaluates the model’s performance parameters by approximating the object’s bounding boxes (BBs) as a new two-dimensional distribution function and comparing the distribution differences between the candidate P-BBs and the ground truth (GT). Any two-stage or single-stage anchor-based detector is acceptable as the detector. We adopt a practical and efficient detection paradigm available today for person detection, i.e., [30], that was already trained for the multiple models from the MS-COCO and VOC datasets and added many tricks from the latest detection algorithms. An overview of the framework is provided in the following subsection.

2.2. Anchor-Based Detectors with Maximum Mean Discrepancy Distance

The maximum mean discrepancy distance (MMD) [29] is used to see if two samples are from the same distribution. In transfer learning, MMD is a common metric used to measure how similar the source and target domains are in a regenerated Hilbert space. The training and test sets are taken from different but related distributions. Given the low tolerance of existing IoU evaluation methods for tiny object bounding boxes [31], for example, when computing IoU in the green box of Figure 2, slight deviations reduce the value of IoU; however, different size of objects results in varying degree of deterioration. (Reference our experimental result—small: $Io{U}_{AB}$ = 0.486, $Io{U}_{AC}$ = 0.091 (0.395↓); middle: $Io{U}_{AB}$ = 0.623, $Io{U}_{AC}$ = 0.375 (0.248↓); large: $Io{U}_{AB}$ = 0.755, $Io{U}_{AC}$ = 0.613 (0.142↓)). A better metric is designed for tiny objects based on the maximum mean discrepancy distance since it can consistently reflect the distance between distributions even if they have no overlap. Therefore, the new metric has better properties than IoU for measuring the similarity between tiny objects. The details are as follows:

Pixels of tiny objects and backgrounds in the rectangular bounding box are skewed and do not accurately represent the genuine object boundaries. Specifically, more pixels of the object are found towards the center, while more pixels of the background are found near the bounding box. To better describe the weights of the different pixels in the bounding boxes, the bounding box can be modeled into two dimensions with a K-rank Gaussian distribution, where the center pixel of the bounding box has the highest weight, and the importance of the pixel decreases from the center to the boundary. In this article, we follow the paradigm of taking the center point of the bounding box as the Gaussian distribution mean vector.

The horizontal bounding box is defined as R = ($bb\_cx$, $bb\_cy$, $bb\_w$, $bb\_h$), where ($bb\_cx$, $bb\_cy$), $bb\_w$ and $bb\_h$ denote the center coordinates, width and height, respectively. The inner ellipse of the horizontal rectangular box is shown in the Figure 2 distance evaluation module. The closer the inner ellipse is to the rectangular boundary, the higher the rank, so the equation of its inscribed ellipse can be represented as

$$\frac{{\left(x-bb\_cx\right)}^k}{{bb\_\sigma }_x^k}+\frac{{\left(y-bb\_cy\right)}^k}{{bb\_\sigma }_y^k}=1,s.t.,{\sigma }_x\le \frac{bb\_w}{2},{\sigma }_y\le \frac{bb\_h}{2}$$

(1)

As shown in Equation (1), which translates the samples from the original space to the high-dimensional space using a Gaussian distribution function, applying a Gaussian kernel function yields linearly differentiable samples in the high-dimensional space. Furthermore, the similarity between the bounding boxes A and B can be converted to the distribution distance between two Gaussian distributions.

$$k\left(x_n,x_m\right)=\left\{\begin{array}{cc}exp\left(-\frac{{∥x_n-x_m∥}^2}{2{\sigma }_x^2}\right)\hfill & {\sigma }_x⩾{\sigma }_y\hfill \\ exp\left(-\frac{{∥x_n-x_m∥}^2}{2{\sigma }_y^2}\right)\hfill & {\sigma }_x<{\sigma }_y\hfill \end{array}\right.$$

(2)

$$k\left(y_n,y_m\right)=\left\{\begin{array}{cc}exp\left(-\frac{{∥y_n-y_m∥}^2}{2{\sigma }_x^2}\right)\hfill & {\sigma }_x⩾{\sigma }_y\hfill \\ exp\left(-\frac{{∥y_n-y_m∥}^2}{2{\sigma }_y^2}\right)\hfill & {\sigma }_x<{\sigma }_y\hfill \end{array}\right.$$

(3)

where ${\sigma }_x$, ${\sigma }_y$ are the lengths of the semi-axes along the x- and y-axes. The largest of ${\sigma }_x$ and ${\sigma }_y$ are chosen from Equations (2) and (3) as the bandwidth of the Gaussian kernel. Multiple sample points within the rectangular box distribution function can be obtained using Equation (1) to generate the two bounding box sample space of Equations (4) and (5), and multiple rectangular boxes are similarly processed.

$${\mathit{BB}}_{\mathbf{1}}=\left\{{\mathit{N}}_{\mathbf{1}},{\mathit{N}}_{\mathbf{2}},{\mathit{N}}_{\mathbf{3}},\cdots ,{\mathit{N}}_{\mathit{n}}\right\}$$

(4)

$${\mathit{BB}}_{\mathbf{2}}=\left\{{\mathit{M}}_{\mathbf{1}},{\mathit{M}}_{\mathbf{2}},{\mathit{M}}_{\mathbf{3}},\cdots ,{\mathit{M}}_{\mathit{m}}\right\}$$

(5)

The moments of a random variable can be used to characterize high-dimensional random events but do not have direct distribution variables. Because the meanness and variance are not always perfectly reflective of a distribution, higher-order moments are required to be characterized. When the two distributions are not identical, the moment with the greatest difference between them should be utilized as the measure of the two distributions. MMD [29] is a typical loss function used in migration learning and is frequently used to estimate the distance between two distributions, which can be simplified as Equation (6):

$$\begin{array}{cc}\hfill MMD[\mathcal{F},B{B}_1,B{B}_2]& =\underset{{\parallel f\parallel }_{\mathcal{H}}\le 1}{sup}{\mathbf{E}}_{B{B}_1}\left[f\left(N\right)\right]-{\mathbf{E}}_{B{B}_2}\left[f\left(M\right)\right]\hfill \\ \hfill & =\underset{{\parallel f\parallel }_{\mathcal{H}}\le 1}{sup}{\mathbf{E}}_{B{B}_1}\left[{\langle \varphi \left(N\right),f\rangle }_{\mathcal{H}}\right]-{\mathbf{E}}_{B{B}_2}\left[{\langle \varphi \left(M\right),f\rangle }_{\mathcal{H}}\right]\hfill \\ \hfill & =\underset{{\parallel f\parallel }_{\mathcal{H}}\le 1}{sup}{〈{\mu }_{B{B}_1}-{\mu }_{B{B}_2},f〉}_{\mathcal{H}}={∥{\mu }_{B{B}_1}-{\mu }_{B{B}_2}∥}_{\mathcal{H}}\hfill \end{array},$$

(6)

where $B{B}_1$ and $B{B}_2$ are two bounding boxes of the sample space, $f\left(N\right)$ and $f\left(M\right)$ are probability density functions of $B{B}_1$ and $B{B}_2$, and $\varphi \left(N\right)$ and $\varphi \left(M\right)$ denote distribution functions of $B{B}_1$ and $B{B}_2$. So, Equation () provides the biggest difference ($\mathcal{H}$) in the mean distances between two distributions ($\varphi \left(N\right)$ and $\varphi \left(M\right)$) in Hilbert space ($\mathcal{F}$).

$$\begin{array}{cc}\hfill MM{D}^2[F,B{B}_1,B{B}_2]& ={∥\frac{1}{n}\sum _{i=1}^{n}f\left(x_i\right)-\frac{1}{m}\sum _{j=1}^{m}f\left(x_j\right)∥}_{\mathcal{H}}^2\hfill \\ \hfill & =∥\frac{1}{n^2}\sum _{i=1}^n\sum _{i^{\prime }=1}^{n}k\left(x_i,x_i^{\prime }\right)-\frac{2}{nm}\sum _{i=1}^n\sum _{j=1}^{m}k\left(x_i,y_j\right)+\frac{1}{m^2}\sum _{j=1}^m\sum _{j^{\prime }=1}^{m}k\left(y_j,y_j^{\prime }\right)∥\hfill \\ \hfill & =tr\left(\mathbf{K}\mathbf{L}\right)\hfill \end{array}$$

(7)

where n samples are assumed in the source domain (${\mathit{BB}}_{\mathbf{1}}$) and m samples are assumed in the target domain (${\mathit{BB}}_{\mathbf{2}}$). Until now, the key to MMD has been to select an appropriate $\varphi \left(x\right)$ as the mapping function. The Gaussian kernel method is useful since it does not require explicit representation of the mapping function to obtain the inner product of two vectors. As shown in Equation (7), the MMD is squared, simplified to obtain the inner product, and written down as a kernel function.

$$K=\left[\begin{array}{cc}{K}_{n,n}\hfill & K_{n,m}\hfill \\ K_{m,n}\hfill & K_{m,m}\hfill \end{array}\right]$$

(8)

$$L=\left\{\begin{array}{c}\frac{1}{n^2},x_i\in S\\ \frac{1}{m^2},y_j\in T\\ -\frac{2}{mn},\mathrm{otherwise}\end{array}\right.$$

(9)

where the inner product of $x_i$, $y_j$ in the feature space equals the result of their calculation by the kernel function k in the original sample space. It is frequently simplified to a matrix form, i.e., equation, to aid calculation of Equations (8) and (9), where K is the kernel matrix and L is the MMD matrix. The K matrix can be fed into the Gaussian kernel function to calculate the distance between two bounding boxes, and so on. After calculating the distance between multiple bounding boxes, the least in order of distance is chosen as the positive sample matching result, while the others are considered negative samples.

As shown in Figure 2, The UAV-recorded person samples are used to train the detection model. The model learns the new features of the dataset and performs detection using the testing dataset. The additional trained improved layer is interfaced with the previously trained model with transfer learning. The results of the trained and pretrained models are assessed and processed for SaR purposes.

2.3. Synthetic Data Generation by Object Implantation

Samples from SaR are typically associated with non-urban and hidden terrains, and the available persons are inevitably reduced. The OIM mainly generates a sufficient number of pseudo-labels in unlabeled images, while the ISCP mechanism of the OIM module expands numerous object instances, which will not affect the accuracy metrics of the detectors during the training. As shown in Figure 3, this incorporates the three steps listed

• The detector infers unlabeled images using the pretrained model and computes IoU matching between the GT and P-BBs to obtain undetected object instances.
• The generator obtains (as shown in Figure 3) masks of undetected object instances.
• Synthetic samples are created by randomly combining unreliable instances and backgrounds according to the objects’ mask library (OML, which comes from the results of instance segmentation).

To optimize the model parameters, the original samples are fed back into the trainer along with the pseudo-labels. However, because of their unreliability, the majority of the pixels may not be used. We believe that all the prediction probabilities of objects are treated in a unified loss function with different weights on both unlabeled and labeled data, using a dual input layer to optimize the prediction entropy of the loss function between the GT and unreliable labels.

The mask generator shown in Figure 4 is based on [30] with the added semantic segmentation head of [32], and creates a segmented dataset on the detected cropped maps. As shown in Figure 4, ARM and FFM modules are added to the neck of [30], which perform small-step spatial pathways that maintain spatial position data to build high-resolution feature maps, and design a semantic path with a fast down-sampling rate to obtain objective perceptual fields. The results are divided into two parts: the detection result of yolov5 with dimension 25,200 × 177, where the first 85 columns represent the result of each detection box and the last 32 columns represent the mask coefficients of each detection box, and the segmentation result of BiSeNet, which contains: a prototype mask with dimension 32 × 81 × 81, where post-processing of instance segmentation equals the weighted sum of the mask coefficients within the bounding box and the prototype mask to acquire the best performance of instance segmentation. It is worth noting that the other modules are the same as [30]. For additional details on the implementation of the object implantation with instance segmentation copy-paste mechanism, please refer to our Algorithm 1.

Algorithm 1: Object implantation with Instance Segmentation Copy-Paste (ISCP) based on the YOLOv5 detector

Input:  Prediction samples of the Heridal dataset for the current batch, as a group,     $P{S}_{bi}$; Ground truth of the Heridal dataset for the current batch, as a group,     $G{T}_{bi}$; Background samples of the Heridal dataset for the current batch, as a     group, $B{S}_{bi}$; Mask datasets of detectors on former batches, $M_{bi-1}$; Output:  Mask Datasets of detectors on the current batch, $M_{bi}$; 1: Extracting the set of reliable negative and/or positive samples $T{S}_{bi}$ from $P{S}_{bi}$ with help of $G{T}_{bi}$ by offline IoU-Match; 2: Training mask of numerous bounding boxes M on $T{S}_{bi}\cup G{T}_{bi}^{{}^{\prime }}$ (optimized $G{T}_{bi}$ from $G{T}_{bi}$), with help of data in former batches; 3: $M_{bi}=M_{bi-1}cupM$; 4: Generate samples $OM{L}_{bi}$ in $T{S}_{bi}-P{S}_{bi}$ by $M_{bi}$ to object mask library; 5: Add randomly $OM{L}_{bi}$ samples from object mask library to a background samples $B{S}_{b}i$ to expand $G{T}_{bi}^{{}^{\prime }}$ samples; 6: Deleting some weak detectors in $G{T}_{bi}^{{}^{\prime }}$ so as to keep the capacity of $G{T}_{bi}^{{}^{\prime }}$; 7: return $M_{bi}$, $G{T}_{bi}^{{}^{\prime }}$.

2.4. Pseudo-Label-Assisted Trainers with Semi-Supervised Learning

Typically, labeling takes more time and is much more valuable than data, which is usually fairly easy to obtain. Some parts of the data are labeled to create supervised data, and can then effectively use additional unlabeled data. Semi-supervised learning has the following advantages:

• It reduces the reliance of machine learning models on labeled data significantly, especially when the project is in its early stages.
• Even if the data is unlabeled, the distribution of the unlabeled data can provide a wealth of information to guide model iteration.
• In most cases, unmarked data is easily accessible, and the amount of data is large. Quantity is more important than quality. When used correctly, it can be extremely beneficial.

The most common and effective way to promote the performance of detection is self-training, which involves jointly training the model using a small amount of labeled data and a large amount of unlabeled data. First, a model is trained using labeled data with no constraints on the training method. The trained model is then used to predict the unlabeled data and obtain the label, which is referred to as a pseudo-label. Next, from the pseudo-label, some samples are chosen and placed in the labeled data. The selection method is also adaptable; for example, it can be used with greater confidence in labeled data. Finally, the model is retrained, and iterations resume. Labeling the synthetic samples mentioned in Figure 3 one-by-one would be a time-consuming and labor-intensive task. We present a simple and effective semi-supervised training method that uses a high confidence detection model to infer unlabeled images so that pseudo-labels are obtained, adding original training data to strengthen the trainer’s robustness. As shown in Figure 5, the model is trained with three datasets (original data, pseudo-labeled data, original and pseudo-labeled data) and the trainer outputs are fused at the decision level. Concretely, loss of the trainer is computed with labeled data ($Los{s}_{LabeledData}$), and also loss of the trainer is computed with unlabeled data ($Los{s}_{UnlabeledData}$), with soft weights of the total loss assigned between different datasets. Meanwhile, the detection results are optimized with ensemble learning. For additional detail on the implementation of expanding samples with semi-supervised learning and model ensemble learning, please refer to our Algorithm 2.

Algorithm 2: Training process of semi-supervised learning and model ensemble learning based on the YOLOv5 detector

Input:  The set of original labeled images for current batch, $L_{bi}$; The set of unreliable     labeled images for current batch, $U_{bi}$; samples ratio of labeled and unlabeled     datasets; $\zeta$: weight threshold; ${\lambda }_1$/${\lambda }_2$. Co-training ensemble of detectors on     former batches, $C{E}_{n-1}$; Output:  Co-training ensemble of detectors on the current batch, $C{E}_n$; 1: Extracting the set of reliable ground truth and/or pseudo-labels $P_{bi}$ from $U_{bi}$ with help of $L_{bi}$ and detectors; 2: Training ensemble of detectors $CE$ on $L_i\cup P_{bi}$, with help of data in former batches, where samples ratio is set to $\zeta$; 3: $C{E}_n=C{E}_{n-1}cupCE$; 4: Training ensemble of detectors with different weight threshold ${\lambda }_1$ or ${\lambda }_2$ with help of data $L_i\cup P_{bi}$; 5: $C{E}_n=C{E}_{n-1}cupCE$ / ${\lambda }_1$ or ${\lambda }_2$; 6: Detecting samples in $U_{bi}-P_{bi}$ by $C{E}_n$; 7: Deleting some weak detecting in $C{E}_n$ so as to keep the capacity of $C{E}_n$; 8: return $C{E}_n$;

3. Experimental Results and Analysis

This section focuses on benchmarking some representative object detectors and effectiveness verification of our proposed method. Firstly, the experimental settings, including the datasets, parameter settings and evaluation metrics, are presented. Then, a large-scale benchmark based on a comprehensive series of detectors is provided. Finally, the effectiveness of our proposed method is validated by extensive comparative experiments and ablation studies.

3.1. Experiment Setting

3.1.1. Datasets

Pixels smaller than 32 × 32 are generally viewed as tiny objects, which have been defined in the MS-COCO dataset. It has been found through research and experience that persons essentially meet this condition in the drone scenario. Descriptions of some typical publicly available datasets containing persons are as follows:

• VisDrone dataset [33], which contains details of urban areas and neighborhoods. It includes 288 video clips, 261,908 frames, and 10,209 still images, with labels covering three domains: object detection, object tracking, and congestion counting.
• TinyPerson dataset [16], which consists of 1610 labeled images with 72,651 person instances and 759 unlabeled images, referring to dense and complex environments at sea or the seaside in faraway and large-scale scenes.
• Heridal dataset [5] based on collection of images by unmanned helicopters, including 1650 high-resolution images (4000 × 3000) containing persons from non-urban areas, such as mountains, forests, oceans, and deserts.
• AFO dataset [4], which contains 3647 images with close to 40,000 labeled floating objects (human, wind/sup-board, boat, buoy, sailboat, and kayak).

In these datasets [4,5,16,33], we pay particular attention to samples of persons, removing the influence of other categories.

Table 1. Comparison of typical datasets and optimization labels of persons in drone-based scenarios.

Dataset	Description	Categories	Published_Year	Src_Size	Number of Samples
					Train_Set	Val_Set	Test_Set	Total
VisDrone2019	UAVs collected samples from 14 different cities in China, including rectangular labels for 10 common objects.	[pedestrian, person, car, van, bus, bus, truck, motor, bicycle, awning tricycle, tricycle, ignore]	ICCV_2019	1920 × 1080, 1360 × 765, 960 × 540, etc.	6471	548	1580	8599
Heridal	Found lost persons in non-urban terrain: mountains, forests, deserts, etc.	[person]	IJCV_2019	4000 × 3000	1548	-	102	1650
TinyPerson	The first long-distance person detection benchmark dataset.	[sea person, earth person, ignore]	WACV_2020	1920 × 1080, 1280 × 720, 1024 × 724, etc.	794	-	816	1610
AFO	Marine search and rescue operations with 40,000 hand- annotated persons and objects floating in the water.	[human, board, boat, buoy, sailboat, kayak]	ICAE_2021	3840 × 2160	2458	492	697	3647
Optimized Dataset	Description	Categories	Published_Year	Src_Size	Number of Subset
					Train_Set	Val_Set	Test_Set	Total
VisDrone_CityPerson	Merge two classes [pedestrian, person] into single class [person].	person	-	1536 × 1536	5684	531	1267	7482
Heridal_ForestPerson	Instances add to the background images for synthetic samples.	person	-	1536 × 1536	878	100	101	1079
Tiny_SeasidePerson	Merge two classes [sea person, earth person] into single class [person].	person	-	1536 × 1536	1017	100	381	1498
AFO_SeaPerson	Pick out labels and samples that contain person.	person	-	1536 × 1536	1696	211	200	2107
VHTA_Person	Create a multi-scene, full-time, high-view, and small person search and rescue dataset by UAVs.	person	-	1536 × 1536	9275	942	1949	12166

presents a comparison of the original and optimized datasets. The resolution of all samples in the optimized dataset is 1536 × 1536. Figure 6a–d refer to samples, rectangular labels, center points, and the aspect ratio for persons for different datasets, respectively. These datasets have smaller label sizes than the MS-COCO dataset, but the person instance in the Heridal dataset has the smallest label size. When the aspect ratio and centroid of the labels in those datasets are recorded, the K-means cluster first calculates the best preset size of anchors in the different datasets. Samples from the four datasets are combined [4,5,16,33] to create a new dataset (VHTA), with the goal of validating our proposed methods in rich scenarios with numerous viewpoints on SaR sceneries, and establishing a theoretical foundation to prepare for acquisition of our own dataset in the future. There is no validation set for the Heridal and TinyPerson datasets, which is critical for the training of machine learning models, so, samples are re-parted on the optimized dataset.

3.1.2. Parameter Settings

The experiments were carried out on a Red Hat 4.8.5-44 operating system, an Intel(R) Xeon(R) Gold 6134 CPU @ 3.20 GHz, with an NVIDIA GeForce Tesla V100 × 2 GPU (16 GB of each memory on a single card), CUDA and cuDNN versions v10.2 and v8.0.1, Pytorch version 1.8.0, JetBrains PyCharm Community Edition 2021.3.2 × 64, and Python 3.8. The ImageNet pretrained ResNet-101 was used for the backbone. All models were trained using the stochastic gradient descent (SGD) optimizer for 300 epochs with 0.9 momenta and 0.0001 weight decay. The initial learning rate was set to 0.01 with decay at epoch 10. The input resolution of images was [1536, 1536], but multiscale training was not used. Scratch-low values were used in the nano and small models, while scratch-high values were used for the rest. mAP@val was used for single-model and single-scale on these datasets. Test time augmentation (TTA) included reflection and scale augmentation. In the inference stage, a preset score of 0.25 to remove background bounding boxes and NMS were used with an IoU threshold of 0.45 to obtain the top 3000 confident bounding boxes. The above training and inference parameters were used in all experiments unless specified otherwise.

3.1.3. Evaluation Metrics

Recently, the evaluation metrics for object detection have generally consisted of two categories: the prediction metrics (IoU) and the classification metrics with precision, recall, etc., where precision and recall merely show the proportion of accurate and inaccurate instance predictions to all cases. Current main object detectors generally set the default IoU to 0.45 in the training stage. The mAP (mean average precision), including [email protected], which refers to the mean AP with an IoU threshold higher than 0.5, and [email protected]:0.95, which refers to the mean AP above the IoU threshold (from 0.5 to 0.95 with a step size of 0.05), is used to evaluate the detection performance of our proposed method. The models are also tested with the COCO evaluation parameters. Specifically, $A{P}_{0.5}$ means the IoU threshold defining true positive (TP) is 0.5, $A{P}_{0.75}$ means the IoU threshold defining TP is 0.75, and $A{P}_{0.5:0.95}$ means the average value from $A{P}_{0.5}$ to $A{P}_{0.95}$, with an IoU interval of 0.05. Note that $A{P}_{0.5}$, $A{P}_{0.75}$ and $A{P}_{0.5:0.95}$ take objects of all scales into consideration. Furthermore, in the Heridal dataset, $A{P}_l$, $A{P}_m$, and $A{P}_s$ are for large-, medium-, and small-scale evaluations, respectively. Average recall with a maximum detection number of 1, 10, and 100 is denoted by $A{R}_1$, $A{R}_{10}$, and $A{R}_{100}$, respectively.

3.2. Experiments on Optimized Heridal Dataset

The optimized Heridal_ForestPerson dataset was used in the experiments, representing the first captured real and high-resolution images for the purpose of person detection from UAVs. We demonstrate how our proposed approach can greatly improve the performance of object detectors by removing their sensitivity limitations when dealing with small objects. Four groups of experiments are considered, including experimental results for the MMD evaluator, analysis results with OIM and SSTM, and the ablation study, with discussion provided of these.

3.2.1. Experimental Results of MMD Evaluator

The CIoU loss was modified by our distance evaluation method based on the YOLOv5 framework and was tested under different depth models to validate the effectiveness of the MMD evaluator. The training curves are presented in Figure 7. As shown, our proposed method outperformed CIoU at $A{P}_{0.5}$ and $A{P}_{0.5:0.95}$, with the magnitude of the improvement varying with the depth of model. As illustrated in

Table 2. Comparison of MMD and CIoU training metrics in various depth and width models with Heridal_ForestPerson dataset.

Method	No.	Pretrained Model	Batch_Size	Precision	Recall	${\mathit{AP}}_{0.5}^{\mathit{val}}$	${\mathit{AP}}_{0.5}^{\mathit{test}}$	${\mathit{AP}}_{0.5:0.95}^{\mathit{val}}$	${\mathit{AP}}_{0.5:0.95}^{\mathit{test}}$	Params /M	GFLOPs /M	Training Time /h_m_s
Ours (MMD)	1	x	4	0.8706	0.7389	0.8115	0.8106	0.5463	0.5412	85.4	204.9	19h_22m_55s
				−3.43%↓	+3.27% ↑	+3.00%↑	+3.77%↑	+1.50% ↑	+1.51% ↑
	2	l	8	0.9152	0.7062	0.7998	0.7914	0.5273	0.5156	44.9	108.6	9h_22m_33s
				+4.39%↑	−1.78%↓	+1.88%↑	+1.60% ↑	−0.69% ↓	−0.57% ↓
	3	m	16	0.8914	0.7329	0.8079	0.8002	0.5405	0.5327	19.8	47.4	9h_34m_49s
				+1.73%↑	+3.27% ↑	+2.84%↑	+2.70%↑	+2.23% ↑	+2.78% ↑
	4	s	32	0.8676	0.7003	0.7841	0.7795	0.5115	0.5023	6.7	15.2	9h_43m_37s
				−0.17%↓	+0.89% ↑	+4.98%↑	+5.27%↑	+4.02% ↑	+3.71%↑
	5	n	64	0.8504	0.6913	0.7455	0.7369	0.4566	0.4483	1.6	3.9	9h_35m_44s
				+1.18%↑	+1.18% ↑	+2.79%↑	+2.75%↑	+1.47% ↑	+0.98%↑
YOLOv5 (CIoU)	6	x	4	0.9049	0.7062	0.7815	0.7729	0.5313	0.5261	85.4	204.9	19h_8m_27s
	7	l	8	0.8713	0.724	0.781	0.7754	0.5342	0.5213	44.9	108.6	9h_46m_46s
	8	m	16	0.8741	0.7002	0.7795	0.7725	0.5182	0.5049	19.8	47.4	9h_26m_3s
	9	s	32	0.8693	0.6914	0.7343	0.7268	0.4713	0.4652	6.7	15.2	9h_33m_5s
	10	n	64	0.8386	0.6795	0.7176	0.7094	0.4419	0.4385	1.6	3.9	9h_34m_41s

The blue markers are the maximum percentage of growth, and the bold fonts are the optimal value of the metrics.

, pretrained model ‘x’ achieved better results in the MMD evaluation experiment, with the training evaluation metrics (recall, $A{P}_{0.5}^{val}$, $A{P}_{0.5}^{test}$, $A{P}_{0.5:0.95}^{val}$, $A{P}_{0.5:0.95}^{test}$) improving compared to YOLOv5 by 3.27%, 3.0%, 3.77%, 1.5%, and 1.51%, respectively. However, the precision decreased by 3.43%. The pretrained model ‘s’ achieved better detection performance, with only 6.7M parameters and 15.2M GFLOPs. Detection accuracy was acceptable to some extent. Table 2 also reveals that MMD performed better on the ‘s’ model; hence, the primary pretrained model (‘s’) was utilized in the following tests. It should be noted that, based on training experience, batch size has little or no effect on detection performance, so the varied batch sizes were simply used to increase training efficiency and were not compared under the same batch size.

3.2.2. Analysis Results with OIM and SSTM

Since there are not enough person examples in the Heridal_ForestPerson dataset, a copy-paste mechanism to insert instances into the original images was used and then semi-supervised learning was employed to fine-tune the training model. Specifically, positive and negative examples from the Heridal Patch library (the Heridal Patch library refers to saving of crops that groundtruth objects from all samples of Heridal datasets with unified instance size of 81 × 81) were copied onto the samples in a specified proportion, with the repeat option to increase samples. Then, 1000+ segmented samples on the Patch library were manually labeled as the training set for instance segmentation, segmenting of all instances in the Patch library was finished with the help of YOLOv5 and BiSeNet to obtain clean masks without redundant backgrounds, and then these were pasted into the original samples. As shown in

Table 3. Number of implanted instances with two methods on the Heridal_ForestPerson dataset.

Method	No.	Block_Size	Num_Pos	Num_Neg	Repeat	Number of Instance
						Train_Set	Val_Set	Test_Set	Total
Copy-Paste	1	32 × 32	3	0		77,055	5019	1692	83,766
	2	32 × 32	3	0	✓	154,110	10,038	1692	165,840
	3	32 × 32	3	1	✓	154,110	10,038	1692	165,840
	4	32 × 32	3	2	✓	154,110	10,038	1692	165,840
	5	32 × 32	5	0		128,425	8365	1692	138,482
	6	32 × 32	7	0		179,795	11,711	1692	193,198
	7	32 × 32	9	0		231,165	15,057	1692	247,914
Instance Segmentation + Copy-Paste(Ours)	8	32 × 32	3	0		77,055	5019	1692	83,766
	9	32 × 32	3	0	✓	154,110	10,038	1692	165,840
	10	32 × 32	3	1	✓	154,110	10,038	1692	165,840
	11	32 × 32	3	2	✓	154,110	10,038	1692	165,840
	12	32 × 32	5	0		128,425	8365	1692	138,482
	13	32 × 32	7	0		179,795	11,711	1692	193,198
	14	32 × 32	9	0		231,165	15,057	1692	247,914

, the sample size for copy-paste with instance segmentation was used as for the simple copy-paste. The original instance size in the Patch library was 81 × 81, but all instances were resized to 32 × 32 to confirm that they belonged to small objects. It is worth noting that the samples were not raised in the test subset, but instead the same sample as Heridal_ForestPerson’s test subset was maintained.

Objects implanted by copy-paste with instance segmentation in Table 3 lack label information, so that re-inference of all newly generated samples is once more required on the pretrained model, achieving higher confidence labels as pseudo-labels. As a result, pseudo-labels and real labels are added to the trainer in a certain proportion. The trainer’s loss function is divided into two parts, the loss of real labels and the loss of pseudo-labels, and the complete loss should be the weighted sum of the two. It should be noted that the CIoU loss is based on the YOLOv5 framework, rather than our proposed MMD-based loss in this subsection. As shown in Figure 8, object implantation with instance segmentation and semi-supervised learning with pseudo-labels can effectively improve the training metrics (recall, $A{P}_{0.5}$, $A{P}_{0.5:0.95}$), but improvement in precision is not obvious. The likely explanation is that increasing the number of instances exponentially raises the leakage rate but has less influence on the detection accuracy.

Table 4. Training metrics on the Heridal_ForestPerson dataset with object implantation and semi-supervised learning.

Method	No.	Model	Params				Precision	Recall	${\mathit{AP}}_{0.5}^{\mathit{test}}$	${\mathit{AP}}_{0.5:0.95}^{\mathit{test}}$
			Copy-Paste	Scale	Loss_Weights	Repeat
Baseline	1	YOLOv5s	1	0.1	1	×	0.8679	0.6439	0.752	0.493
	2		3	0.5	1	×	0.8693	0.6914	0.7343	0.4713
	3		5	0.7	1	×	0.8721	0.6884	0.7729	0.5034
	4		3	0.5	1	×	0.8926	0.6914	0.7962	0.5311
OIM	5		1	0.1	0.1	✓	0.8872	0.7003	0.7619	0.503
	6		3	0.7	0.5	✓	0.8842	0.7033	0.7875	0.526
	7		5	0.5	0.5	✓	0.8876	0.7032	0.7884	0.5205
	8		3	0.9	0.5	✓	0.8525	0.7033	0.8037	0.5287
OIM+SSTM	9		1	0.1	0.1	✓	0.8676	0.7003	0.7841	0.5115
	10		3	0.7	0.5	✓	0.8188	0.724	0.7837	0.5161
	11		5	0.5	0.5	✓	0.87	0.7151	0.7712	0.5033
	12		3	0.9	0.5	✓	0.8914	0.7162	0.8117	0.5436

The bold fonts are the optimal value of the metrics.

defines four critical fine-tuning parameters: copy-paste refers to the number of object implantations, Scale means instances scaling to samples, Loss_Weights refers to the percentage of loss between the real and pseudo-labels. Repeat refers to adjusting different parameters to obtain better detection performance. It was observed that when the parameters [copy-paste, Scale, Loss_Weights, Repeat] = [3, 0.5, 1, No], the Baseline method achieved the best results. When the parameters [copy-paste, Scale, Loss_Weights, Repeat] = [3, 0.9, 0.5, Yes], the OIM method achieved the best results. When the parameters [copy-paste, Scale, Loss_Weights, Repeat] = [3, 0.9, 1, Yes], the OIM + SSTM method achieved the best results. As a result, we believe that more implantation of objects is not better, but too many cases may lead to model overfitting. Second, the scaling of instances was kept as close to the native instance size as possible, and the implanted instances were either too large or too tiny to deteriorate the model’s performance. Due to the issue of training time, the trainer had as many real labels as pseudo-labels, no more ablation experiments were performed, and there was still space for improvement afterwards. The parameter of repeated samples was used in all of our approaches to improve the model’s robustness. By the above method, the best performance metrics [precision, recall, $A{P}_{0.5}^{test}$, $A{P}_{0.5:0.95}^{test}$] were [0.8914, 0.7162, 0.8117, 0.5436].

3.2.3. Error Analysis

In order to evaluate causes of the decline in mAP, numerous mistake categories are designed, which can be useful for analyzing the model’s strengths and weaknesses; they can also assist in determining which flaws a trick corrects, hence improving the mAP metrics [34]. As shown in Figure 9, the IoU thresholds $t_f$ and $t_b$ were set to 0.5 and 0.1, respectively. The definitions of the six mistake categories are:

• Classification error (Cls), $Io{U}_{max}$≥$t_f$, which means localized correctly but classified incorrectly.
• Localization error (Loc), $t_b$≤$Io{U}_{max}$≤$t_f$, which means classified correctly but localized incorrectly.
• Classification and localization errors (Both), $t_b$≤$Io{U}_{max}$≤$t_f$, which means classified incorrectly and also localized incorrectly.
• Duplicate detection error (Dupe), $Io{U}_{max}$≥$t_f$, which means multiple detection boxes with various confidence levels.
• Background error (Bkg), $Io{U}_{max}$≤$t_b$, which means background detection boxes, but no instance.
• Missed GT error (Miss), which means all undetected ground truths, other than Cls and Loc errors.

Fixing an error can facilitate the mAP and evaluate the importance of the error category, by comparing the improvement of mAP to determine the importance of an error. Twelve strategies are analyzed in Table 4 by six error types mentioned in Figure 9. As shown in

Table 5. Statistics and analysis of multiple error types with various strategies mentioned in Table 4 on the Heridal_ForestPerson dataset.

Method	No.	Main Error						Special Error
		Cls	Loc	Both	Dupe	Bkg	Miss	FALSE_Pos	FALSE_Neg
Baseline	1	0	3.9	0	0.18	3.33	18.21	5.63	21.5
	2	0	2.23	0	0.2	5	16.83	7.21	19.54
	3	0	4.75	0	0.03	3	18.34	5.4	21.88
	4	0	3.11	0	0.08	2.73	19.53	3.54	22.35
OIM	5	0	2.86	0	0.08	3.08	18.98	4.59	22.25
	6	0	3.62	0	0.01	2.46	20.57	3.42	24.3
	7	0	3.87	0	0.01	2.18	17.89	3.81	21.57
	8	0	2.95	0	0.07	2.59	18.79	3.9	21.61
OIM+SSTM	9	0	2.7	0	0.16	2.45	19.72	3.92	22.26
	10	0	3.45	0	0	2.42	20.76	3.33	25.35
	11	0	2.33	0	0.08	3.39	20.43	4.25	22.91
	12	0	1.91	0	0.03	2.16	19.9	3.3	21.64

The bold fonts are the optimal value of the metrics.

, six main errors (Cls, Loc, Both, Dupe, Bkg, Miss) and two special errors (false positive detection (FP), false negative detection (FN)) are counted. Because the Heridal_ ForestPerson dataset contains only one class (person), Cls and Both errors are zero. Miss and FN have the highest errors, which are caused primarily by: (1) Detailed features of small persons practically vanishing after multi-layer convolution, causing a failed regression map to a person’s specific location in the original images; (2) When computed for loss by CIoU, minor position and posture deviation of persons is treated as a negative sample, lowering the detection performance. As shown in Figure 10, the percentage of Miss is more than 50% in all methods, and the Miss error becomes more apparent with the more objects that are implanted. However, the Bkg error achieves lower values to alleviate the imbalance of the positive and negative samples. In addition, object implantation combined with pseudo-label training can help to reduce Loc and Dupe errors. Therefore, under certain parameter settings, methods 5–12 (ours) achieve better detection performance.

3.2.4. Ablation Study

The effectiveness of our strategy was evaluated with the addition of various modules, including CP (copy-paste), OIM (object implantation module), SSTM (semi-supervised training module), CIoU and MMD (maximum mean discrepancy). As shown in

Table 6. Comparative studies of various module configurations under ‘s’ pretrained model on the Heridal_ForestPerson dataset.

Method	CP	OIM	SSTM	CIoU	MMD	Precision	Recall	${\mathit{AP}}_{0.5}^{\mathit{test}}$	${\mathit{AP}}_{0.5:0.95}^{\mathit{test}}$
Baseline				✓		0.8679	0.6439	0.752	0.493
	✓			✓		0.8698	0.6492	0.763	0.4922
Ours		✓		✓		0.8847	0.6729	0.7855	0.5023
		✓			✓	0.8957	0.7022	0.8012	0.5241
		✓	✓	✓		0.9019	0.7123	0.8073	0.5304
		✓	✓		✓	0.9049	0.724	0.8115	0.547
	✓	✓	✓		✓	0.9152 (+4.73%↑)	0.7389 (+9.5%↑)	0.8079 (+5.59%↑)	0.5436 (+5.02%↑)

The blue markers represent our proposed method’s percentage improvement over the Baseline.

, the detection performance for different combinations of OIM, SSTM, and MMD was compared, where CP and CIoU based on YOLOv5 was set to Baseline. It was observed that the $A{P}_{0.5}^{test}$ obtained with OIM+CIoU was 0.7855, a 3.35% improvement over Baseline with CIoU alone, and a 2.25% improvement over Baseline with CP+CIoU. The $A{P}_{0.5}^{test}$ of OIM+SSTM+CIoU achieved 0.8073, a 2.18% improvement over OIM+CIoU, which showed that semi-supervised learning strategies were effective. Following numerous ablation experiments, the optimal training parameter metrics [precision, recall, $A{P}_{0.5}^{test}$, $A{P}_{0.5:0.95}^{test}$] were [0.9152, 0.7389, 0.8079, 0.5436] with the combination of OIM+SSTM+MMD. Furthermore, we found that the reuse of CP and OIM did not always work well, and may have caused the $A{P}_{0.5}^{test}$ to drop (from 0.8115 to 0.8079, and decline by 0.36%).

3.2.5. Discussions

During the inference stage, a variety of practical tips were applied to improve the accuracy of the trained model, most notably including: test-time augmentation (TTA), which entails making multiple augmented copies of each image in the test subset, allowing the model to make predictions, and then returning the set of predictions in each image; model ensembling (ME), which fuses multiple trained models based on the voting method (this article’s method) to achieve better detection results for a fusion-based multimodel; weighted boxes fusion (WBF), which combines and sorts boxes by decreasing the order of the confidence scores; and low-precision parameter quantization (LPPQ) with batch inference (BI) to accelerate model inference. As shown in

Table 7. Comparison of inference performance with multiple augmentation methods on different devices.

Method	Model	Batch Size	Input Size	${\mathit{AP}}_{0.5}^{\mathit{test}}$	Params /M	GFLOPs /M	${\mathit{Speed}}^{\mathit{test}}$ (Tx2 b1/ms)	${\mathit{Speed}}^{\mathit{test}}$ (NX b1/ms)	${\mathit{Speed}}^{\mathit{test}}$ (V100 b1/ms)
									Prep	Infer	NMS	Total Time
Baseline	s	2	1536	0.788	6.7	15.8	283.4	75.4	0.7	7.9	1.5	10.1
Baseline + TTA	s	2	1600	0.753	6.7	15.8	596.5	148.6	0.6	21.9	1.2	23.7
	s	2	1920	0.791	6.7	15.8	612.3	173.2	0.9	25.7	1.2	27.8
	s	2	2400	0.798	6.7	15.8	814.9	246.5	2.7	33.4	1.1	37.2
	s	2	3200	0.79	6.7	15.8	1473.1	522	5.3	52.8	1	59.1
Baseline++TTA + ME	s+m	2	1536	0.796	19.9	47.9	588.7	139.5	0.9	19.7	1.1	21.7
	s+l	2	1536	0.795	44	107.6	606.5	166.9	0.9	26.8	1.1	28.8
	s+x	2	1536	0.798	82.2	203.8	923.8	304.7	0.6	42.8	1.1	44.5
	s+x	2	2400	0.803	82.2	203.8	5129.6	1508.9	2	202	0.9	204.9
	s+m+l	2	1536	0.793	44	107.6	867.4	272.9	0.6	39.5	1.1	41.2
	s+m+x	2	1536	0.795	82.2	203.8	1369.5	481.2	1.2	55.3	1.1	57.6
Baseline+TTA+ME+WBF	s+x	2	1536	0.806	82.2	203.8	1583.7	678.9	0.7	44.6	16.8	62.1
	s+x	2	2400	0.809	82.2	203.8	6492.3	2225.1	2.5	205.8	49.3	257.6
	s+m+x	2	1536	0.805	44	107.6	1979.5	611.2	1.2	55.3	27.2	83.7
	s+l+x	2	1536	0.802	82.2	203.8	2647	806.3	1.8	56.9	43.2	101.9
Baseline	s	2	1536	0.788	6.7	15.8	283.4	75.4	0.7	7.9	1.5	10.1
BI	s	4	1536	0.786	6.7	15.8	219.1	49.6	0.7	4.8	1.5	7
	s	8	1536	0.789	6.7	15.8	178.8	33.4	0.4	3.7	1.7	5.8
LPPQ (fp16)	s	4	1536	0.775	4.3	11.2	208.3	47.4	0.3	2.9	1.6	4.8
	s	8	1536	0.774	4.3	11.1	171.2	32	0.3	2.6	1.3	4.2
	s+x	8	2400	0.794	57.9	147.8	3842.5	1124.9	2.5	114.7	49.3	166.5

The bold fonts are the optimal value of the metrics.

, TTA with 2400 × 2400 of input size achieved better $A{P}_{0.5}^{test}$ than the Baseline (improved 1% or so). Compared to TTA, TTA+ME improved by 0.5%; TTA+ME+WBF also resulted in improvement by 1.1%. As a result, employing various augmentation methods during the inference process was able to improve the model’s detection performance by 2.1%. Then, BI and PQ methods were performed to speed up the inference process whereby many tips were stacked on top of each other.

3.2.6. Comparisons with the State-of-The-Art

Firstly, five current techniques were chosen to contrast with our proposed data augmentation, including: Copy-Paste [35], Simple Copy-Paste [36], Mixup [37], CutMix [38] and Mosaic [39]. All the experimental results are shown in

Table 8. Comparison of the training metrics between our proposed method and SOTA in the Heridal dataset.

Method	AP	AP	AP	AP	AP	AP	AR	AR	AR	AR	AR	AR
	IoU = 0.5:0.95	IoU = 0.5	IoU = 0.75	small	medium	large	max = 1	max = 10	max = 100	small	medium	large
Data Augmentation
Baseline	0.5303	0.7625	0.6469	0.458	0.7264	0.8434	0.3316	0.7297	0.7646	0.6342	0.7612	0.8604
Copy-Paste [35]	0.533	0.7539	0.6207	0.4566	0.7288	0.8206	0.3345	0.7269	0.7581	0.6344	0.7511	0.8655
Simple Copy-Paste [36]	0.5417	0.7714	0.6486	0.4629	0.7296	0.8185	0.3367	0.73	0.7569	0.6376	0.753	0.8516
Mixup [37]	0.5288	0.7658	0.6503	0.4476	0.7164	0.8469	0.3352	0.7168	0.7522	0.6408	0.7489	0.86
CutMix [38]	0.5347	0.7842	0.6552	0.4521	0.7153	0.8385	0.3398	0.7285	0.7469	0.6415	0.7435	0.8579
Mosaic [39]	0.5385	0.7824	0.6523	0.4638	0.7254	0.8316	0.3373	0.7261	0.7454	0.6398	0.7527	0.8667
CP + SSL (Ours)	0.5476	0.7884	0.6582	0.4725	0.7396	0.8467	0.3527	0.7314	0.7528	0.6511	0.7508	0.872
	(+1.73%)	(+2.59%)	(+1.13%)	(+1.45%)	(+1.32%)	(+0.33%)	(+2.11%)	(+0.17%)	(−1.18%)	(+1.69%)	(−1.04%)	(+1.16%)
Label Assignment + Data Augmentation
CIoU [25]	0.5476	0.7884	0.6582	0.4725	0.7396	0.8467	0.3527	0.7314	0.7528	0.6511	0.7508	0.872
DIoU [27]	0.5485	0.7743	0.6497	0.4618	0.7263	0.854	0.3461	0.7156	0.7422	0.6588	0.7369	0.86
GIoU [26]	0.5411	0.7659	0.632	0.4663	0.7285	0.8461	0.3414	0.7359	0.7396	0.6503	0.7386	0.8741
EIoU [28]	0.5359	0.7251	0.6378	0.4526	0.7148	0.8457	0.3369	0.7424	0.7457	0.6547	0.7454	0.8572
Alpha-IoU [40]	0.551	0.7752	0.6475	0.4588	0.7302	0.8489	0.3452	0.7366	0.7463	0.6419	0.7548	0.8601
SIoU [41]	0.5527	0.7639	0.6319	0.4627	0.7154	0.8432	0.3368	0.7364	0.7489	0.6437	0.7329	0.8547
DotD [42]	0.5426	0.7895	0.6456	0.469	0.7344	0.8475	0.3542	0.7115	0.7543	0.65	0.7246	0.8721
NWD [43]	0.5429	0.7963	0.6617	0.4733	0.7317	0.8526	0.3567	0.728	0.7499	0.6427	0.7363	0.8699
CP+SSL+MMD (Ours)	0.5436	0.8079	0.6698	0.4756	0.7386	0.8566	0.3524	0.7359	0.7637	0.6548	0.7511	0.8768
	(−0.4%)	(+1.95%)	(+1.16%)	(+0.31%)	(−0.1%)	(+0.99%)	(−0.3%)	(+0.45%)	(+1.09%)	(+0.37%)	(+0.3%)	(+0.48%)
YOLO Series + Data Augmentation
YOLO v4 [39]	0.5368	0.7669	0.667	0.4814	0.7746	0.8306	0.3458	0.7455	0.7546	0.6608	0.7522	0.8692
YOLO v5 [30]	0.5476	0.7884	0.6582	0.4725	0.7396	0.8467	0.3527	0.7314	0.7528	0.6511	0.7508	0.872
YOLO v6 [44]	0.5445	0.7855	0.6716	0.4879	0.7452	0.8569	0.3429	0.7396	0.7549	0.6425	0.7513	0.8796
YOLO v7 [45]	0.5561	0.7954	0.6683	0.4962	0.7326	0.855	0.3414	0.7421	0.7607	0.636	0.7529	0.8807
Others + Data Augmentation
SSD [46]	0.3856	0.6829	0.5347	0.3624	0.5208	0.7124	0.2043	0.6207	0.5453	0.5029	0.5189	0.6479
Faster RCNN [48]	0.5593	0.8144	0.6789	0.5329	0.7522	0.8546	0.4156	0.7496	0.7632	0.657	0.7623	0.8854
Retinanet [47]	0.5327	0.7865	0.6628	0.4668	0.7341	0.8323	0.3617	0.7401	0.7621	0.6842	0.7498	0.8726
Ours
CP+SSL	0.5476	0.7884	0.6582	0.4725	0.7396	0.8467	0.3527	0.7314	0.7528	0.6511	0.7508	0.872
CP+SSL+MMD	0.5436	0.8079	0.6698	0.4756	0.7386	0.8566	0.3524	0.7359	0.7637	0.6548	0.7511	0.8768
CP + SSL + MMD + TTA	0.5507	0.8142	0.6751	0.4721	0.7407	0.8553	0.3585	0.7427	0.764	0.6574	0.7512	0.8845
CP + SSL + MMD + TTA + ME	0.5584	0.8216	0.6769	0.4756	0.7463	0.8571	0.3614	0.7468	0.7639	0.6629	0.7569	0.8896
CP + SSL + MMD + TTA + ME + WBF	0.5601	0.8287	0.6842	0.4887↓	0.7548	0.8629	0.3685	0.7529	0.7748	0.6675↓	0.7637	0.8945
	(+1.25%)	(+4.03%)	(+2.6%)	(+1.25%)	(+1.52%)	(+1.62%)	(+1.58%)	(+2.15%)	(+2.2%)	(+1.64%)	(+1.29%)	(+2.25%)

The bold fonts are the optimal value of the metrics. The blue markers represent the outcomes of various types of optimal methods when compared to our proposed method.

. It can be seen that the CP+SSL method improved the $A{P}_{IoU=50}$ metric of the above methods by 3.45, 1.7, 2.26, 0.42 and 0.6 AP points, respectively. Secondly, the detection performance in label alignment with IoU evaluation on the basis of data augmentation was investigated, including: CIoU [25], DIoU [27], GIoU [26], EIoU [28], Alpha-IoU [40], SIoU [41], and label alignment with distance evaluation, including, DotD [42] and NWD [43]. Distance evaluation yielded higher detector AP metrics than IoU evaluation, and the CP+SSL+MMD method outperformed the best distance evaluation method by 1.16%. Finally, multiple detection algorithms on the basis of data augmentation, including single-stage anchor-based detectors—YOLO series [30,39,44,45], SSD [46], RetinaNet [47]—and a two-stage anchor-based detector, Faster R-CNN [48], were compared to our proposed multi-strategy collaboration method. When compared to existing methods, our algorithm offered some advantages in both AP and AR. The performance improvements were encouraging and were even more obvious when the objects were extremely tiny.

3.3. Experiments on Other Datasets

To further demonstrate the effectiveness of our proposed method, we compared it to typical detection algorithms based on MMDetection (https://github.com/open-mmlab/mmdetection, accessed on 15 March 2023) and the YOLOAir (https://github.com/iscyy/yoloair, accessed on 15 March 2023) toolkit. The original and optimized datasets used in the trials can be found in Table 1.

3.3.1. Comparative Experiments on Optimized Datasets

To verify the resilience of our approach on diverse datasets, it was compared separately to the SOTA algorithms. The default public test results were performed on the original dataset, and the training metrics on the optimized dataset were performed with our method in this study. As shown in

Table 9. Comparison of the training metrics between our proposed method and SOTA algorithms across multiple datasets.

DataSet	Category	Method	InputSize	BackBone	PreTrainedModel	Precision/%	Recall/%	[email protected]/%
VisDrone2019 [33]	pedestrian	YOLOv4 [39]	608	DarkNet-53	yolov4-csp-x-swish	0.68066	0.47852	0.48004
		YOLOF [49]	608	R-50-C5	yolof_r50_c5_8x8_1x	0.68759	0.45276	0.48772
		YOLOv5 [30]	640	DarkNet-53 + Focus	yolov5x6	0.67369	0.47169	0.47202
		YOLOX [50]	640	Darknet53	yolox-x	0.67008	0.46893	0.47257
		DCLANet [51]	640	DarkNet-53 + Focus	yolov5x6	0.69827	0.46751	0.47782
VisDrone_CityPerson	person	Ours	640	DarkNet-53 + Focus	yolov5s	0.71829(+2.002%)	0.45636(−1.115%)	0.49061(+1.279%)
Heridal [5]	person	SSD [46]	1333 × 1000	VGG16	ssd512_coco	4.33	94.36	-
		Faster RCNN [48]	1333 × 1000	ResNet101 + FPN	faster_rcnn_r101_fpn_1x_coco	58.1	85	-
		[5]	1333 × 1000	RPM + SOD	faster_rcnn_r101_fpn_1x_coco	34.8	88.9	-
		RPN [7]	4000 × 3000	ResNet101+FPN	rpn_x101_32x4d_fpn_1x_coco	41.54	95.54	-
		RFCCD [8]	4000 × 3000	ResNet101+FPN	rpn_x101_32x4d_fpn_1x_coco	68.89	94.65	-
Heridal_ForestPerson	person	Ours	1536 × 1536	DarkNet-53 + Focus	yolov5s	91.52	73.89	80.79
					yolov5x6	94.78(+25.89%)	80.32(−14.33%)	85.68
TinyPerson [16]	person	RetinaNet [47]	640 × 512	ResNet50	retinanet_r50_fpn_1x_coco	-	-	48.26
		Faster RCNN [48]	640 × 512	ResNet50 + FPN	faster_rcnn_r101_fpn_1x_coco	-	-	63.18
		Faster RCNN [48]	640 × 512	ResNet50 + PANet + FPN	faster_rcnn_r101_panet_fpn_1x_coco	-	-	70.32
		FCOS [52]	640 × 512	ResNet50	fcos_r50_caffe_fpn_gn_head_1x_coco	-	-	40.54
		Swin-T [53]	640 × 512	ResNet50	retinanet_swin-t-p4-w7_fpn_1xcoco	-	-	52.53
Tiny_SeasidePerson	person	Ours	1536 × 1536	DarkNet-53+ Focus	yolov5s	78.5	56.1	67.48(+14.95%)
AFO [4]	human+buoy	YOLOv4 [39]	544 × 544	CSPDarknet53-PANet-SPP	yolov4-csp-panet-spp-x-swish	-	-	54.58
		SSD [46]	300 × 300	MobileNet v2	ssd300_mobilenetv2_600e_coco	-	-	24.34
		Faster RCNN [48]	1333 × 750	ResNet101 + FPN	faster_rcnn_r101_fpn_1x_coco	-	-	64.11
		RetinaNet [47]	1333 × 750	ResNet101 + FPN	retinanet_r101_fpn_1x_coco	-	-	65
		[4]	1333 × 750	ResNet101 + FPN	retinanet_r101_fpn_1x_coco	-	-	70.53
AFO_SeaPerson	person	Ours	1536 × 1536	DarkNet-53 + Focus	yolov5s	95.55	93.37	96.34(+25.81%)
VHTA_Person(Ours)	person	Ours	1536 × 1536	DarkNet-53 + Focus	yolov5s	74.39	52.16	63.28
			1536 × 1536	DarkNet-53 + Focus	yolov5m	77.56	54.17	65.89
			1536 × 1536	DarkNet-53 + Focus	yolov5l	75.35	56.29	64.8
			1536 × 1536	DarkNet-53 + Focus	yolov5x	75.92	55.86	65.4
			1536 × 1536	DarkNet-53 + Focus	yolov5x6	76.59	57.32	66.37

The blue markers are the optimal value of the metrics.

, our proposed approach significantly improved detection performance on the optimized dataset, paving the way for commercial applications of SaR tasks.

3.3.2. Visualization

Figure 11 depicts some visualization findings for baseline detectors and our proposed detectors in five scenarios, which are from our created VHTA dataset. The detection results show a significant improvement when compared to the baseline detectors. In particular, the following observations can be made: The most noticeable improvement was that our proposed method was able to significantly reduce FN. When detecting microscopic objects, FN is a common scenario with baseline detectors due to a lack of supervisory information. It was also shown that anchor-based detectors can learn enough supervision information from positive small samples when equipped with YOLO series. Furthermore, a considerable number of FPs may be detected in the SSD detection results, indicating that SSD fails to categorize correct predictions from numerous detection candidates. Surprisingly, our method can correctly handle FP detections, meaning that the assigned positive/negative samples are of higher quality.

4. Conclusions

In this article, a method for person detection in aerial images using multi-strategy collaboration is proposed, which aims to tackle the difficulty of small object detection and the problem of few samples in the SaR task. Practical, reliable and multi-scene SaR data are created to fusion person (also including pedestrians, people, and human beings) labels from publicly available datasets. In response to small and unbalanced samples, synthetic samples are generated with object implantation methods and virtual synthesis software; meanwhile, combined instance segmentation with semi-supervised learning achieves more unreliable pseudo-labels. To address the low tolerance of existing IoU evaluation methods for tiny objects, a better metric is designed based on the maximum mean discrepancy distance to measure the similarity of the bounding boxes. The experimental results obtained demonstrate that the proposed method is more accurate than the considered benchmark methods for person detection in SaR scenarios.