One-to-Few Label Assignment for End-to-End Dense Detection

• URL: http://arxiv.org/abs/2303.11567v1
• Date: Tue, 21 Mar 2023 03:24:47 GMT
• Title: One-to-Few Label Assignment for End-to-End Dense Detection
• Abstract summary: One-to-one (o2o) label assignment plays a key role for transformer based end-to-end detection. We propose a simple yet effective one-to-few (o2f) label assignment strategy for end-to-end dense detection.
• Score: 19.497115000680076
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One-to-one (o2o) label assignment plays a key role for transformer based end-to-end detection, and it has been recently introduced in fully convolutional detectors for end-to-end dense detection. However, o2o can degrade the feature learning efficiency due to the limited number of positive samples. Though extra positive samples are introduced to mitigate this issue in recent DETRs, the computation of self- and cross- attentions in the decoder limits its practical application to dense and fully convolutional detectors. In this work, we propose a simple yet effective one-to-few (o2f) label assignment strategy for end-to-end dense detection. Apart from defining one positive and many negative anchors for each object, we define several soft anchors, which serve as positive and negative samples simultaneously. The positive and negative weights of these soft anchors are dynamically adjusted during training so that they can contribute more to ``representation learning'' in the early training stage, and contribute more to ``duplicated prediction removal'' in the later stage. The detector trained in this way can not only learn a strong feature representation but also perform end-to-end dense detection. Experiments on COCO and CrowdHuman datasets demonstrate the effectiveness of the o2f scheme. Code is available at https://github.com/strongwolf/o2f.

Related papers

• S$^2$Teacher: Step-by-step Teacher for Sparsely Annotated Oriented Object Detection [55.34086214300803]
  We introduce a novel setting called sparsely annotated object detection (SAOOD), which only labels partial instances. Specifically, we focus on two key issues in the setting: (1) sparse labeling leading to overfitting on limited foreground representations, and (2) unlabeled objects (false negatives) confusing feature learning. To this end, we propose the S$2$Teacher, a novel method that progressively mines pseudo-labels for unlabeled objects, from easy to hard, to enhance foreground representations.
  arXiv  Detail & Related papers  (2025-04-15T11:57:00Z)
• MutDet: Mutually Optimizing Pre-training for Remote Sensing Object Detection [36.478530086163744]
  We propose a novel Mutually optimizing pre-training framework for remote sensing object Detection, dubbed as MutDet. MutDet fuses the object embeddings and detector features bidirectionally in the last encoder layer, enhancing their information interaction. Experiments on various settings show new state-of-the-art transfer performance.
  arXiv  Detail & Related papers  (2024-07-13T15:28:15Z)
• Boost UAV-based Ojbect Detection via Scale-Invariant Feature Disentanglement and Adversarial Learning [18.11107031800982]
  We propose to improve single-stage inference accuracy through learning scale-invariant features. Our approach can effectively improve model accuracy and achieve state-of-the-art (SoTA) performance on two datasets.
  arXiv  Detail & Related papers  (2024-05-24T11:40:22Z)
• Bridging the Gap Between End-to-end and Non-End-to-end Multi-Object Tracking [27.74953961900086]
  Existing end-to-end Multi-Object Tracking (e2e-MOT) methods have not surpassed non-end-to-end tracking-by-detection methods. We present Co-MOT, a simple and effective method to facilitate e2e-MOT by a novel coopetition label assignment with a shadow concept.
  arXiv  Detail & Related papers  (2023-05-22T05:18:34Z)
• Calibrated Teacher for Sparsely Annotated Object Detection [35.74904852812749]
  Fully supervised object detection requires training images in which all instances are annotated. This is actually impractical due to the high labor and time costs and the unavoidable missing annotations. Recent works on sparsely annotated object detection alleviate this problem by generating pseudo labels for the missing annotations. We propose a Calibrated Teacher, of which the confidence estimation of the prediction is well to match its real precision.
  arXiv  Detail & Related papers  (2023-03-14T02:02:39Z)
• 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)
• Segment-level Metric Learning for Few-shot Bioacoustic Event Detection [56.59107110017436]
  We propose a segment-level few-shot learning framework that utilizes both the positive and negative events during model optimization. Our system achieves an F-measure of 62.73 on the DCASE 2022 challenge task 5 (DCASE2022-T5) validation set, outperforming the performance of the baseline prototypical network 34.02 by a large margin.
  arXiv  Detail & Related papers  (2022-07-15T22:41:30Z)
• Co-mining: Self-Supervised Learning for Sparsely Annotated Object Detection [29.683119976550007]
  We propose a simple but effective mechanism, called Co-mining, for sparsely annotated object detection. In our Co-mining, two branches of a Siamese network predict the pseudo-label sets for each other. Experiments are performed on MS dataset with three different sparsely annotated settings.
  arXiv  Detail & Related papers  (2020-12-03T14:23:43Z)
• 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)
• Multi-scale Interactive Network for Salient Object Detection [91.43066633305662]
  We propose the aggregate interaction modules to integrate the features from adjacent levels. To obtain more efficient multi-scale features, the self-interaction modules are embedded in each decoder unit. Experimental results on five benchmark datasets demonstrate that the proposed method without any post-processing performs favorably against 23 state-of-the-art approaches.
  arXiv  Detail & Related papers  (2020-07-17T15:41:37Z)
• 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)
• Learning a Unified Sample Weighting Network for Object Detection [113.98404690619982]
  Region sampling or weighting is significantly important to the success of modern region-based object detectors. We argue that sample weighting should be data-dependent and task-dependent. We propose a unified sample weighting network to predict a sample's task weights.
  arXiv  Detail & Related papers  (2020-06-11T16:19:16Z)
• EHSOD: CAM-Guided End-to-end Hybrid-Supervised Object Detection with Cascade Refinement [53.69674636044927]
  We present EHSOD, an end-to-end hybrid-supervised object detection system. It can be trained in one shot on both fully and weakly-annotated data. It achieves comparable results on multiple object detection benchmarks with only 30% fully-annotated data.
  arXiv  Detail & Related papers  (2020-02-18T08:04:58Z)

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.