Domain adaptation of anchor-free object detection for urban traffic

计算机科学 域适应 适应(眼睛) 领域(数学分析) 计算机视觉 人工智能 对象(语法) 目标检测 数据挖掘 模式识别(心理学) 数学 分类器(UML) 光学 物理 数学分析
作者
Xiaodong Yu,Xiaoqiang Lu
出处
期刊:Neurocomputing [Elsevier]
卷期号:582: 127477-127477
标识
DOI:10.1016/j.neucom.2024.127477
摘要

Modern detectors are mostly trained under single and limited conditions. However, object detection faces various complex and open situations in autonomous driving, especially in urban street scenes with dense objects and complex backgrounds. Due to the shift in data distribution, modern detectors can not perform well in actual urban environments. Using domain adaptation to improve detection performance is one of the key methods to extend object detection from limited situations to open situations. To this end, this article proposes a Domain Adaptation of Anchor-Free object detection (DAAF) for urban traffic. DAAF is a cross-domain object detection method that performs feature alignment including two aspects. On the one hand, we designed a fully convolutional adversarial training method for global feature alignment at the image level. Meanwhile, images can generally be decomposed into structural information and texture information. In urban street scenes, the structural information of images is generally similar. The main difference between the source domain and the target domain is texture information. Therefore, during global feature alignment, this paper proposes a method called texture information limitation (TIL). On the other hand, in order to solve the problem of variable aspect ratios of objects in urban street scenes, this article uses an anchor-free detector as the baseline detector. Since the anchor-free object detector can obtain neither explicit nor implicit instance-level features, we adopt Pixel-Level Adaptation (PLA) to align local features instead of instance-level alignment for local features. The size of the object has the greatest impact on the final detection effect, and the object scale in urban scenes is relatively rich. Guided by the differentiation of attention mechanisms, a multi-level adversarial network is designed to perform feature alignment of the output space at different feature levels called Scale Information Limitation (SIL). We conducted cross-domain detection experiments by using various urban streetscape autonomous driving object detection datasets, including adverse weather conditions, synthetic data to real data, and cross-camera adaptation. The experimental results indicate that the method proposed in this article is effective.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
可可完成签到,获得积分10
刚刚
国郭发布了新的文献求助10
刚刚
1秒前
暮光之城完成签到,获得积分10
3秒前
5秒前
5秒前
643236发布了新的文献求助10
6秒前
小麻完成签到,获得积分10
7秒前
niwei发布了新的文献求助10
8秒前
暮光之城发布了新的文献求助10
9秒前
言午完成签到,获得积分10
9秒前
12秒前
长歌应助jasmine采纳,获得10
14秒前
所所应助汪汪采纳,获得10
16秒前
17秒前
打打应助展开的黑花球采纳,获得10
20秒前
20秒前
孟韩发布了新的文献求助10
22秒前
23秒前
所所应助外向寄云采纳,获得10
26秒前
魔法签证1993完成签到,获得积分10
26秒前
27秒前
heija完成签到,获得积分10
27秒前
27秒前
长歌应助jasmine采纳,获得10
27秒前
科学家发布了新的文献求助10
28秒前
shi0331完成签到,获得积分10
28秒前
雪白不斜完成签到 ,获得积分10
30秒前
小号来了发布了新的文献求助10
31秒前
32秒前
歌者无罪发布了新的文献求助10
33秒前
33秒前
游离完成签到 ,获得积分10
34秒前
tianzml0应助孟韩采纳,获得10
34秒前
所所应助孟韩采纳,获得10
34秒前
yu发布了新的文献求助200
35秒前
外向寄云发布了新的文献求助10
36秒前
无情的无血完成签到,获得积分20
37秒前
38秒前
沫豆应助菠菜采纳,获得150
39秒前
高分求助中
Formgebungs- und Stabilisierungsparameter für das Konstruktionsverfahren der FiDU-Freien Innendruckumformung von Blech 1000
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
The Illustrated History of Gymnastics 800
Yuwu Song, Biographical Dictionary of the People's Republic of China 800
The Bourse of Babylon : market quotations in the astronomical diaries of Babylonia 680
Division and square root. Digit-recurrence algorithms and implementations 500
機能營養學前瞻(3 Ed.) 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2502768
求助须知:如何正确求助?哪些是违规求助? 2156414
关于积分的说明 5518110
捐赠科研通 1876895
什么是DOI,文献DOI怎么找? 933483
版权声明 563879
科研通“疑难数据库(出版商)”最低求助积分说明 498686