Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Donghyeon Kwon

dblp:317/6763 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
6since 2021 · last 2025
0009-0006-2791-1471ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 first-author · 4 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
4 papers
Efficient and distributed learning · 34% 3D vision · 24% Transfer learning and domain adaptation · 22%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d object detection
0.912025
MemDistill: Distilling LiDAR Knowledge into Memory for Camera-Only 3D Object Detection · ICCV 2025
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
cross-modal distillation
0.912025
MemDistill: Distilling LiDAR Knowledge into Memory for Camera-Only 3D Object Detection · ICCV 2025
Machine learning › Transfer learning and domain adaptation
domain generalization
0.912025
Decoupled Finetuning for Domain Generalizable Semantic Segmentation · ICLR 2025
Computer vision › 3D vision › 3d object detection
image-based 3d object detection
0.912025
MemDistill: Distilling LiDAR Knowledge into Memory for Camera-Only 3D Object Detection · ICCV 2025
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.912025
MemDistill: Distilling LiDAR Knowledge into Memory for Camera-Only 3D Object Detection · ICCV 2025
Computer vision › Segmentation and scene understanding
semantic segmentation
0.912025
Decoupled Finetuning for Domain Generalizable Semantic Segmentation · ICLR 2025
Machine learning › Efficient and distributed learning
dataset distillation
0.712023
Leveraging Proxy of Training Data for Test-Time Adaptation · ICML 2023
Machine learning › Transfer learning and domain adaptation
test-time adaptation
0.712023
Leveraging Proxy of Training Data for Test-Time Adaptation · ICML 2023
Computer vision › Segmentation and scene understanding › annotation-efficient segmentation
semi-supervised semantic segmentation
0.612022
Semi-supervised Semantic Segmentation with Error Localization Network · CVPR 2022

Methods — techniques the papers use, named apart from their topics

