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

Minji Park

dblp:80/8869 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
3since 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 · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1Security and privacy · 1 · 1 since 2021Human-computer interaction and ubiquitous 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.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 57% Malware analysis · 43%
Human-computer interaction and pervasive computing
1 paper
Accessibility and assistive technology · 100%
Artificial intelligence
1 paper
Segmentation and scene understanding · 100%
Computer graphics and multimedia
1 paper
Computer animation and physical simulation · 100%

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

TopicWeightPapersLastEvidence papers
Malware analysis
malware classification
0.912025
MalCL: Leveraging GAN-Based Generative Replay to Combat Catastrophic Forgetting in Malware Classification · AAAI 2025
Accessibility and assistive technology › assistive technology for visual impairment
low vision assistance
0.812024
CookAR: Affordance Augmentations in Wearable AR to Support Kitchen Tool Interactions for People with Low Vision · UIST 2024
Cryptographic primitives and cryptanalysis › homomorphic encryption › bootstrapping
CKKS bootstrapping
0.612022
EvalRound Algorithm in CKKS Bootstrapping · ASIACRYPT (2) 2022
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.612022
EvalRound Algorithm in CKKS Bootstrapping · ASIACRYPT (2) 2022
Computer vision › Segmentation and scene understanding › object segmentation
affordance segmentation
0.212024
CookAR: Affordance Augmentations in Wearable AR to Support Kitchen Tool Interactions for People with Low Vision · UIST 2024
Computer animation and physical simulation
crowd simulation
0.112010
Morphable crowds · ACM Trans. Graph. 2010

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

egocentric dataset · 1.5computer vision · 1.5affordance segmentation model · 1.5generative replay · 0.9generative adversarial network · 0.9feature matching loss · 0.9spatio-temporal blending · 0.1motion interpolation · 0.1
YearPublicationVenuePosition
2025 MalCL: Leveraging GAN-Based Generative Replay to Combat Catastrophic Forgetting in Malware Classification
abstract
Continual Learning (CL) for malware classification tackles the rapidly evolving nature of malware threats and the frequent emergence of new types. Generative Replay (GR)-based CL systems utilize a generative model to produce synthetic versions of past data, which are then combined with new data to retrain the primary model. Traditional machine learning techniques in this domain often struggle with catastrophic forgetting, where a model's performance on old data degrades over time. In this paper, we introduce a GR-based CL system that employs Generative Adversarial Networks (GANs) with feature matching loss to generate high-quality malware samples. Additionally, we implement innovative selection schemes for replay samples based on the model’s hidden representations. Our comprehensive evaluation across Windows and Android malware datasets in a class-incremental learning scenario -- where new classes are introduced continuously over multiple tasks -- demonstrates substantial performance improvements over previous methods. For example, our system achieves an average accuracy of 55% on Windows malware samples, significantly outperforming other GR-based models by 28%. This study provides practical insights for advancing GR-based malware classification systems.
AHyun Ji, Minji Park, Mohammad Saidur Rahman 0002, Se Eun Oh
AAAI3
2024 CookAR: Affordance Augmentations in Wearable AR to Support Kitchen Tool Interactions for People with Low Vision
abstract
Cooking is a central activity of daily living, supporting independence as well as mental and physical health. However, prior work has highlighted key barriers for people with low vision (LV) to cook, particularly around safely interacting with tools, such as sharp knives or hot pans. Drawing on recent advancements in computer vision (CV), we present CookAR, a head-mounted AR system with real-time object affordance augmentations to support safe and efficient interactions with kitchen tools. To design and implement CookAR, we collected and annotated the first egocentric dataset of kitchen tool affordances, fine-tuned an affordance segmentation model, and developed an AR system with a stereo camera to generate visual augmentations. To validate CookAR, we conducted a technical evaluation of our fine-tuned model as well as a qualitative lab study with 10 LV participants for suitable augmentation design. Our technical evaluation demonstrates that our model outperforms the baseline on our tool affordance dataset, while our user study indicates a preference for affordance augmentations over the traditional whole object augmentations.
Jaewook Lee 0005, Andrew D. Tjahjadi, Junpu Yu, Minji Park, Jon Froehlich, Yapeng Tian, Yuhang Zhao 0001
UIST5
2022 EvalRound Algorithm in CKKS Bootstrapping
Seonghak Kim, Minji Park, Jaehyung Kim 0002, Chohong Min
ASIACRYPT (2)2
2019 Intelligent Driver Emotion Monitoring Based on Lightweight Multilayer Random Forests
abstract
In this paper, we propose a lightweight multi-layer random forest (LMRF) model. The LMRF model is a non-neural network-style deep model composed of arbitrary forests rather than layers. DNN is a powerful algorithm for facial recognition (FER), but there are too many parameters, careful parameter tuning, large amounts of training data, black box models, and pretrained architecture required for a current DNN. To overcome the burden of real-time processing DNN, we use the proposed LMRF with two tree structures per layer and a small number of trees for high-speed FER. We conducted experiments using an actual driving database captured using a near-infrared (NIR) camera to monitor the driver's emotions. The proposed LMRF provides similar FER accuracy to DNN with a small number of hyperparameters, and the faster processing time using the CPU.
Mira Jeong, Minji Park, ByoungChul Ko
INDIN2
2010 Morphable crowds
abstract
Crowd simulation has been an important research field due to its diverse range of applications that include film production, military simulation, and urban planning. A challenging problem is to provide simple yet effective control over captured and simulated crowds to synthesize intended group motions. We present a new method that blends existing crowd data to generate a new crowd animation. The new animation can include an arbitrary number of agents, extends for an arbitrary duration, and yields a natural-looking mixture of the input crowd data. The main benefit of this approach is to create new spatio-temporal crowd behavior in an intuitive and predictable manner. It is accomplished by introducing a morphable crowd model that allows us to encode the formations and individual trajectories in crowd data. Then, its original spatio-temporal behavior can be reconstructed and interpolated at an arbitrary scale using our morphable model.
Eunjung Ju, Myung Geol Choi, Minji Park, Jehee Lee, Kang Hoon Lee, Shigeo Takahashi
ACM Trans. Graph.3