mlsanityData to 14 Oct 2026

Fractional Correspondence Framework in Detection Transformer

arXiv 2503.04107 ↗First posted 6 Mar 2025cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

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 +3.8% and +1.7%, respectively.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 33 of its 46 references that are in the map. First posted on arXiv 6 Mar 2025.

Builds on

33 of 46 references.

References · 33

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Microsoft COCO: Common Objects in Contextcited by 17,608
  3. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
  4. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
  5. 2020End-to-End Object Detection with Transformerscited by 7,414
  6. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,852
  7. 2020Deformable DETR: Deformable Transformers for End-to-End Object Detectioncited by 3,422
  8. 2015SSD: Single Shot MultiBox Detectorcited by 3,130
  9. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  10. 2022DINO: DETR with Improved DeNoising Anchor Boxes for End-to-End Object Detectioncited by 1,319
  11. 2018Computational Optimal Transportcited by 780
  12. 2018Object Detection with Deep Learning: A Reviewcited by 528
21 more
  1. 2022DN-DETR: Accelerate DETR Training by Introducing Query DeNoisingcited by 488
  2. 2022Unified Scaling Laws for Routed Language Modelscited by 253
  3. 2021OTA: Optimal Transport Assignment for Object Detectioncited by 178
  4. 2020FCOS: A simple and strong anchor-free object detectorcited by 171
  5. 2021Rethinking Rotated Object Detection with Gaussian Wasserstein Distance Losscited by 156
  6. 2021Efficient DETR: Improving End-to-End Object Detector with Dense Priorcited by 128
  7. 2021Sparse DETR: Efficient End-to-End Object Detection with Learnable Sparsitycited by 98
  8. 2022Learning Object-Language Alignments for Open-Vocabulary Object Detectioncited by 96
  9. 2019Wasserstein Adversarial Examples via Projected Sinkhorn Iterationscited by 89
  10. 2022Accelerating DETR Convergence via Semantic-Aligned Matchingcited by 58
  11. 2022Unified Optimal Transport Framework for Universal Domain Adaptationcited by 57
  12. 2023Rank-DETR for High Quality Object Detectioncited by 50
  13. 2024MS-DETR: Efficient DETR Training with Mixed Supervisioncited by 35
  14. 2024Salience DETR: Enhancing Detection Transformer with Hierarchical Salience Filtering Refinementcited by 31
  15. 2020Regularized Optimal Transport is Ground Cost Adversarialcited by 17
  16. 2022Optimal Correction Cost for Object Detection Evaluationcited by 11
  17. 2023Structured Transforms Across Spaces with Cost-Regularized Optimal Transportcited by 8
  18. 2022Robust Multi-Object Tracking by Marginal Inferencecited by 7
  19. 2022Solving a Special Type of Optimal Transport Problem by a Modified Hungarian Algorithmcited by 3
  20. 2024SeTformer is What You Need for Vision and Languagecited by 3
  21. 2022Hybrid Gromov-Wasserstein Embedding for Capsule Learningcited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.