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

Sanghyeok Chu

dblp:305/3649 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
—ORCID · none

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 · 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
Vision and language · 30% Segmentation and scene understanding · 23% Deep learning architectures and training · 20%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language
video captioning
0.912025
Fine-Grained Captioning of Long Videos through Scene Graph Consolidation · ICML 2025
Knowledge graphs
scene graph
0.912025
Fine-Grained Captioning of Long Videos through Scene Graph Consolidation · ICML 2025
Computer vision › Segmentation and scene understanding
semantic segmentation
0.722022
Learning Debiased and Disentangled Representations for Semantic Segmentation · NeurIPS 2021
Pooling Revisited: Your Receptive Field is Suboptimal · CVPR 2022
Machine learning › Deep learning architectures and training › convolutional neural network
convolutional neural network architecture
0.612022
Pooling Revisited: Your Receptive Field is Suboptimal · CVPR 2022
Machine learning › Trustworthy machine learning › debiasing
debiased representation learning
0.512021
Learning Debiased and Disentangled Representations for Semantic Segmentation · NeurIPS 2021
Computer vision › Image recognition and object detection
image classification
0.212022
Pooling Revisited: Your Receptive Field is Suboptimal · CVPR 2022
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.112021
Learning Debiased and Disentangled Representations for Semantic Segmentation · NeurIPS 2021

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

scene graph consolidation · 1.7graph-to-text decoding · 1.7loss regularization · 0.6end-to-end learning · 0.6stochastic training · 0.5feature selection · 0.5
YearPublicationVenuePosition
2025 Fine-Grained Captioning of Long Videos through Scene Graph Consolidation
abstract
Recent advances in vision-language models have led to impressive progress in caption generation for images and short video clips. However, these models remain constrained by their limited temporal receptive fields, making it difficult to produce coherent and comprehensive captions for long videos. While several methods have been proposed to aggregate information across video segments, they often rely on supervised fine-tuning or incur significant computational overhead. To address these challenges, we introduce a novel framework for long video captioning based on graph consolidation. Our approach first generates segment-level captions, corresponding to individual frames or short video intervals, using off-the-shelf visual captioning models. These captions are then parsed into individual scene graphs, which are subsequently consolidated into a unified graph representation that preserves both holistic context and fine-grained details throughout the video. A lightweight graph-to-text decoder then produces the final video-level caption. This framework effectively extends the temporal understanding capabilities of existing models without requiring any additional fine-tuning on long video datasets. Experimental results show that our method significantly outperforms existing LLM-based consolidation approaches, achieving strong zero-shot performance while substantially reducing computational costs.
Sanghyeok Chu, Seonguk Seo, Bohyung Han
ICML1
2022 Pooling Revisited: Your Receptive Field is Suboptimal
abstract
The size and shape of the receptive field determine how the network aggregates local features, and affect the overall performance of a model considerably. Many components in a neural network, such as depth, kernel sizes, and strides for convolution and pooling, influence the receptive field. However, they still rely on hyperparameters, and the receptive fields of existing models result in suboptimal shapes and sizes. Hence, we propose a simple yet effective Dynamically Optimized Pooling operation, referred to as DynOPool, which learns the optimized scale factors offeature maps end-to-end. Moreover, DynOPool determines the proper resolution of a feature map by learning the desirable size and shape of its receptive field, which allows an operator in a deeper layer to observe an input image in the optimal scale. Any kind of resizing modules in a deep neural network can be replaced by DynOPool with minimal cost. Also, DynOPool controls the complexity of the model by introducing an additional loss term that constrains computational cost. Our experiments show that the models equipped with the proposed learnable resizing module outperform the baseline algorithms on multiple datasets in image classification and semantic segmentation.
Dong-Hwan Jang, Sanghyeok Chu, Joonhyuk Kim, Bohyung Han
CVPR2
2022 Beyond homography: nonparametric image alignment via graph convolutional networks
Mijeong Kim 0002, Sanghyeok Chu, Bohyung Han
Mach. Vis. Appl.2
2021 Learning Debiased and Disentangled Representations for Semantic Segmentation
abstract
Deep neural networks are susceptible to learn biased models with entangled feature representations, which may lead to subpar performances on various downstream tasks. This is particularly true for under-represented classes, where a lack of diversity in the data exacerbates the tendency. This limitation has been addressed mostly in classification tasks, but there is little study on additional challenges that may appear in more complex dense prediction problems including semantic segmentation. To this end, we propose a model-agnostic and stochastic training scheme for semantic segmentation, which facilitates the learning of debiased and disentangled representations. For each class, we first extract class-specific information from the highly entangled feature map. Then, information related to a randomly sampled class is suppressed by a feature selection process in the feature space. By randomly eliminating certain class information in each training iteration, we effectively reduce feature dependencies among classes, and the model is able to learn more debiased and disentangled feature representations. Models trained with our approach demonstrate strong results on multiple semantic segmentation benchmarks, with especially notable performance gains on under-represented classes.
Sanghyeok Chu, Dongwan Kim, Bohyung Han
NeurIPS1