Box Re-Ranking: Unsupervised False Positive Suppression for Domain Adaptive Pedestrian Detection

• URL: http://arxiv.org/abs/2102.00595v1
• Date: Mon, 1 Feb 2021 02:31:11 GMT
• Title: Box Re-Ranking: Unsupervised False Positive Suppression for Domain Adaptive Pedestrian Detection
• Authors: Weijie Chen and Yilu Guo and Shicai Yang and Zhaoyang Li and Zhenxin Ma and Binbin Chen and Long Zhao and Di Xie and Shiliang Pu and Yueting Zhuang
• Abstract summary: False positive is one of the most serious problems brought by domain shift in domain adaptive pedestrian detection. We transform a false positive suppression problem into a box re-ranking problem elegantly. Considering we aim to keep the detection of true positive unchanged, we propose box number alignment.
• Score: 70.25977409196449
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: False positive is one of the most serious problems brought by agnostic domain shift in domain adaptive pedestrian detection. However, it is impossible to label each box in countless target domains. Therefore, it yields our attention to suppress false positive in each target domain in an unsupervised way. In this paper, we model an object detection task into a ranking task among positive and negative boxes innovatively, and thus transform a false positive suppression problem into a box re-ranking problem elegantly, which makes it feasible to solve without manual annotation. An attached problem during box re-ranking appears that no labeled validation data is available for cherrypicking. Considering we aim to keep the detection of true positive unchanged, we propose box number alignment, a self-supervised evaluation metric, to prevent the optimized model from capacity degeneration. Extensive experiments conducted on cross-domain pedestrian detection datasets have demonstrated the effectiveness of our proposed framework. Furthermore, the extension to two general unsupervised domain adaptive object detection benchmarks also supports our superiority to other state-of-the-arts.

Related papers

• Unsupervised Adaptation from Repeated Traversals for Autonomous Driving [54.59577283226982]
  Self-driving cars must generalize to the end-user's environment to operate reliably. One potential solution is to leverage unlabeled data collected from the end-users' environments. There is no reliable signal in the target domain to supervise the adaptation process. We show that this simple additional assumption is sufficient to obtain a potent signal that allows us to perform iterative self-training of 3D object detectors on the target domain.
  arXiv  Detail & Related papers  (2023-03-27T15:07:55Z)
• Positive-Unlabeled Domain Adaptation [7.143879014059893]
  We present a novel two-step learning approach to the problem of Positive-Unlabeled Domain Adaptation. We identify reliable positive and negative pseudo-labels in the target domain guided by source domain labels and a positive-unlabeled risk estimator. We validate our approach by running experiments on benchmark datasets for visual object recognition.
  arXiv  Detail & Related papers  (2022-02-11T15:32:02Z)
• Joint Distribution Alignment via Adversarial Learning for Domain Adaptive Object Detection [11.262560426527818]
  Unsupervised domain adaptive object detection aims to adapt a well-trained detector from its original source domain with rich labeled data to a new target domain with unlabeled data. Recently, mainstream approaches perform this task through adversarial learning, yet still suffer from two limitations. We propose a joint adaptive detection framework (JADF) to address the above challenges.
  arXiv  Detail & Related papers  (2021-09-19T00:27:08Z)
• Uncertainty-Aware Model Adaptation for Unsupervised Cross-Domain Object Detection [12.807987076435928]
  This work tackles the unsupervised cross-domain object detection problem. It aims to generalize a pre-trained object detector to a new target domain without labels.
  arXiv  Detail & Related papers  (2021-08-28T09:37:18Z)
• Tune it the Right Way: Unsupervised Validation of Domain Adaptation via Soft Neighborhood Density [125.64297244986552]
  We propose an unsupervised validation criterion that measures the density of soft neighborhoods by computing the entropy of the similarity distribution between points. Our criterion is simpler than competing validation methods, yet more effective.
  arXiv  Detail & Related papers  (2021-08-24T17:41:45Z)
• Unsupervised Out-of-Domain Detection via Pre-trained Transformers [56.689635664358256]
  Out-of-domain inputs can lead to unpredictable outputs and sometimes catastrophic safety issues. Our work tackles the problem of detecting out-of-domain samples with only unsupervised in-domain data. Two domain-specific fine-tuning approaches are further proposed to boost detection accuracy.
  arXiv  Detail & Related papers  (2021-06-02T05:21:25Z)
• Unsupervised Robust Domain Adaptation without Source Data [75.85602424699447]
  We study the problem of robust domain adaptation in the context of unavailable target labels and source data. We show a consistent performance improvement of over $10%$ in accuracy against the tested baselines on four benchmark datasets.
  arXiv  Detail & Related papers  (2021-03-26T16:42:28Z)
• A Free Lunch for Unsupervised Domain Adaptive Object Detection without Source Data [69.091485888121]
  Unsupervised domain adaptation assumes that source and target domain data are freely available and usually trained together to reduce the domain gap. We propose a source data-free domain adaptive object detection (SFOD) framework via modeling it into a problem of learning with noisy labels.
  arXiv  Detail & Related papers  (2020-12-10T01:42:35Z)

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.