融合拓扑感知的无人机集群双重关联多目标跟踪方法

Topology-aware dual-association multi-object tracking for UAV swarms

  • 摘要: 针对复杂环境下无人机集群多目标跟踪中,由外观相似度高、空间分布密集、相互遮挡频繁以及弱小目标检测不稳定等因素导致的数据关联模糊、身份切换和轨迹断裂问题,本文提出一种融合几何约束与局部拓扑约束的双重关联跟踪方法. 该方法基于两阶段检测关联框架,在高置信度检测关联阶段引入同时考虑边界框重叠程度与中心点距离的几何相似度,增强轨迹预测框与检测框之间的空间一致性;在低置信度检测补充关联阶段引入局部邻域拓扑相似度,通过目标间相对距离和方向关系刻画无人机集群局部结构的一致性,从而缓解外观相似、密集排列和弱检测条件下的关联模糊问题. 为验证方法有效性,本文在原UAVSwarm数据集基础上构建了增强版UAVSwarmV2,扩充了数据规模,提升了图像分辨率、序列长度和场景多样性,并提供面向检测与跟踪任务的统一标注和数据划分. 实验结果表明,相比基线方法,本文方法在HOTA、AssA和IDF1上分别提升8.14%、12.98%和10.93%,IDSW由230次降低至38次,表明该方法能够有效增强无人机集群场景下的身份保持能力和轨迹连续性.

     

    Abstract: Multi-object tracking of unmanned aerial vehicle (UAV) swarms remains a challenge because UAV targets often have small scales, highly similar appearances, dense spatial distributions, frequent mutual occlusions, and complex relative motions. In these scenarios, detection boxes are easily affected by scale variations, motion blur, and background interference, while confidence scores may fluctuate across frames. As a result, conventional association strategies that rely primarily on bounding-box overlap, motion prediction, or appearance cues may suffer from identity switches and trajectory fragmentation. To address these problems, this paper proposes a topology-aware dual-association multi-object tracking method that integrates geometric and local topology constraints into a two-stage tracking-by-detection framework. In the first stage, high-confidence detections are matched with predicted trajectories. Instead of using only the intersection-over-union (IoU) metric, the proposed method adopts Distance-IoU (DIoU) as the geometric similarity measure. DIoU jointly considers the overlap between bounding boxes and the distance between their center points, which provides stronger spatial discrimination when adjacent UAV targets have similar overlap ratios or when detection boxes fluctuate slightly. This design enhances the spatial consistency between the predicted trajectory and detection boxes while preserving the efficiency of online tracking. In the second stage, unmatched trajectories were associated with low-confidence detections for target recovery. To reduce the association ambiguity under weak detection, dense distribution, and short-term occlusion, a local neighborhood topology constraint is introduced. For each detection target, the local topology is constructed from its nearest neighboring targets and represented by normalized relative distances and directional relationships. For existing trajectories, the topology information is inherited from the most recent reliable matched detection and updated after each successful association. The topology correspondence between a trajectory and candidate detection is formulated as a bipartite matching problem. The Hungarian algorithm is used to obtain the minimum-cost correspondence between two local neighborhoods. The topology cost is then combined with the IoU cost in the low-confidence recovery stage. When valid neighbors are insufficient, the method automatically returns to a pure IoU association to avoid unreliable topology constraints in sparse scenes. To evaluate the proposed method, an enhanced UAV swarm dataset called UAVSwarmV2, was constructed based on the original UAVSwarm dataset. UAVSwarmV2 contains 96 sequences and 21,439 frames, with an expanded data scale, higher image resolution, longer sequences, and more diverse swarm motion patterns. It also provides unified annotations and data splits for both detection and multi-object tracking tasks to make it suitable for evaluating the association robustness and identity preservation in real visible-light UAV swarm scenarios. Experiments were conducted using YOLOv8-n as the detector under the same detection results and evaluation protocol. The proposed method was compared with representative multi-object tracking methods, including ByteTrack, BoT–SORT, OC–SORT, and Deep OC–SORT. Experimental results on the UAVSwarmV2 test set show that the proposed method achieves better overall tracking performance and stronger identity preservation. Compared with the ByteTrack baseline, the proposed method improved the higher-order tracking accuracy from 53.741% to 58.113%, association accuracy from 58.964% to 66.620%, and identification F1 score from 71.356% to 79.157%. The number of identity switches was reduced from 230 to 38, indicating a significant improvement in identity consistency. The proposed method maintains a processing speed close to that of the baseline tracker, indicating that it improves the association robustness while preserving practical tracking efficiency.

     

/

返回文章
返回