Demo Data from EDBT 2026 / reviewers in the wild / expert
Seun-An Choe
dblp:378/5513
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 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
3 papers |
Transfer learning and domain adaptation · 64% Segmentation and scene understanding · 21% Image recognition and object detection · 15% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Segmentation and scene understanding
semantic segmentation |
1.6 | 2 | 2025 | Universal Domain Adaptation for Semantic Segmentation · CVPR 2025 Open-Set Domain Adaptation for Semantic Segmentation · CVPR 2024 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation |
1.6 | 2 | 2025 | Universal Domain Adaptation for Semantic Segmentation · CVPR 2025 Open-Set Domain Adaptation for Semantic Segmentation · CVPR 2024 |
Machine learning › Transfer learning and domain adaptation
domain adaptation |
0.9 | 1 | 2025 | SFUOD: Source-Free Unknown Object Detection · ICCV 2025 |
Computer vision › Image recognition and object detection
object detection |
0.9 | 1 | 2025 | SFUOD: Source-Free Unknown Object Detection · ICCV 2025 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
source-free domain adaptation |
0.9 | 1 | 2025 | SFUOD: Source-Free Unknown Object Detection · ICCV 2025 |
Machine learning › Transfer learning and domain adaptation › domain adaptation › unsupervised domain adaptation
universal domain adaptation |
0.9 | 1 | 2025 | Universal Domain Adaptation for Semantic Segmentation · CVPR 2025 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
open-set domain adaptation |
0.8 | 1 | 2024 | Open-Set Domain Adaptation for Semantic Segmentation · CVPR 2024 |
Computer vision › Image recognition and object detection › object detection › open-world object detection
unknown object detection |
0.3 | 1 | 2025 | SFUOD: Source-Free Unknown Object Detection · ICCV 2025 |
Methods — techniques the papers use, named apart from their topics
pseudo-labeling · 1.7prototype learning · 0.9principal axis projection · 0.9image matching · 0.9cross-domain attention · 0.9data augmentation · 0.8contrastive learning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Universal Domain Adaptation for Semantic SegmentationabstractUnsupervised domain adaptation for semantic segmentation (UDA-SS) aims to transfer knowledge from labeled source data to unlabeled target data. However, traditional UDA-SS methods assume that category settings between source and target domains are known, which is unrealistic in real-world scenarios. This leads to performance degradation if private private classes exist. To address this limitation, we propose Universal Domain Adaptation for Semantic Segmentation (UniDA-SS), achieving robust adaptation even without prior knowledge of category settings. We define the problem in the UniDA-SS scenario as low confidence scores of common classes in the target domain, which leads to confusion with private classes. To solve this problem, we propose UniMAP: UniDA-SS with Image Matching and Prototype-based Distinction, a novel framework composed of two key components. First, Domain-Specific Prototype-based Distinction (DSPD) divides each class into two domain-specific prototypes, enabling finer separation of domain-specific features and enhancing the identification of common classes across domains. Second, Target-based Image Matching (TIM) selects a source image containing the most common-class pixels based on the target pseudo-label and pairs it in a batch to promote effective learning of common classes. We also introduce a new UniDA-SS benchmark and demonstrate through various experiments that UniMAP significantly outperforms baselines. The code is available at https://github.com/KU-VGI/UniMAP. Seun-An Choe, Keon-Hee Park, Jinwoo Choi 0001, Gyeong-Moon Park |
CVPR | 1 |
| 2025 | SFUOD: Source-Free Unknown Object DetectionabstractSource-free object detection adapts a detector pre-trained on a source domain to an unlabeled target domain without requiring access to labeled source data. While this setting is practical as it eliminates the need for the source dataset during domain adaptation, it operates under the restrictive assumption that only pre-defined objects from the source domain exist in the target domain. This closed-set setting prevents the detector from detecting undefined objects. To ease this assumption, we propose Source-Free Unknown Object Detection (SFUOD), a novel scenario which enables the detector to not only recognize known objects but also detect undefined objects as unknown objects. To this end, we propose CollaPAUL (Collaborative tuning and Principal Axis-based Unknown Labeling), a novel framework for SFUOD. Collaborative tuning enhances knowledge adaptation by integrating target-dependent knowledge from the auxiliary encoder with source-dependent knowledge from the pre-trained detector through a cross-domain attention mechanism. Additionally, principal axes-based unknown labeling assigns pseudo-labels to unknown objects by estimating objectness via principal axes projection and confidence scores from model predictions. The proposed CollaPAUL achieves state-of-the-art performances on SFUOD benchmarks, and extensive experiments validate its effectiveness. Keon-Hee Park, Seun-An Choe, Gyeong-Moon Park |
ICCV | 2 |
| 2024 | Open-Set Domain Adaptation for Semantic SegmentationabstractUnsupervised domain adaptation (UDA) for semantic segmentation aims to transfer the pixel-wise knowledge from the labeled source domain to the unlabeled target do-main. However, current UDA methods typically assume a shared label space between source and target, limiting their applicability in real-world scenarios where novel cat-egories may emerge in the target domain. In this paper, we introduce Open-Set Domain Adaptation for Semantic Segmentation (OSDA -SS) for the first time, where the target domain includes unknown classes. We identify two major problems in the OSDA -SS scenario as follows: 1) the existing UDA methods struggle to predict the exact boundary of the unknown classes, and 2) they fail to accurately predict the shape of the unknown classes. To address these issues, we propose Boundary and Unknown Shape-Aware open-set domain adaptation, coined BUS. Our BUS can accu-rately discern the boundaries between known and unknown classes in a contrastive manner using a novel dilation-erosion-based contrastive loss. In addition, we propose OpenReMix, a new domain mixing augmentation method that guides our model to effectively learn domain and size-invariant features for improving the shape detection of the known and unknown classes. Through extensive experiments, we demonstrate that our proposed BUS effectively detects unknown classes in the challenging OSDA-SS sce-nario compared to the previous methods by a large margin. The code is available at https://github.com/KHUAGI/BUS. Seun-An Choe, Ah-Hyung Shin, Keon-Hee Park, Jinwoo Choi 0001, Gyeong-Moon Park |
CVPR | 1 |