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.

Honggyu An

dblp:336/7259 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 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
3 papers
3D vision · 70% Representation and self-supervised learning · 11% Video understanding and tracking · 10%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
correspondence estimation
0.912025
Cross-View Completion Models are Zero-shot Correspondence Estimators · CVPR 2025
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › masked modeling
cross-view completion
0.912025
Cross-View Completion Models are Zero-shot Correspondence Estimators · CVPR 2025
Computer vision › 3D vision
depth estimation
0.912025
Cross-View Completion Models are Zero-shot Correspondence Estimators · CVPR 2025
Computer vision › 3D vision › depth estimation › video depth estimation
multi-frame depth estimation
0.912025
Cross-View Completion Models are Zero-shot Correspondence Estimators · CVPR 2025
Computer vision › 3D vision › feature matching
correspondence problem
0.812024
Local All-Pair Correspondence for Point Tracking · ECCV (10) 2024
Computer vision › Video understanding and tracking
feature tracking
0.812024
Local All-Pair Correspondence for Point Tracking · ECCV (10) 2024
Machine learning › Efficient and distributed learning › adaptive computation
adaptive depth network
0.712023
DäRF: Boosting Radiance Fields from Sparse Input Views with Monocular Depth Adaptation · NeurIPS 2023
Computer vision › 3D vision › depth estimation
monocular depth estimation
0.712023
DäRF: Boosting Radiance Fields from Sparse Input Views with Monocular Depth Adaptation · NeurIPS 2023
Computer vision › 3D vision
neural radiance field
0.712023
DäRF: Boosting Radiance Fields from Sparse Input Views with Monocular Depth Adaptation · NeurIPS 2023
Computer vision › 3D vision › 3d reconstruction › multi-view reconstruction
sparse-view reconstruction
0.712023
DäRF: Boosting Radiance Fields from Sparse Input Views with Monocular Depth Adaptation · NeurIPS 2023

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

geometric matching · 0.9cross-attention map · 0.9scale-shift fitting · 0.7geometry distillation · 0.7
YearPublicationVenuePosition
2025 Cross-View Completion Models are Zero-shot Correspondence Estimators
abstract
In this work, we explore new perspectives on crossview completion learning by drawing an analogy to self-supervised correspondence learning. Through our analysis, we demonstrate that the cross-attention map within crossview completion models captures correspondence more effectively than other correlations derived from encoder or decoder features. We verify the effectiveness of the cross-attention map by evaluating on both zero-shot matching and learning-based geometric matching and multi-frame depth estimation.
Honggyu An, Jin Hyeon Kim, Seonghoon Park 0002, Jaewoo Jung, Jisang Han, Sunghwan Hong, Seungryong Kim
CVPR1
2025 Enhancing 3D Reconstruction for Dynamic Scenes
abstract
In this work, we address the task of 3D reconstruction in dynamic scenes, where object motions frequently degrade the quality of previous 3D pointmap regression methods, such as DUSt3R, that are originally designed for static 3D scene reconstruction. Although these methods provide an elegant and powerful solution in static settings, they struggle in the presence of dynamic motions that disrupt alignment based solely on camera poses. To overcome this, we propose D$^2$USt3R that directly regresses Static-Dynamic Aligned Pointmaps (SDAP) that simultaneiously capture both static and dynamic 3D scene geometry. By explicitly incorporating both spatial and temporal aspects, our approach successfully encapsulates 3D dense correspondence to the proposed pointmaps, enhancing downstream tasks. Extensive experimental evaluations demonstrate that our proposed approach consistently achieves superior 3D reconstruction performance across various datasets featuring complex motions.
Jisang Han, Honggyu An, Jaewoo Jung, Takuya Narihira, Junyoung Seo, Kazumi Fukuda, Chaehyun Kim, Sunghwan Hong, Yuki Mitsufuji, Seungryong Kim
NeurIPS2
2024 Local All-Pair Correspondence for Point Tracking
Seokju Cho, Jisu Nam, Honggyu An, Seungryong Kim, Joon-Young Lee
ECCV (10)4
2024 MaskingDepth: Masked Consistency Regularization for Semi-Supervised Monocular Depth Estimation
abstract
We propose MaskingDepth, a semi-supervised learning framework for monocular depth estimation. MaskingDepth is designed to enforce consistency between the depths obtained from strongly-augmented images and the pseudo-depths derived from weakly-augmented images, which enables mitigating the reliance on large ground-truth depth quantities. In this framework, we leverage uncertainty estimation to only retain high-confident depth predictions from the weakly-augmented branch as pseudo-depths. We also present a novel data augmentation, dubbed K-way disjoint masking, that takes advantage of a naïve token masking strategy as an augmentation, while avoiding its scale ambiguity problem between depths from weakly-and strongly-augmented branches and risk of missing small-scale objects. Experiments on KITTI and NYU-Depth-v2 datasets demonstrate the effectiveness of each component, its robustness to the use of fewer depth-annotated images, and superior performance compared to other state-of-the-art semi-supervised learning methods for monocular depth estimation.
Jong-Beom Baek, Gyeongnyeon Kim, Seonghoon Park 0002, Honggyu An, Matteo Poggi, Seungryong Kim
IROS4
2023 DäRF: Boosting Radiance Fields from Sparse Input Views with Monocular Depth Adaptation
abstract
Neural radiance field (NeRF) shows powerful performance in novel view synthesis and 3D geometry reconstruction, but it suffers from critical performance degradation when the number of known viewpoints is drastically reduced. Existing works attempt to overcome this problem by employing external priors, but their success is limited to certain types of scenes or datasets. Employing monocular depth estimation (MDE) networks, pretrained on large-scale RGB-D datasets, with powerful generalization capability may be a key to solving this problem: however, using MDE in conjunction with NeRF comes with a new set of challenges due to various ambiguity problems exhibited by monocular depths. In this light, we propose a novel framework, dubbed DäRF, that achieves robust NeRF reconstruction with a handful of real-world images by combining the strengths of NeRF and monocular depth estimation through online complementary training. Our framework imposes the MDE network's powerful geometry prior to NeRF representation at both seen and unseen viewpoints to enhance its robustness and coherence. In addition, we overcome the ambiguity problems of monocular depths through patch-wise scale-shift fitting and geometry distillation, which adapts the MDE network to produce depths aligned accurately with NeRF geometry. Experiments show our framework achieves state-of-the-art results both quantitatively and qualitatively, demonstrating consistent and reliable performance in both indoor and outdoor real-world datasets.
Jiuhn Song, Seonghoon Park 0002, Honggyu An, Seokju Cho, Minseop Kwak, Sungjin Cho, Seungryong Kim
NeurIPS3