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

Hyeseong Kim

dblp:285/1115 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2025
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 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
1 paper
3D vision · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 50% Hardware accelerators and domain-specific architectures · 50%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
medical image reconstruction
0.912025
AeSPa : Attention-guided Self-supervised Parallel Imaging for MRI Reconstruction · CVPR 2025
Computer vision › 3D vision › medical image reconstruction
MRI reconstruction
0.912025
AeSPa : Attention-guided Self-supervised Parallel Imaging for MRI Reconstruction · CVPR 2025
Storage systems › computational storage
in-storage computing
0.812024
PreSto: An In-Storage Data Preprocessing System for Training Recommendation Models · ISCA 2024
Hardware accelerators and domain-specific architectures › machine learning accelerator › DNN training accelerator
recommendation model training accelerator
0.812024
PreSto: An In-Storage Data Preprocessing System for Training Recommendation Models · ISCA 2024
Machine learning and data management › data management for machine learning
data preparation for machine learning
0.212024
PreSto: An In-Storage Data Preprocessing System for Training Recommendation Models · ISCA 2024

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

in-storage processing · 1.5feature normalization · 1.5feature generation · 1.5zero-shot learning · 0.9sensitivity map estimation · 0.9self-supervised learning · 0.9attention mechanism · 0.9
YearPublicationVenuePosition
2025 AeSPa : Attention-guided Self-supervised Parallel Imaging for MRI Reconstruction
abstract
This study introduces a novel zero-shot scan-specific self-supervised reconstruction method for magnetic resonance imaging (MRI) to reduce scan times. Conventional supervised reconstruction methods require large amounts of fully-sampled reference data, which is often impractical to obtain and can lead to artifacts by overly emphasizing learned patterns. Existing zero-shot scan-specific methods have attempted to overcome this data dependency but show limited performance due to insufficient utilization of k-space information and constraints derived from MRI forward model. To address these limitations, we introduce a framework utilizing all acquired k-space measurements for both network inputs and training targets. While this framework suffers from training instability, we resolve these challenges through three key components: an Attention-guided K-space Selective Mechanism (AKSM) that provides indirect constraints for non-sampled k-space points, Iteration-wise K-space Masking (IKM) that enhances training stability, and a robust sensitivity map estimation model utilizing cross-channel constraint that performs effectively even at high reduction factors. Experimental results on the FastMRI knee and brain datasets with reduction factors of 4 and 8 demonstrate that the proposed method achieves superior reconstruction quality and faster convergence compared to existing zero-shot scan-specific methods, making it suitable for practical clinical applications. The implementation of our proposed method is publicly available at https://github.com/joojinho97/AeSPa.git.
Jinho Joo, Hyeseong Kim, Hyeyeon Won, Deukhee Lee, Taejoon Eo, Dosik Hwang
CVPR2
2024 PreSto: An In-Storage Data Preprocessing System for Training Recommendation Models
abstract
Training recommendation systems (RecSys) faces several challenges as it requires the “data preprocessing” stage to preprocess an ample amount of raw data and feed them to the GPU for training in a seamless manner. To sustain high training throughput, state-of-the-art solutions reserve a large fleet of CPU servers for preprocessing which incurs substantial deployment cost and power consumption. Our characterization reveals that prior CPU-centric preprocessing is bottlenecked on feature generation and feature normalization operations as it fails to reap out the abundant inter-/intra-feature parallelism in RecSys preprocessing. PreSto is a storage-centric preprocessing system leveraging In-Storage Processing (ISP), which offloads the bottlenecked preprocessing operations to our ISP units. We show that PreSto outperforms the baseline CPU-centric system with a 9.6× speedup in end-to-end preprocessing time, 4.3× enhancement in cost-efficiency, and 11.3× improvement in energy-efficiency on average for production-scale RecSys preprocessing.
Yunjae Lee, Hyeseong Kim, Minsoo Rhu
ISCA2
2022 Adversarial attack can help visual tracking
Sungmin Cho, Hyeseong Kim, Ji Soo Kim, Hyomin Kim, Junseok Kwon
Multim. Tools Appl.2
2021 Filter Pruning Via Softmax Attention
abstract
In this paper, we propose a novel network pruning method using the proposed relative depth-wise separable convolutions and softmax attention channel pruning. The relative depthwise separable convolution enhances conventional depth-wise separable convolutions by enabling the channel interaction, which can prevent accuracy drops even after severe pruning. The softmax attention channel pruning probabilistically expresses the importance of filters and removes unimportant channels efficiently. Experimental results demonstrate that our pruning method outperforms other state-of-the-art pruning methods in terms of Flops, parameters, and top-1 classification accuracy.
Sungmin Cho, Hyeseong Kim, Junseok Kwon
ICIP2