无需重训练,用特征降维提升目标检测对未知物体的鲁棒性。
On the Inherent Robustness of One-Stage Object Detection against Out-of-Distribution Data
- 利用模型提取的特征,通过有监督降维识别未知目标。
- 在未知物体检测上优于基于置信度的后处理方法,且不需重新训练。
- 适合已部署的预训练检测模型,提升开放世界下的可靠性。
鲁棒性是确保模型在开放世界中安全可信的关键。本文分析了单阶段目标检测器对分布外(OoD)数据的内在抗扰能力。提出一种新算法,在不重新训练检测器的前提下,利用样本特征检测未知物体。该方法采用有监督降维技术缓解高维特征的维度灾难问题,并通过高分辨率特征图实现无监督的未知物体定位。实验分析了不同配置与置信度阈值下的已知/未知物体检测性能权衡,对比了基于逻辑值的后处理方法及融合策略。结果表明,所提方法可显著提升先进后处理OoD检测器的性能,在最新发布的未知物体检测基准上表现优异。
原文摘要 · Abstract (English)
Robustness is a fundamental aspect for developing safe and trustworthy models, particularly when they are deployed in the open world. In this work we analyze the inherent capability of one-stage object detectors to robustly operate in the presence of out-of-distribution (OoD) data. Specifically, we propose a novel detection algorithm for detecting unknown objects in image data, which leverages the features extracted by the model from each sample. Differently from other recent approaches in the literature, our proposal does not require retraining the object detector, thereby allowing for the use of pretrained models. Our proposed OoD detector exploits the application of supervised dimensionality reduction techniques to mitigate the effects of the curse of dimensionality on the features extracted by the model. Furthermore, it utilizes high-resolution feature maps to identify potential unknown objects in an unsupervised fashion. Our experiments analyze the Pareto trade-off between the performance detecting known and unknown objects resulting from different algorithmic configurations and inference confidence thresholds. We also compare the performance of our proposed algorithm to that of logits-based post-hoc OoD methods, as well as possible fusion strategies. Finally, we discuss on the competitiveness of all tested methods against state-of-the-art OoD approaches for object detection models over the recently published Unknown Object Detection benchmark. The obtained results verify that the performance of avant-garde post-hoc OoD detectors can be further improved when combined with our proposed algorithm.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。