Demo Data from EDBT 2026 / reviewers in the wild / expert
Yunhong Min
dblp:23/8681 · also Yun-Hong Min
· DBLP profile ↗
6ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Computer networks · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 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 |
Generative modeling · 77% Probabilistic and Bayesian machine learning · 23% | |
| Computer graphics and multimedia
2 papers |
Visual content generation and editing · 54% Image and video processing · 46% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
sequential monte carlo |
0.9 | 1 | 2025 | Ψ-Sampler: Initial Particle Sampling for SMC-Based Inference-Time Reward Alignment in Score Models · NeurIPS 2025 |
Visual content generation and editing › image generation
controllable image generation |
0.9 | 1 | 2025 | ORIGEN: Zero-Shot 3D Orientation Grounding in Text-to-Image Generation · NeurIPS 2025 |
Visual content generation and editing › image generation
text-to-image generation |
0.9 | 1 | 2025 | ORIGEN: Zero-Shot 3D Orientation Grounding in Text-to-Image Generation · NeurIPS 2025 |
Machine learning › Generative modeling
generative adversarial network |
0.8 | 1 | 2024 | DAFT-GAN: Dual Affine Transformation Generative Adversarial Network for Text-Guided Image Inpainting · ACM Multimedia 2024 |
Machine learning › Generative modeling › diffusion model
text-to-image generation |
0.8 | 1 | 2024 | DAFT-GAN: Dual Affine Transformation Generative Adversarial Network for Text-Guided Image Inpainting · ACM Multimedia 2024 |
Image and video processing › image restoration
image inpainting |
0.8 | 1 | 2024 | DAFT-GAN: Dual Affine Transformation Generative Adversarial Network for Text-Guided Image Inpainting · ACM Multimedia 2024 |
Image and video processing › image restoration › image inpainting
text-guided image inpainting |
0.8 | 1 | 2024 | DAFT-GAN: Dual Affine Transformation Generative Adversarial Network for Text-Guided Image Inpainting · ACM Multimedia 2024 |
Machine learning › Generative modeling
diffusion model |
0.3 | 1 | 2025 | ORIGEN: Zero-Shot 3D Orientation Grounding in Text-to-Image Generation · NeurIPS 2025 |
Machine learning › Generative modeling
normalizing flow |
0.3 | 1 | 2025 | ORIGEN: Zero-Shot 3D Orientation Grounding in Text-to-Image Generation · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
reward-guided sampling · 1.7langevin dynamics · 1.7discriminative model · 1.7generative adversarial network · 1.5dual affine transformation · 1.5sequential monte carlo · 0.9particle sampling · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | ORIGEN: Zero-Shot 3D Orientation Grounding in Text-to-Image GenerationabstractWe introduce ORIGEN, the first zero-shot method for 3D orientation grounding in text-to-image generation across multiple objects and diverse categories. While previous work on spatial grounding in image generation has mainly focused on 2D positioning, it lacks control over 3D orientation.
To address this, we propose a reward-guided sampling approach using a pretrained discriminative model for 3D orientation estimation and a one-step text-to-image generative flow model. While gradient-ascent-based optimization is a natural choice for reward-based guidance, it struggles to maintain image realism. Instead, we adopt a sampling-based approach using Langevin dynamics, which extends gradient ascent by simply injecting random noise—requiring just a single additional line of code.
Additionally, we introduce adaptive time rescaling based on the reward function to accelerate convergence. Our experiments show that \textsc{Origen} outperforms both training-based and test-time guidance methods across quantitative metrics and user studies. Yunhong Min, Daehyeon Choi, Kyeongmin Yeo, Minhyuk Sung |
NeurIPS | 1 |
| 2025 | Ψ-Sampler: Initial Particle Sampling for SMC-Based Inference-Time Reward Alignment in Score Models
Taehoon Yoon, Yunhong Min, Kyeongmin Yeo, Minhyuk Sung |
NeurIPS | 2 |
| 2024 | DAFT-GAN: Dual Affine Transformation Generative Adversarial Network for Text-Guided Image Inpainting
Yunhong Min, Hwidong Kim, Sangtae Ahn |
ACM Multimedia | 2 |
| 2022 | A single machine scheduling with generalized and periodic due dates to minimize total deviation
Byung-Cheon Choi, Yunhong Min, Myoung-Ju Park |
Discret. Appl. Math. | 3 |
| 2011 | Dynamic execution planning for reliable collaborative business processes
Je Yeon Oh, Nam Wook Cho, Hoontae Kim, Yunhong Min, Suk-Ho Kang |
Inf. Sci. | 4 |
| 2011 | Approximation of a batch consolidation problemabstractAbstract In batch production systems, multiple items can be processed in the same batch if they share sufficiently similar production parameters. We consider the batch consolidation problem of minimizing the number of batches of a finite set of items. This article focuses on the case in which only one or two items can be processed in a single batch. The problem is NP ‐hard and cannot be approximated within 1.0021 of the optimum under the premise, P≠NP. However, the problem admits a ${{3}\over{2}}$ ‐approximation. The idea is to decompose the demands of items so that a maximum matching in the graph on the vertices of the decomposed demands provides a well‐consolidated batch set. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 58(1), 12–19 2011 Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yunhong Min, Myoung-Ju Park |
Networks | 4 |