OTA: Optimal Transport Assignment for Object Detection

By Zheng Ge, Songtao Liu, Zeming Li, Osamu Yoshie, Jian‐Yuan Sun. 2021

529 citations recorded by the source corpus.

Recent advances in label assignment in object detection mainly seek to independently define positive/negative training samples for each ground-truth (gt) object. In this paper, we innovatively revisit the label assignment from a global perspective and propose to formulate the assigning procedure as an Optimal Transport (OT) problem – a well-studied topic in Optimization Theory. Concretely, we define the unit transportation cost between each demander (anchor) and supplier (gt) pair as the weighted summation of their classification and regression losses. After formulation, finding the best assignment solution is converted to solve the optimal transport plan at minimal transportation costs, which can be solved via Sinkhorn-Knopp Iteration. On COCO, a single FCOS-ResNet-50 detector equipped with Optimal Transport Assignment (OTA) can reach 40.7% mAP under 1× scheduler, outperforming all other existing assigning methods. Extensive experiments conducted on COCO and CrowdHuman further validate the effectiveness of our proposed OTA, especially its superiority in crowd scenarios. The code is available at https://github.com/Megvii-BaseDetection/OTA.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Diana-Margarita Córdova-Esparza
  2. Juan R. Terven
  3. Hongpeng Liao
  4. Chien-Yao Wang
  5. Alexey Bochkovskiy
  6. I-Hau Yeh
  7. Pei Sun
  8. Ping Luo

In Computer Vision and Pattern Recognition

  1. Diana-Margarita Córdova-Esparza
  2. Juan R. Terven
  3. Hongpeng Liao
  4. Chien-Yao Wang
  5. Ping Luo
  6. Alexey Bochkovskiy
  7. I-Hau Yeh
  8. Luc Van Gool

Citations in the corpus