CTS: Sim-to-Real Unsupervised Domain Adaptation on 3D Detection

TL;DR

This paper introduces CTS, a novel framework for unsupervised domain adaptation in 3D object detection, effectively transferring models from simulation to real-world data and outperforming existing methods.

Contribution

The work proposes a threefold novel approach including anchor heads, RoI augmentation, and a corner-format AU representation, advancing sim-to-real 3D detection.

Findings

Significantly improves sim-to-real 3D detection performance

Outperforms state-of-the-art cross-domain algorithms

Enhances pseudo-label quality and robustness

Abstract

Simulation data can be accurately labeled and have been expected to improve the performance of data-driven algorithms, including object detection. However, due to the various domain inconsistencies from simulation to reality (sim-to-real),cross-domain object detection algorithms usually suffer from dramatic performance drops. While numerous unsupervised domain adaptation (UDA) methods have been developed to address cross-domain tasks between real-world datasets, progress in sim-to-real remains limited. This paper presents a novel Complex-to-Simple (CTS) framework to transfer models from labeled simulation (source) to unlabeled reality (target) domains. Based on a two-stage detector, the novelty of this work is threefold: 1) developing fixed-size anchor heads and RoI augmentation to address size bias and feature diversity between two domains, thereby improving the quality of pseudo-label; 2) developing a novel corner-format representation of aleatoric uncertainty (AU) for the bounding box, to uniformly quantify pseudo-label quality; 3) developing a noise-aware mean teacher domain adaptation method based on AU, as well as object-level and frame-level sampling strategies, to migrate the impact of noisy labels. Experimental results demonstrate that our proposed approach significantly enhances the sim-to-real domain adaptation capability of 3D object detection models, outperforming state-of-the-art cross-domain algorithms, which are usually developed for real-to-real UDA tasks.