TL;DR
This paper introduces a probabilistic anchor assignment method that adaptively separates positive and negative anchors based on IoU prediction, improving object detection performance with minimal additional computation.
Contribution
It proposes a novel probabilistic anchor assignment strategy and IoU prediction to better align training and testing objectives in object detection.
Findings
Achieves new state-of-the-art results on MS COCO test-dev.
Efficient method requiring only one additional convolutional layer.
Significant performance improvements over baseline models.
Abstract
In object detection, determining which anchors to assign as positive or negative samples, known as anchor assignment, has been revealed as a core procedure that can significantly affect a model's performance. In this paper we propose a novel anchor assignment strategy that adaptively separates anchors into positive and negative samples for a ground truth bounding box according to the model's learning status such that it is able to reason about the separation in a probabilistic manner. To do so we first calculate the scores of anchors conditioned on the model and fit a probability distribution to these scores. The model is then trained with anchors separated into positive and negative samples according to their probabilities. Moreover, we investigate the gap between the training and testing objectives and propose to predict the Intersection-over-Unions of detected boxes as a measure of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsProbabilistic Anchor Assignment · Convolution · 1x1 Convolution · Feature Pyramid Network · Focal Loss · RetinaNet
