File(s) under embargo
1
month(s)18
day(s)until file(s) become available
Fractional Correspondence Framework in Detection Transformer
The Detection Transformer (DETR), by incorporating the Hungarian algorithm, has significantly simplified the matching process in object detection tasks. This algorithm facilitates optimal one-to-one matching of predicted bounding boxes to ground-truth annotations during training. While effective, this strict matching process does not inherently account for the varying densities and distributions of objects, leading to suboptimal correspondences such as failing to handle multiple detections of the same object or missing small objects. To address this, we propose the Regularized Transport Plan (RTP). RTP introduces a flexible matching strategy that captures the cost of aligning predictions with ground truths to find the most accurate correspondences between these sets. By utilizing the differentiable Sinkhorn algorithm, RTP allows for soft, fractional matching rather than strict one-to-one assignments. This approach enhances the model's capability to manage varying object densities and distributions effectively. Our extensive evaluations on the MS-COCO and VOC benchmarks demonstrate the effectiveness of our approach. RTP-DETR, surpassing the performance of the Deform-DETR and the recently introduced DINO-DETR, achieving absolute gains in mAP of {\bf{+3.8%}} and {\bf{+1.7%}}, respectively.
History
Author affiliation
College of Science & Engineering Comp' & Math' SciencesSource
32nd ACM Multimedia Conference, 28 October - 1 November 2024, Melbourne, AustraliaVersion
- AM (Accepted Manuscript)