OneNet: Towards End-to-End One-Stage Object Detection

• URL: http://arxiv.org/abs/2012.05780v1
• Date: Thu, 10 Dec 2020 16:15:19 GMT
• Title: OneNet: Towards End-to-End One-Stage Object Detection
• Authors: Peize Sun, Yi Jiang, Enze Xie, Zehuan Yuan, Changhu Wang, Ping Luo
• Abstract summary: Existing one-stage object detectors assign labels by only location cost. Without classification cost, sole location cost leads to redundant boxes of high confidence scores in inference. To design an end-to-end one-stage object detector, we propose Minimum Cost Assignment. OneNet achieves 35.0 AP/80 FPS and 37.7 AP/50 FPS with image size of 512 pixels.
• Score: 39.445348555252785
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: End-to-end one-stage object detection trailed thus far. This paper discovers that the lack of classification cost between sample and ground-truth in label assignment is the main obstacle for one-stage detectors to remove Non-maximum Suppression(NMS) and reach end-to-end. Existing one-stage object detectors assign labels by only location cost, e.g. box IoU or point distance. Without classification cost, sole location cost leads to redundant boxes of high confidence scores in inference, making NMS necessary post-processing. To design an end-to-end one-stage object detector, we propose Minimum Cost Assignment. The cost is the summation of classification cost and location cost between sample and ground-truth. For each object ground-truth, only one sample of minimum cost is assigned as the positive sample; others are all negative samples. To evaluate the effectiveness of our method, we design an extremely simple one-stage detector named OneNet. Our results show that when trained with Minimum Cost Assignment, OneNet avoids producing duplicated boxes and achieves to end-to-end detector. On COCO dataset, OneNet achieves 35.0 AP/80 FPS and 37.7 AP/50 FPS with image size of 512 pixels. We hope OneNet could serve as an effective baseline for end-to-end one-stage object detection. The code is available at: \url{https://github.com/PeizeSun/OneNet}.

Related papers

• Label-Efficient Object Detection via Region Proposal Network Pre-Training [58.50615557874024]
  We propose a simple pretext task that provides an effective pre-training for the region proposal network (RPN) In comparison with multi-stage detectors without RPN pre-training, our approach is able to consistently improve downstream task performance.
  arXiv  Detail & Related papers  (2022-11-16T16:28:18Z)
• RFLA: Gaussian Receptive Field based Label Assignment for Tiny Object Detection [45.10513110142015]
  Current anchor-based or anchor-free label assignment paradigms incur many outlier tiny-sized ground truth samples. We propose a Gaussian Receptive Field based Label Assignment (RFLA) strategy for tiny object detection. Our approach outperforms the state-of-the-art competitors with 4.0 AP points on the AI-TOD dataset.
  arXiv  Detail & Related papers  (2022-08-18T09:35:56Z)
• End-to-End Instance Edge Detection [29.650295133113183]
  Edge detection has long been an important problem in the field of computer vision. Previous works have explored category-agnostic or category-aware edge detection. In this paper, we explore edge detection in the context of object instances.
  arXiv  Detail & Related papers  (2022-04-06T15:32:21Z)
• Anchor-free Oriented Proposal Generator for Object Detection [59.54125119453818]
  Oriented object detection is a practical and challenging task in remote sensing image interpretation. Nowadays, oriented detectors mostly use horizontal boxes as intermedium to derive oriented boxes from them. We propose a novel Anchor-free Oriented Proposal Generator (AOPG) that abandons the horizontal boxes-related operations from the network architecture.
  arXiv  Detail & Related papers  (2021-10-05T10:45:51Z)
• Object Detection Made Simpler by Eliminating Heuristic NMS [70.93004137521946]
  We show a simple NMS-free, end-to-end object detection framework. We attain on par or even improved detection accuracy compared with the original one-stage detector.
  arXiv  Detail & Related papers  (2021-01-28T02:38:29Z)
• Sparse R-CNN: End-to-End Object Detection with Learnable Proposals [77.9701193170127]
  We present Sparse R-CNN, a purely sparse method for object detection in images. Final predictions are directly output without non-maximum suppression post-procedure. We hope our work could inspire re-thinking the convention of dense prior in object detectors.
  arXiv  Detail & Related papers  (2020-11-25T00:01:28Z)
• Reducing Label Noise in Anchor-Free Object Detection [12.397047191315966]
  Current anchor-free object detectors label all the features that spatially fall inside a predefined central region as positive. We propose a new labeling strategy aimed to reduce the label noise in anchor-free detectors. We develop a new one-stage, anchor-free object detector, PPDet, to employ this labeling strategy during training and a similar prediction pooling method during inference.
  arXiv  Detail & Related papers  (2020-08-03T20:02:46Z)
• FCOS: A simple and strong anchor-free object detector [111.87691210818194]
  We propose a fully convolutional one-stage object detector (FCOS) to solve object detection in a per-pixel prediction fashion. Almost all state-of-the-art object detectors such as RetinaNet, SSD, YOLOv3, and Faster R-CNN rely on pre-defined anchor boxes. In contrast, our proposed detector FCOS is anchor box free, as well as proposal free.
  arXiv  Detail & Related papers  (2020-06-14T01:03:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.