Toward Improving Robustness of Object Detectors Against Domain Shift
Not on the map. Why?
Abstract (arXiv)
This paper proposes a data augmentation method for improving the robustness of driving object detectors against domain shift. Domain shift problem arises when there is a significant change between the distribution of the source data domain used in the training phase and that of the target data domain in the deployment phase. Domain shift is known as one of the most popular reasons resulting in the considerable drop in the performance of deep neural network models. In order to address this problem, one effective approach is to increase the diversity of training data. To this end, we propose a data synthesis module that can be utilized to train more robust and effective object detectors. By adopting YOLOv4 as a base object detector, we have witnessed a remarkable improvement in performance on both the source and target domain data. The code of this work is publicly available at https://github.com/tranleanh/haze-synthesis.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 10 of its 15 references that are in the map. First posted on arXiv 2 Dec 2023.
Builds on
10 of 15 references.
References · 10
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
- 2019Scalability in Perception for Autonomous Driving: Waymo Open Datasetcited by 2,436
- 2020YOLOv4: Optimal Speed and Accuracy of Object Detectioncited by 1,624
- 2016YOLO9000: Better, Faster, Strongercited by 1,429
- 2018Path Aggregation Network for Instance Segmentationcited by 796
- 2014Spatial Pyramid Pooling in Deep Convolutional Networks for Visual Recognitioncited by 719
- 2017Semantic Foggy Scene Understanding with Synthetic Datacited by 401
- 2022A Novel Encoder-Decoder Network with Guided Transmission Map for Single Image Dehazingcited by 7
Built on by
Citing papers per year: 2024: 2.
2 papers.