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

Seungjun Oh

dblp:298/3431 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
8since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 7 · 1 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Computer graphics and multimedia
2 papers
Rendering · 52% Geometric modeling and processing · 32% Image and video coding · 16%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Artificial intelligence
2 papers
Reinforcement learning · 77% 3D vision · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.912025
Graph-Assisted Stitching for Offline Hierarchical Reinforcement Learning · ICML 2025
Rendering › gaussian splatting
3d gaussian splatting
0.912025
Generative Densification: Learning to Densify Gaussians for High-Fidelity Generalizable 3D Reconstruction · CVPR 2025
Geometric modeling and processing
3d reconstruction
0.912025
Generative Densification: Learning to Densify Gaussians for High-Fidelity Generalizable 3D Reconstruction · CVPR 2025
Rendering
neural radiance fields
0.912025
CodecNeRF: Toward Fast Encoding and Decoding, Compact, and High-quality Novel-view Synthesis · AAAI 2025
Image and video coding › 3d scene compression
neural radiance field compression
0.912025
CodecNeRF: Toward Fast Encoding and Decoding, Compact, and High-quality Novel-view Synthesis · AAAI 2025
Rendering
neural rendering
0.912025
Generative Densification: Learning to Densify Gaussians for High-Fidelity Generalizable 3D Reconstruction · CVPR 2025
Geometric modeling and processing › 3d reconstruction › multi-view reconstruction
sparse-view 3d reconstruction
0.912025
Generative Densification: Learning to Densify Gaussians for High-Fidelity Generalizable 3D Reconstruction · CVPR 2025
Graph algorithms and graph theory › graph algorithms
graph search
0.912025
Graph-Assisted Stitching for Offline Hierarchical Reinforcement Learning · ICML 2025
Graph algorithms and graph theory
shortest path
0.912025
Graph-Assisted Stitching for Offline Hierarchical Reinforcement Learning · ICML 2025
Computer vision › 3D vision › 3d reconstruction › learning-based 3d reconstruction
feed-forward reconstruction
0.312025
Generative Densification: Learning to Densify Gaussians for High-Fidelity Generalizable 3D Reconstruction · CVPR 2025
Rendering
novel view synthesis
0.312025
CodecNeRF: Toward Fast Encoding and Decoding, Compact, and High-quality Novel-view Synthesis · AAAI 2025

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