memory · 0.9knowledge distillation · 0.9exponential moving average · 0.9decoupled finetuning · 0.9LiDAR · 0.9test-time training · 0.7stylization · 0.7data condensation · 0.7error localization network · 0.6contrastive learning · 0.6
YearPublicationVenuePosition
2025 MemDistill: Distilling LiDAR Knowledge into Memory for Camera-Only 3D Object Detection
Donghyeon Kwon, Youngseok Yoon, Hyeongseok Son, Suha Kwak
ICCV1
2025 Decoupled Finetuning for Domain Generalizable Semantic Segmentation
abstract
Joint finetuning of a pretrained encoder and a randomly initialized decoder has been the de facto standard in semantic segmentation, but the vulnerability of this approach to domain shift has not been studied. We investigate the vulnerability issue of joint finetuning, and propose a novel finetuning framework called Decoupled FineTuning (DeFT) for domain generalization as a solution. DeFT operates in two stages. Its first stage warms up the decoder with the frozen, pretrained encoder so that the decoder learns task-relevant knowledge while the encoder preserves its generalizable features. In the second stage, it decouples finetuning of the encoder and decoder into two pathways, each of which concatenates an adaptive component (AC) and retentive component (RC); the encoder and decoder play different roles between AC and RC in different pathways. ACs are updated by gradients of the loss on the source domain, while RCs are updated by exponential moving average biased toward their initialization to retain their generalization capability. By the two separate optimization pathways with opposite AC-RC configurations, DeFT reduces the number of learnable parameters virtually, and decreases the distance between learned parameters and their initialization, leading to improved generalization capability. DeFT significantly outperformed existing methods in various domain shift scenarios, and its performance was further boosted by incorporating a simple distance regularization.
Jaehyun Pahk, Donghyeon Kwon, Seong Joon Oh, Suha Kwak
ICLR2
2025 Boosting Semi-Supervised Video Action Detection with Temporal Context
abstract
This paper studies semi-supervised learning of video action detection (VAD), which assumes that only a small portion of training videos are labeled and the others remain unlabeled. The existing semi-supervised methods for VAD mainly focus on leveraging spatial context of unlabeled video, lacking its exploration of temporal context. To resolve this, we present a novel semi-supervised learning framework that effectively incorporates spatio-temporal context during training. We first introduce a new augmentation strategy called temporal cross-view augmentation to achieve robust representation across clips depicting the same action but not aligned on the time axis. We also propose a new context fusion method called global-local context fusion that effectively utilizes the spatio-temporal context of videos to enhances the features of each frame by incorporating those of other frames within a clip; this method aids in actively leveraging spatio-temporal context of video, leading to significant performance improvement. Our framework was evaluated on UCF101–24 and JHMDB-21, where it outperformed all existing methods in every evaluation setting.
Donghyeon Kwon, Inho Kim, Suha Kwak
WACV1
2024 Self-supervised Learning of Semantic Correspondence Using Web Videos
abstract
Existing datasets for semantic correspondence are often limited in terms of both the amount of labeled data and diversity of labeled keypoints due to the tremendous cost of manual correspondence labeling. To address this issue, we propose the first self-supervised learning framework that utilizes a large amount of web videos collected and annotated fully automatically. Our main motivation is that smooth changes between consecutive video frames allow to build accurate space-time correspondences with no human intervention. Hence, we establish space-time correspondences within each web video and leverage them for deriving pseudo correspondence labels between two distant frames of the video. In addition, we present a dedicated training strategy that facilitates stable training using web videos with such pseudo labels. Our experiments on public benchmarks demonstrated that the proposed method surpasses existing self-supervised learning models and that our self-supervised learning as pretraining for supervised learning improves performance substantially. Our codebase for web video crawling and pseudo label generation will be released public to promote future research.
Donghyeon Kwon, Minsu Cho, Suha Kwak
WACV1
2023 Leveraging Proxy of Training Data for Test-Time Adaptation
abstract
We consider test-time adaptation (TTA), the task of adapting a trained model to an arbitrary test domain using unlabeled input data on-the-fly during testing. A common practice of TTA is to disregard data used in training due to large memory demand and privacy leakage. However, the training data are the only source of supervision. This motivates us to investigate a proper way of using them while minimizing the side effects. To this end, we propose two lightweight yet informative proxies of the training data and a TTA method fully exploiting them. One of the proxies is composed of a small number of images synthesized (hence, less privacy-sensitive) by data condensation which minimizes their domain-specificity to capture a general underlying structure over a wide spectrum of domains. Then, in TTA, they are translated into labeled test data by stylizing them to match styles of unlabeled test samples. This enables virtually supervised test-time training. The other proxy is inter-class relations of training data, which are transferred to target model during TTA. On four public benchmarks, our method outperforms the state-of-the-art ones at remarkably less computation and memory.
Juwon Kang, Nayeong Kim, Donghyeon Kwon, Jungseul Ok, Suha Kwak
ICML3
2022 Semi-supervised Semantic Segmentation with Error Localization Network
abstract
This paper studies semi-supervised learning of semantic segmentation, which assumes that only a small portion of training images are labeled and the others remain unlabeled. The unlabeled images are usually assigned pseudo labels to be used in training, which however often causes the risk of performance degradation due to the confirmation bias towards errors on the pseudo labels. We present a novel method that resolves this chronic issue of pseudo labeling. At the heart of our method lies error localization network (ELN), an auxiliary module that takes an image and its segmentation prediction as input and identifies pixels whose pseudo labels are likely to be wrong. ELN enables semi-supervised learning to be robust against inaccurate pseudo labels by disregarding label noises during training and can be naturally integrated with self-training and contrastive learning. Moreover, we introduce a new learning strategy for ELN that simulates plausible and diverse segmentation errors during training of ELN to enhance its generalization. Our method is evaluated on PASCAL VOC 2012 and Cityscapes, where it outperforms all existing methods in every evaluation setting.
Donghyeon Kwon, Suha Kwak
CVPR1