MJMinoh Jeong

Minoh Jeong

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Minoh Jeong has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Estimating Mutual Information between Time Series and Temporal Event Sequences Across Diverse Analysis Tasks

    by Haoji Hu, Huaqing Mao, Yijun Lin, Xiaowei Jia, Jinwei Zhou, Minoh Jeong, Yao-Yi Chiang

  • Vision-Based Real-Time 3D Position Sensor for Spherical Actuators Using ICP Pose Estimation

    by Minoh Jeong, Junkyu Kim, Kyu-Sung Lee, Minki Kim

    This paper presents a vision-based real-time 3D position sensor for spherical actuators using Iterative Closest Point (ICP) pose estimation. Unlike conventional rotary motors with fixed axes, spherical actuators enable omnidirectional rotation, which makes traditional one-dimensional sensing methods, such as encoders, Hall sensors, and resolvers, unsuitable for accurate orientation measurement. To address this challenge, we propose a non-contact sensing approach that reconstructs three-dimensional surface point clouds from monocular camera images and estimates the full 3D orientation of the spherical rotor. Arbitrary and non-uniform visual patterns are applied to the rotor surface, and both intentional patterns and natural surface imperfections (e.g., scratches, dust, and wear) are exploited as geometric features for pose estimation. Edge features are extracted using Canny edge detection, reconstructed into 3D point clouds through a geometrically consistent mapping model, and aligned via ICP to estimate the spherical angles θ and ϕ. Experimental validation is conducted using a spherical rotor with a diameter of 15 cm. Under single-axis rotations, a minimum mean absolute error of 0.45° in θ is achieved after pixel-per-revolution calibration. Under dynamic multi-axis rotational motions, the estimated tangential azimuth direction ϕ exhibits compact zero-centered error distributions within approximately 0.2°– 0.9°, confirming consistent 3D directional estimation. Long-term stability analysis further shows that cumulative angular error accumulation remains approximately 0.15° per degree under appropriate sensing conditions. A computational architecture comparison demonstrates the feasibility of real-time operation. The complete processing pipeline, including image preprocessing, 3D reconstruction, and ICP-based pose estimation, achieves a total processing time below 32 ms per frame, satisfying real-time requirements at 30 fps. These results confirm that the proposed vision-based sensor provides a robust, non-contact, and practical solution for real-time 3D orientation sensing in spherical actuator systems.

  • A Comprehensive Study on Ziv-Zakai Lower Bounds on the MMSE

    by Minoh Jeong, Alex Dytso, Martina Cardone

    This paper explores Bayesian lower bounds on the minimum mean squared error (MMSE) that belong to the well-known Ziv-Zakai family. The Ziv-Zakai technique relies on connecting the bound to an $\mathsf M$ -ary hypothesis testing problem. There are three versions of the Ziv-Zakai bound (ZZB): the first version relies on the so-called valley-filling function, the second one is a relaxation of the first bound which omits the valley-filling function, and the third one, namely the single-point ZZB (SZZB), replaces the integration present in the first two bounds with a single point maximization. The first part of this paper focuses on providing the most general version of the bounds. It is shown that these bounds hold without any assumption on the distribution of the estimand. This makes the bounds applicable to discrete and mixed distributions. Then, the SZZB is extended to an $\mathsf M$ -ary setting and a version of it that holds for the multivariate setting is provided. In the second part, general properties of these bounds are provided. First, unlike the Bayesian Cramér-Rao bound, it is shown that all the versions of the ZZB tensorize. Second, a characterization of the high-noise asymptotic is provided, which is used to argue about the tightness of the bounds. Third, a complete low-noise asymptotic is provided under the assumptions of mixed-input distributions and Gaussian additive noise channels. In the low-noise, it is shown that the ZZB is generally tight, but there are examples for which the SZZB is not tight. In the third part, the tightness of the bounds is evaluated. First, it is shown that in the low-noise regime the ZZB without the valley-filling function, and, therefore, also the ZZB with the valley-filling function, are tight for mixed-input distributions and Gaussian additive noise channels. Second, for discrete inputs it is shown that the ZZB with the valley-filling function is always sub-optimal, and equal to zero without the valley-filling function. Third, unlike for the ZZB, an example is shown for which the SZZB is tight to the MMSE for discrete inputs. Fourth, sufficient and necessary conditions for the tightness of the bounds are provided. Finally, some examples are provided in which the bounds in the Ziv-Zakai family outperform other well-known Bayesian lower bounds, namely the Cramér-Rao bound and the maximum entropy bound.


  • Open Access

    On the Secrecy Capacity of 1-2-1 Atomic Networks

    by Mohammad Milanian, Minoh Jeong, Martina Cardone

    We consider the problem of secure communication over a noiseless 1-2-1 network, an abstract model introduced to capture the directivity characteristic of mmWave communications. We focus on structured networks, which we refer to as 1-2-1 atomic networks. Broadly speaking, these are characterized by a source, a destination, and three layers of intermediate nodes with sparse connections. The goal is for the source to securely communicate to the destination in the presence of an eavesdropper with unbounded computation capabilities, but limited network presence. We derive novel upper and lower bounds on the secrecy capacity of 1-2-1 atomic networks. These bounds are shown to be tighter than existing bounds in some regimes. Moreover, in such regimes, the bounds match and hence, they characterize the secrecy capacity of 1-2-1 atomic networks.

  • Open Access

    Data-Driven Estimation of the False Positive Rate of the Bayes Binary Classifier via Soft Labels

    by Minoh Jeong, Martina Cardone, Alex Dytso

    Classification is a fundamental task in many applications on which data-driven methods have shown outstanding performances. However, it is challenging to determine whether such methods have achieved the optimal performance. This is mainly because the best achievable performance is typically unknown and hence, effectively estimating it is of prime importance. In this paper, we consider binary classification problems and we propose an estimator for the false positive rate (FPR) of the Bayes classifier, that is, the optimal classifier with respect to accuracy, from a given dataset. Our method utilizes soft labels, or real-valued labels, which are gaining significant traction thanks to their properties. We thoroughly examine various theoretical properties of our estimator, including its consistency, unbiasedness, rate of convergence, and variance. To enhance the versatility of our estimator beyond soft labels, we also consider noisy labels, which encompass binary labels. For noisy labels, we develop effective FPR estimators by leveraging a denoising technique and the Nadaraya-Watson estimator. Due to the symmetry of the problem, our results can be readily applied to estimate the false negative rate of the Bayes classifier.

  • Retrieving Data Permutations From Noisy Observations: Asymptotics

    by Minoh Jeong, Alex Dytso, Martina Cardone

    This paper studies the problem of data permutation recovery, where the goal is to estimate the ordering of an n -dimensional data vector given a noisy observation of it. The focus is on scenarios where the noise is additive Gaussian with an arbitrary known covariance matrix. The goal is to characterize the probability of error and its behavior when a linear decoder (that is, a linear estimator followed by a sorting operation) is employed. First, a general expression is derived for the probability of error when a linear decoder is used. The derived expression holds for any continuous distribution of the input data vector, and when the noise has memory. Then, the rates of convergence of the probability of error in the low-noise and high-noise regimes are investigated when a simple linear decoder is used. It is shown that in the low-noise regime, the probability of error can quadratically increase with n , and in the high-noise regime it behaves as 1-1/ n ! for several distributions of interest. Finally, upper and lower bounds on the probability of correctness with respect to n are derived for the case of an i.i.d. data distribution and show that the rate of convergence is at least exponential in n . The results showcase that the permutation recovery problem is noise dominated, which motivates the study of more relaxed versions of the permutation recovery problem that are also discussed.


  • Design of a Spiral Coil for High-Frequency Wireless Power Transfer Systems Using Machine Learning

    by Minki Kim, Minoh Jeong, Martina Cardone, Jungwon Choi

    This paper presents a novel design method based on machine learning (ML) for a spiral coil in a wireless power transfer (WPT) system operating at high frequencies. While a MHz frequency operation provides high power density for battery-powered applications, optimizing the spiral coil design becomes challenging due to the complex electromagnetic analysis, such as skin and proximity effects. Even though a three-dimensional (3D) electromagnetic simulator provides a practical analysis of different coil structures, it cannot quickly optimize the coil design due to its computing time. Therefore, an ML-based method is first proposed to estimate the $Q$ factor of a spiral coil, a critical parameter to determine the efficiency of a WPT system. Towards this end, a feed-forward neural network is trained using around $20 \cdot 10^{3}$ data samples collected by using a 3D quasi-static electromagnetic field simulator. It is shown that this method is effective; that is, it ensures an accuracy of up to 96%. Then, a spiral coil design method leveraging the designed ML-based $Q$ factor estimation is proposed. This method offers high performance (the intersection over union metric takes values up to 70%) and significant computation time savings (at least five orders of magnitude), compared to commonly adopted software simulators. Finally, the effectiveness of the proposed method is verified by the actual fabrication of several spiral coils.


  • Open Access

    Functional Properties of the Ziv-Zakai bound with Arbitrary Inputs

    by Minoh Jeong, Alex Dytso, Martina Cardone

    This paper explores the Ziv-Zakai bound (ZZB), which is a well-known Bayesian lower bound on the Minimum Mean Squared Error (MMSE). First, it is shown that the ZZB holds without any assumption on the distribution of the estimand, that is, the estimand does not necessarily need to have a probability density function. The ZZB is then further analyzed in the high-noise and low-noise regimes and shown to always tensorize. Finally, the tightness of the ZZB is investigated under several aspects, such as the number of hypotheses and the usefulness of the valley-filling function. In particular, a sufficient and necessary condition for the tightness of the bound with continuous inputs is provided, and it is shown that the bound is never tight for discrete input distributions with a support set that does not have an accumulation point at zero.

  • Recovering Data Permutations From Noisy Observations: The Linear Regime

    by Minoh Jeong, Alex Dytso, Martina Cardone, H. Vincent Poor

    This paper considers a noisy data structure recovery problem. The goal is to investigate the following question: Given a noisy observation of a permuted data set, according to which permutation was the original data sorted? The focus is on scenarios where data is generated according to an isotropic Gaussian distribution, and the noise is additive Gaussian with an arbitrary covariance matrix. This problem is posed within a hypothesis testing framework. The objective is to study the linear regime in which the optimal decoder has a polynomial complexity in the data size, and it declares the permutation by simply computing a permutation-independent linear function of the noisy observations. The main result of the paper is a complete characterization of the linear regime in terms of the noise covariance matrix. Specifically, it is shown that this matrix must have a very flat spectrum with at most three distinct eigenvalues to induce the linear regime. Several practically relevant implications of this result are discussed, and the error probability incurred by the decision criterion in the linear regime is also characterized. A core technical component consists of using linear algebraic and geometric tools, such as Steiner symmetrization.