arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.08009cs.CV
收藏

基于伪标签再生与BEVMix的半监督类别无关运动预测

Semi-Supervised Class-Agnostic Motion Prediction with Pseudo Label Regeneration and BEVMix

Nanyang Technological University(南洋理工大学);Huazhong University of Science and Technology(华中科技大学);SenseTime Research(商汤科技研究院)

Kewei Wang, Yizheng Wu, Zhiyu Pan, Xingyi Li, Ke Xian, Zhe Wang, Zhiguo Cao, Guosheng Lin

AI总结:

针对类别无关运动预测全监督训练标注成本高的问题,提出含运动选择再生模块、时间采样与BEVMix增强的半监督框架,仅用少量标注数据性能就远超自监督方法,可平衡标注成本与性能。

摘要:

类别无关运动预测方法旨在理解开放世界场景中的运动,对自动驾驶系统具有重要意义。然而,以全监督方式训练高性能模型始终需要大量手动标注数据,获取这类数据成本高昂且耗时。为应对这一挑战,本研究探索了半监督学习(SSL)在类别无关运动预测中的应用潜力。我们的SSL框架采用基于一致性的自训练范式,通过测试时推理生成伪标签,使模型能够从无标注数据中学习。为提升伪标签质量,我们提出了一种新颖的运动选择与再生模块,该模块可有效筛选可靠伪标签,并对不可靠的伪标签进行再生。此外,我们提出了两种数据增强策略:时间采样与BEVMix,这两种策略为SSL中的一致性正则化提供了支撑。在nuScenes数据集上开展的实验表明,我们的SSL方法仅使用极少比例的标注数据,性能就能大幅超越自监督方法;此外,该方法的性能与弱监督方法及部分全监督方法相当。这些结果凸显了我们的方法在标注成本与性能之间实现良好平衡的能力。代码将发布于https://github.com/kwwcv/SSMP。

英文摘要:

Class-agnostic motion prediction methods aim to comprehend motion within open-world scenarios, holding significance for autonomous driving systems. However, training a high-performance model in a fully-supervised manner always requires substantial amounts of manually annotated data, which can be both expensive and time-consuming to obtain. To address this challenge, our study explores the potential of semi-supervised learning (SSL) for class-agnostic motion prediction. Our SSL framework adopts a consistency-based self-training paradigm, enabling the model to learn from unlabeled data by generating pseudo labels through test-time inference. To improve the quality of pseudo labels, we propose a novel motion selection and re-generation module. This module effectively selects reliable pseudo labels and re-generates unreliable ones. Furthermore, we propose two data augmentation strategies: temporal sampling and BEVMix. These strategies facilitate consistency regularization in SSL. Experiments conducted on nuScenes demonstrate that our SSL method can surpass the self-supervised approach by a large margin by utilizing only a tiny fraction of labeled data. Furthermore, our method exhibits comparable performance to weakly and some fully supervised methods. These results highlight the ability of our method to strike a favorable balance between annotation costs and performance. Code will be available at https://github.com/kwwcv/SSMP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