mlsanityData to 7 Oct 2026

Simplifying Source-Free Domain Adaptation for Object Detection: Effective Self-Training Strategies and Performance Insights

arXiv 2407.07586 ↗First posted 10 Jul 2024cs.CV cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

This paper focuses on source-free domain adaptation for object detection in computer vision. This task is challenging and of great practical interest, due to the cost of obtaining annotated data sets for every new domain. Recent research has proposed various solutions for Source-Free Object Detection (SFOD), most being variations of teacher-student architectures with diverse feature alignment, regularization and pseudo-label selection strategies. Our work investigates simpler approaches and their performance compared to more complex SFOD methods in several adaptation scenarios. We highlight the importance of batch normalization layers in the detector backbone, and show that adapting only the batch statistics is a strong baseline for SFOD. We propose a simple extension of a Mean Teacher with strong-weak augmentation in the source-free setting, Source-Free Unbiased Teacher (SF-UT), and show that it actually outperforms most of the previous SFOD methods. Additionally, we showcase that an even simpler strategy consisting in training on a fixed set of pseudo-labels can achieve similar performance to the more complex teacher-student mutual learning, while being computationally efficient and mitigating the major issue of teacher-student collapse. We conduct experiments on several adaptation tasks using benchmark driving datasets including (Foggy)Cityscapes, Sim10k and KITTI, and achieve a notable improvement of 4.7% AP50 on CityscapesrightarrowFoggy-Cityscapes compared with the latest state-of-the-art in SFOD. Source code is available at https://github.com/EPFL-IMOS/simple-SFOD.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 43 of its 55 references that are in the map. First posted on arXiv 10 Jul 2024.

Builds on

43 of 55 references.

References · 43

  1. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  2. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  3. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  4. 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,427
  5. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  6. 2015Fast R-CNNcited by 2,930
  7. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
  8. 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
  9. 2016Instance Normalization: The Missing Ingredient for Fast Stylizationcited by 1,187
  10. 2021YOLOX: Exceeding YOLO Series in 2021cited by 1,064
  11. 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,054
  12. 2018Domain Adaptive Faster R-CNN for Object Detection in the Wildcited by 442
31 more
  1. 2017Semantic Foggy Scene Understanding with Synthetic Datacited by 401
  2. 2018Two at Once: Enhancing Learning and Generalization Capacities via IBN-Netcited by 361
  3. 2021Unbiased Teacher for Semi-Supervised Object Detectioncited by 305
  4. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  5. 2018Strong-Weak Distribution Alignment for Adaptive Object Detectioncited by 269
  6. 2019Domain-Specific Batch Normalization for Unsupervised Domain Adaptationcited by 197
  7. 2016Driving in the Matrix: Can Virtual Worlds Replace Human-Generated Annotations for Real World Tasks?cited by 194
  8. 2019Learning to Optimize Domain Specific Normalization for Domain Generalizationcited by 160
  9. 2020Unbiased Mean Teacher for Cross-domain Object Detectioncited by 158
  10. 2021Model Adaptation: Historical Contrastive Learning for Unsupervised Domain Adaptation without Source Datacited by 152
  11. 2019Exploring Object Relation in Mean Teacher for Cross-Domain Detectioncited by 136
  12. 2020Exploring Categorical Regularization for Domain Adaptive Object Detectioncited by 130
  13. 2021Cross-Domain Adaptive Teacher for Object Detectioncited by 125
  14. 2019A Robust Learning Approach to Domain Adaptive Object Detectioncited by 109
  15. 2021MeGA-CDA: Memory Guided Attention for Category-Aware Unsupervised Domain Adaptive Object Detectioncited by 106
  16. 2022A Closer Look at Smoothness in Domain Adversarial Trainingcited by 85
  17. 2020A Free Lunch for Unsupervised Domain Adaptive Object Detection without Source Datacited by 79
  18. 2020Spatial Attention Pyramid Network for Unsupervised Domain Adaptationcited by 56
  19. 2020Adapting Object Detectors with Conditional Domain Normalizationcited by 55
  20. 2020Domain Adaptive Object Detection via Asymmetric Tri-way Faster-RCNNcited by 55
  21. 2022Instance Relation Graph Guided Source-Free Domain Adaptive Object Detectioncited by 55
  22. 2020Collaborative Training between Region Proposal Localization and Classification for Domain Adaptive Object Detectioncited by 44
  23. 2022Task-specific Inconsistency Alignment for Domain Adaptive Object Detectioncited by 37
  24. 2023Adversarial Alignment for Source Free Object Detectioncited by 25
  25. 2020Unsupervised BatchNorm Adaptation (UBNA): A Domain Adaptation Method for Semantic Segmentation Without Using Source Domain Representationscited by 24
  26. 2023Periodically Exchange Teacher-Student for Source-Free Object Detectioncited by 24
  27. 2020Generalizable Model-agnostic Semantic Segmentation via Target-specific Normalizationcited by 20
  28. 2020Self-Guided Adaptation: Progressive Representation Alignment for Domain Adaptive Object Detectioncited by 13
  29. 2023Exploiting Low-confidence Pseudo-labels for Source-free Object Detectioncited by 13
  30. 2023Refined Pseudo labeling for Source-free Domain Adaptive Object Detectioncited by 7
  31. 2020Bi-Dimensional Feature Alignment for Cross-Domain Object Detectioncited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 8; 2026: 6.

14 papers.

Sort: