Demo Data from EDBT 2026 / reviewers in the wild / expert
Shijie Hong
dblp:411/0454
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Transfer learning and domain adaptation · 46% Image recognition and object detection · 23% Deep learning architectures and training · 23% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation › domain adaptation › visual domain adaptation
detector adaptation |
0.9 | 1 | 2025 | Dual-Domain Teacher for Unsupervised Domain Adaptation Detection · IEEE Trans. Multim. 2025 |
Computer vision › Image recognition and object detection
object detection |
0.9 | 1 | 2025 | Dual-Domain Teacher for Unsupervised Domain Adaptation Detection · IEEE Trans. Multim. 2025 |
Machine learning › Deep learning architectures and training
teacher-student framework |
0.9 | 1 | 2025 | Dual-Domain Teacher for Unsupervised Domain Adaptation Detection · IEEE Trans. Multim. 2025 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation |
0.9 | 1 | 2025 | Dual-Domain Teacher for Unsupervised Domain Adaptation Detection · IEEE Trans. Multim. 2025 |
Machine learning › Learning paradigms › weakly supervised learning
pseudo-label reliability |
0.3 | 1 | 2025 | Dual-Domain Teacher for Unsupervised Domain Adaptation Detection · IEEE Trans. Multim. 2025 |
Methods — techniques the papers use, named apart from their topics
teacher-student learning · 0.9dynamic threshold · 0.9candidate set refinement · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Dual-Domain Teacher for Unsupervised Domain Adaptation DetectionabstractUnsupervised domain adaptation for object detection aims to bridge the domain gap by transferring knowledge from a labeled source domain to an unlabeled target domain, thus improving the performance of detection models. Common strategies focus on aligning the feature distributions between source and target domains to reduce their discrepancies. However, achieving complete alignment is often not feasible in real-world situations due to a lack of annotations in the target domain. Recently, TeacherStudent approaches achieve feature alignment by generating reliable target pseudo-labels and become the dominant solution for addressing this issue. However, due to the domain shift, the teacher model bias to source domain, making it challenging to enhance the quality of target pseudo-labels. Some methods within this framework attempt to overcome the domain shift by incorporating distribution alignment components, yet these approaches also face challenges in achieving perfect alignment between domains. In this paper, we propose the Dual-Domain Teacher (DDT) method to address the domain adaptation detection problem by simultaneously detecting objects in both domains, thereby decreasing the need for perfect alignment. To address the issue of duplicate detection results produced by the Dual-Domain detection process, a candidate set refinement strategy is proposed to eliminate these duplicates across domains. Moreover, when teachers generate pseudo-labels by selecting reliable predictions with fixed confidence thresholds, valuable predictions may be overlooked in mutual learning. In our approach, a minimum variance-based dynamic threshold module is designed to mine valuable pseudo-labels by adaptively adjusting to the optimal threshold. Extensive experiments show that the DDT achieve a 56.7$\%$mAP on the CityScapes-to-Foggy CityScapes task, marking a 4.8 point improvement over the latest methods. On the PASCAL VOC-to-Clipart1k task, our method reaches 51.2$\%$mAP, outperforming previous state-of-the-art. Luhui Zhao, Shijie Hong, Chen Liu 0030, Changxin Gao, Dapeng Luo |
IEEE Trans. Multim. | 3 |