temporal distance representation · 1.7graph clustering · 1.7generative densification · 1.7gaussian upsampling · 1.7feature upsampling · 1.7parameter-efficient fine-tuning · 0.9encoder-decoder architecture · 0.9
YearPublicationVenuePosition
2025 CodecNeRF: Toward Fast Encoding and Decoding, Compact, and High-quality Novel-view Synthesis
abstract
Neural Radiance Fields (NeRF) have achieved huge success in effectively capturing and representing 3D objects and scenes. However, to establish an ubiquitous presence in everyday media formats, such as images and videos, we need to fulfill three key objectives: 1. fast encoding and decoding time, 2. compact model sizes, and 3. high-quality renderings. Despite recent advancements, a comprehensive algorithm that adequately addresses all objectives has yet to be fully realized. In this work, we present CodecNeRF, a neural codec for NeRF representations, consisting of an encoder and decoder architecture that can generate a NeRF representation in a single forward pass. Furthermore, inspired by the recent parameter-efficient finetuning approaches, we propose a finetuning method to efficiently adapt the generated NeRF representations to a new test instance, leading to high-quality image renderings and compact code sizes. The proposed CodecNeRF, a newly suggested encoding-decoding-finetuning pipeline for NeRF, achieved unprecedented compression performance of more than 100x and a remarkable reduction in encoding time while maintaining (or improving) the image quality on widely used 3D object datasets.
Gyeongjin Kang, Younggeun Lee, Seungjun Oh, Eunbyung Park
AAAI3
2025 Temporal Distance-aware Subgoal Generation for Offline Hierarchical Reinforcement Learning
Taegeon Park, Seungho Baek, Seungjun Oh, Yusung Kim 0001
CIKM4
2025 Generative Densification: Learning to Densify Gaussians for High-Fidelity Generalizable 3D Reconstruction
abstract
Generalized feed-forward Gaussian models have made significant strides in sparse-view 3D reconstruction by leveraging prior knowledge from large multi-view datasets. However, these models often struggle to represent high-frequency details primarily due to the limited number of Gaussians. While the densification strategy from per-scene 3D Gaussian splatting can be adapted for feed-forward models, it typically requires tens of thousands of optimization steps to reconstruct fine details and can easily lead to overfitting in sparse-view scenarios. In this paper, we propose Generative Densification, an efficient and generalizable densification strategy specifically tailored for feedforward models. Instead of iteratively splitting and cloning raw Gaussian parameters, our method up-samples feature representations produced by feed-forward models and generates their corresponding fine Gaussians in a single forward pass, leveraging learned prior knowledge for enhanced generalization. Experimental results on both object-level and scene-level reconstruction tasks demonstrate that our method outperforms state-of-the-art approaches with comparable or smaller model sizes, achieving notable improvements in representing fine details.
Seungtae Nam, Gyeongjin Kang, Younggeun Lee, Seungjun Oh, Eunbyung Park
CVPR5
2025 Graph-Assisted Stitching for Offline Hierarchical Reinforcement Learning
abstract
Existing offline hierarchical reinforcement learning methods rely on high-level policy learning to generate subgoal sequences. However, their efficiency degrades as task horizons increase, and they lack effective strategies for stitching useful state transitions across different trajectories. We propose Graph-Assisted Stitching (GAS), a novel framework that formulates subgoal selection as a graph search problem rather than learning an explicit high-level policy. By embedding states into a Temporal Distance Representation (TDR) space, GAS clusters semantically similar states from different trajectories into unified graph nodes, enabling efficient transition stitching. A shortest-path algorithm is then applied to select subgoal sequences within the graph, while a low-level policy learns to reach the subgoals. To improve graph quality, we introduce the Temporal Efficiency (TE) metric, which filters out noisy or inefficient transition states, significantly enhancing task performance. GAS outperforms prior offline HRL methods across locomotion, navigation, and manipulation tasks. Notably, in the most stitching-critical task, it achieves a score of 88.3, dramatically surpassing the previous state-of-the-art score of 1.0. Our source code is available at: https://github.com/qortmdgh4141/GAS.
Seungho Baek, Tae-Geon Park, Seungjun Oh, Yusung Kim 0001
ICML4
2025 Self-supervised risk factor model using dual Recurrent State Space Models
Seungjun Oh, Da-Hea Kim, Yusung Kim 0001
Knowl. Based Syst.2
2024 Parameter-Efficient Instance-Adaptive Neural Video Compression
Seungjun Oh, Hyunmo Yang, Eunbyung Park
ACCV (3)1
2024 Novelty-aware Graph Traversal and Expansion for Hierarchical Reinforcement Learning
abstract
Hierarchical Reinforcement Learning (HRL) is specially designed for environments characterized by long-term goals and sparse rewards. High-level policies in HRL learn to generate appropriate subgoals aimed at accomplishing the final goal, while low-level policies focus on achieving these designated subgoals. Recently, graph-based HRL algorithms have demonstrated enhanced learning capabilities through the structural representation of state spaces as graphs. However, existing graph-based HRL methods still often generate inefficient subgoals. This paper introduces a new method, Novelty-aware Graph Traversal and Expansion (NGTE), which selects an optimal node at the graph boundary, termed an Outpost Subgoal, as a direct path toward the final goal. Once the Outpost Subgoal is reached, NGTE transitions into an exploration phase, offering exploration subgoals within a reachable distance to efficiently expand the graph. Demonstrated in complex environments such as quadruped robot navigation and robotic arm manipulation, NGTE consistently outperforms existing graph and non-graph HRL methods, showing outstanding performance, especially in the most challenging scenarios with fixed start and fixed goal conditions.
Seungjun Oh, Yusung Kim 0001
CIKM2
2024 Toward Human-Scale Magnetic Particle Imaging: Development of the First System With Superconductor- Based Selection Coils
abstract
Magnetic Particle Imaging (MPI) is an emerging tomographic modality that allows for precise three-dimensional (3D) mapping of magnetic nanoparticles (MNPs) concentration and distribution. Although significant progress has been made towards improving MPI since its introduction, scaling it up for human applications has proven challenging. High-quality images have been obtained in animal-scale MPI scanners with gradients up to 7 T/m/ , however, for MPI systems with bore diameters around 200 mm the gradients generated by electromagnets drop significantly to below 0.5 T/m/ . Given the current technological limitations in image reconstruction and the properties of available MNPs, these low gradients inherently impose limitations on improving MPI resolution for higher precision medical imaging. Utilizing superconductors stands out as a promising approach for developing a human-scale MPI system. In this study, we introduce, for the first time, a human-scale amplitude modulation (AM) MPI system with superconductor-based selection coils. The system achieves an unprecedented magnetic field gradient of up to 2.5 T/m/ within a 200 mm bore diameter, enabling large fields of view of mm3 at 2.5 T/m/ for 3D imaging. While obtained spatial resolution is in the order of previous animal-scale AM MPIs, incorporating superconductors for achieving such high gradients in a 200 mm bore diameter marks a major step toward clinical MPI.
Bui Minh Phu, Yaser Hadadian, Khaled Mohamed Gadelmowla, Seungjun Oh, Chaemin Im, Seungyong Hahn, Jungwon Yoon 0001
IEEE Trans. Medical Imaging5