Haemin Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haemin Kim has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Junyong Noh
Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea
4 shared publications - Seokhyeon Hong
Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea
2 shared publications - Vanessa Tan
Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea
2 shared publications - Junghyun Nam
Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea
1 shared publication - Kyungmin Cho
Anigma Technologies
1 shared publication - Soojin Choi
Visual Media Lab, KAIST
1 shared publication
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-17
Length-varying Neural Motion Stitching via Cluster Transition Graph
Motion stitching aims to create new character animations by seamlessly combining existing motion sequences. Existing approaches often require manual selection of transition range or assume fixed transition length, restricting the types of motions that can be connected. To broaden the diversity of motions that can be synthesized, it is essential to generate transitions of varying lengths, allowing the character sufficient time to adapt its pose when the input motions differ significantly. To this end, we propose a length-varying neural motion stitching method based on a cluster transition graph, which produces naturally connected motion sequences given two distinct input motions. Our framework consists of three stages: motion clustering, cluster pathfinding, and motion generation. First, motion clustering maps input motions to discrete clusters. Next, we identify the corresponding clusters in the cluster transition graph and search for a connecting path. In this graph, nodes represent motion clusters, and directed edges indicate valid transitions between them. The resulting path determines both the transition length and a guide sequence that informs motion generation. Finally, the path and input motions are provided to a Transformer encoder-based motion generator to produce the final transition poses. Experimental results demonstrate that our method adaptively adjusts the motion length and successfully generates plausible transitions between distinct motions, such as crawling, basketball shooting, and slow locomotion. We also show that using a graph structure effectively estimates transition durations and produces high-fidelity results compared to methods that assume a fixed transition length, or directly compute the time. Code is available at Project Page
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-17
Open AccessLength-varying Neural Motion Stitching via Cluster Transition Graph
Motion stitching aims to create new character animations by seamlessly combining existing motion sequences. Existing approaches often require manual selection of transition range or assume fixed transition length, restricting the types of motions that can be connected. To broaden the diversity of motions that can be synthesized, it is essential to generate transitions of varying lengths, allowing the character sufficient time to adapt its pose when the input motions differ significantly. To this end, we propose a length-varying neural motion stitching method based on a cluster transition graph, which produces naturally connected motion sequences given two distinct input motions. Our framework consists of three stages: motion clustering, cluster pathfinding, and motion generation. First, motion clustering maps input motions to discrete clusters. Next, we identify the corresponding clusters in the cluster transition graph and search for a connecting path. In this graph, nodes represent motion clusters, and directed edges indicate valid transitions between them. The resulting path determines both the transition length and a guide sequence that informs motion generation. Finally, the path and input motions are provided to a Transformer encoder-based motion generator to produce the final transition poses. Experimental results demonstrate that our method adaptively adjusts the motion length and successfully generates plausible transitions between distinct motions, such as crawling, basketball shooting, and slow locomotion. We also show that using a graph structure effectively estimates transition durations and produces high-fidelity results compared to methods that assume a fixed transition length, or directly compute the time. Code is available at Project Page
- Open Access
- 1 September 2026
- Published by Korea Computer Graphics Society in Journal of the Korea Computer Graphics Society
- Vol. 32 (4) , 1-12
ChoreoMamba: Long-Sequence Dance Generation with Bidirectional Mamba
사단법인 한국컴퓨터그래픽스학회의 논문지로서 그래픽스 분야와 그에 연관된 연구영역의 새로운 발견과 최첨단 연구결과를 발표하는 토론의 장입니다. 학회를 대표하는 학술지인 논문지는 1995년에 논문지 발간을 시작으로 2000년부터 3월, 6월, 9월, 12월 총 4회 발간되었고, 2015년부터는 KCGS 학술대회 특별호를 7월에 발간하면서 총 5회 발간되고 있습니다.
- 1 September 2026
- Published by Korea Computer Graphics Society in Journal of the Korea Computer Graphics Society
- Vol. 32 (4) , 1-12
Open AccessChoreoMamba: Long-Sequence Dance Generation with Bidirectional Mamba
사단법인 한국컴퓨터그래픽스학회의 논문지로서 그래픽스 분야와 그에 연관된 연구영역의 새로운 발견과 최첨단 연구결과를 발표하는 토론의 장입니다. 학회를 대표하는 학술지인 논문지는 1995년에 논문지 발간을 시작으로 2000년부터 3월, 6월, 9월, 12월 총 4회 발간되었고, 2015년부터는 KCGS 학술대회 특별호를 7월에 발간하면서 총 5회 발간되고 있습니다.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-3
PressureBlush: Real-Time Blanching and Hyperemia Shading from Neural Deformation Signals
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-3
Open AccessPressureBlush: Real-Time Blanching and Hyperemia Shading from Neural Deformation Signals
- 9 October 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (8)
Long‐term Motion In‐betweening via Keyframe Prediction
Motion in‐betweening has emerged as a promising approach to enhance the efficiency of motion creation due to its flexibility and time performance. However, previous in‐betweening methods are limited to generating short transitions due to growing pose ambiguity when the number of missing frames increases. This length‐related constraint makes the optimization hard and it further causes another constraint on the target pose, limiting the degrees of freedom for artists to use. In this paper, we introduce a keyframe‐driven approach that effectively solves the pose ambiguity problem, allowing robust in‐betweening performance on various lengths of missing frames. To incorporate keyframe‐driven motion synthesis, we introduce a keyframe score that measures the likelihood of a frame being used as a keyframe as well as an adaptive keyframe selection method that maintains appropriate temporal distances between resulting keyframes. Additionally, we employ phase manifolds to further resolve the pose ambiguity and incorporate trajectory conditions to guide the approximate movement of the character. Comprehensive evaluations, encompassing both quantitative and qualitative analyses, were conducted to compare our method with state‐of‐the‐art in‐betweening approaches across various transition lengths. The code for the paper is available at https://github.com/seokhyeonhong/long-mib
- 9 October 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (8)
Long‐term Motion In‐betweening via Keyframe Prediction
Motion in‐betweening has emerged as a promising approach to enhance the efficiency of motion creation due to its flexibility and time performance. However, previous in‐betweening methods are limited to generating short transitions due to growing pose ambiguity when the number of missing frames increases. This length‐related constraint makes the optimization hard and it further causes another constraint on the target pose, limiting the degrees of freedom for artists to use. In this paper, we introduce a keyframe‐driven approach that effectively solves the pose ambiguity problem, allowing robust in‐betweening performance on various lengths of missing frames. To incorporate keyframe‐driven motion synthesis, we introduce a keyframe score that measures the likelihood of a frame being used as a keyframe as well as an adaptive keyframe selection method that maintains appropriate temporal distances between resulting keyframes. Additionally, we employ phase manifolds to further resolve the pose ambiguity and incorporate trajectory conditions to guide the approximate movement of the character. Comprehensive evaluations, encompassing both quantitative and qualitative analyses, were conducted to compare our method with state‐of‐the‐art in‐betweening approaches across various transition lengths. The code for the paper is available at https://github.com/seokhyeonhong/long-mib