Geunseop Lee

Dr. Geunseop Lee

Hankuk University of Foreign Studies

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 December 2019 in Remote Sensing
Verified
Journal Article
Open access
PDF file
GLGeunseop Lee
Geunseop Lee
Hyperspectral imaging is widely used to many applications as it includes both spatial and spectral distributions of a target scene. However, a compression, or a low multilinear rank approximation of hyperspectral imaging data, is required owing to the difficult manipulation of the massive amount of data. In this paper, we propose an efficient algorithm for higher order singular value decomposition that enables the decomposition of a tensor into a compressed tensor multiplied by orthogonal factor matrices. Specifically, we sequentially compute low rank factor matrices from the Tucker-1 model optimization problems via an alternating least squares approach. Experiments with real world hyperspectral imaging revealed that the proposed algorithm could compute the compressed tensor with a higher computational speed, but with no significant difference in accuracy of compression compared to the other tensor decomposition-based compression algorithms.

25 February 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
JKJoseph Kang
Joseph Kang
AHAdam Christopher Hall
Adam Christopher Hall
GLGeunseop Lee
Geunseop Lee
This paper addresses the challenge of estimating language minority populations for compliance with the U.S. Voting Rights Act (VRA). Current methodologies, which rely on frequentist and Bayesian models developed by the U.S. Census Bureau, are benchmarked against a novel machine learning approach. We use a random forest (RF) model that significantly improves population size estimates for language minority groups. Our key contribution is the development of a modified RF objective function, a beta–binomial distribution, which is specifically tailored to the unique structure of the VRA data. This approach leverages the flexibility of the RF framework to accommodate the VRA data in a statistically principled manner. The resulting RF method demonstrates superior performance on several language minority groups compared to the established 2021 Census Bureau models.

12 August 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
GLGeunseop Lee
Geunseop Lee
The matrix completion problem aims to recover missing entries in a partially observed matrix by approximating it with a low-rank structure. The two common approaches—the singular value thresholding and matrix factorization with alternating least squares—often become prohibitively expensive for large matrices or when rigorous accuracy is demanded. To address these issues, we propose a rank-restricted hierarchical alternating least squares with orthogonality and sparsity constraints, which includes a novel shrinkage function. Specifically, for faster execution speed, truncated factor matrices are updated to restrict the costly shrinkage step as well as boundary-condition heuristics. Experiments on image completion and recommender systems show that the proposed method converges with extremely fast execution speed while achieving comparable or superior reconstruction accuracy relative to state-of-the-art matrix completion methods. For example, in the image completion problem, the proposed algorithm produced outputs approximately 15 times faster on average than the most accurate reference algorithm, while achieving 98% of its accuracy.

21 July 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
GLGeunseop Lee
Geunseop Lee
In this paper, we aim to develop an efficient algorithm for the solving Tensor Robust Principal Component Analysis (TRPCA) problem, which focuses on obtaining a low-rank approximation of a tensor by separating sparse and impulse noise. A common approach is to minimize the convex surrogate of the tensor rank by shrinking its singular values. Due to the existence of various definitions of tensor ranks and their corresponding convex surrogates, numerous studies have explored optimal solutions under different formulations. However, many of these approaches suffer from computational inefficiency primarily due to the repeated use of tensor singular value decomposition in each iteration. To address this issue, we propose a novel TRPCA algorithm that introduces a new convex relaxation for the tensor norm and computes low-rank approximation more efficiently. Specifically, we adopt the tensor average rank and tensor nuclear norm, and further relax the tensor nuclear norm into a sum of the tensor Frobenius norms of the factor tensors. By alternating updates of the truncated factor tensors, our algorithm achieves efficient use of computational resources. Experimental results demonstrate that our algorithm achieves significantly faster performance than existing reference methods known for efficient computation while maintaining high accuracy in recovering low-rank tensors for applications such as color image recovery and background subtraction.

5 September 2026 in Scientific Reports
Verified
Journal Article
Open access
PDF file
GLGeunseop Lee
Geunseop Lee
Recommender systems deliver personalized item suggestions to users by predicting their likelihood of purchase action for specific items. One of the most challenging issues in recommender systems is rating sparsity, which occurs due to users’ insufficient initial information on preferences. To address this issue, we propose a novel algorithm that dynamically integrates the neighborhood-based method with matrix completion, effectively improving prediction accuracy even under severe data sparsity. Specifically, we identify top-N neighbors using cosine similarity to enhance prediction accuracy during the iterative completion of the rating matrix. Furthermore, traditional matrix completion algorithms often suffer from high computational latency when scaling to large datasets or handling frequent new user enrollments. To resolve this computational bottleneck, we propose a computationally efficient modification of the algorithm by reusing previous computations rather than computing the algorithm from scratch. Experimental results demonstrate that the proposed algorithm significantly improves the prediction accuracy of new users’ preferences compared to existing baseline algorithms while maintaining fast execution speeds.