Source author record

Jae-Hun Jung

Jae-Hun Jung appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

8works
13topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

8 published item(s)

preprint2026arXiv

Topology-Aware Representation Alignment for Semi-Supervised Vision-Language Learning

Vision-language models have shown strong performance, but they often generalize poorly to specialized domains. While semi-supervised vision-language learning mitigates this limitation by leveraging a small set of labeled image-text pairs together with abundant unlabeled images, existing methods remain fundamentally pairwise and fail to model the global structure of multimodal representation manifolds. Existing topology-based alignment methods rely on persistence diagram matching, which neither guarantees geometric alignment nor utilizes the image-text pairing information central to vision-language learning. We propose Topology-Aware Multimodal Representation Alignment (ToMA), a framework that uses persistent homology to identify topologically salient edges and aligns them across modalities through available cross-modal correspondences. ToMA leverages both H_0-death edges and lightweight H_1-birth edges, allowing it to capture both connectivity and cycle structure without constructing 2-simplices. Experiments show that ToMA yields stable gains, with clear improvements on remote sensing and modest but consistent benefits on fashion retrieval. Additional analysis shows that ToMA is more stable than alternative topology-based objectives and that lightweight H_1-birth edges provide useful higher-order structural signals.

preprint2024arXiv

Weighted Isolation and Random Cut Forest Algorithms for Anomaly Detection

Random cut forest (RCF) algorithms have been developed for anomaly detection, particularly in time series data. The RCF algorithm is an improved version of the isolation forest (IF) algorithm. Unlike the IF algorithm, the RCF algorithm can determine whether real-time input contains an anomaly by inserting the input into the constructed tree network. Various RCF algorithms, including Robust RCF (RRCF), have been developed, where the cutting procedure is adaptively chosen probabilistically. The RRCF algorithm demonstrates better performance than the IF algorithm, as dimension cuts are decided based on the geometric range of the data, whereas the IF algorithm randomly chooses dimension cuts. However, the overall data structure is not considered in both IF and RRCF, given that split values are chosen randomly. In this paper, we propose new IF and RCF algorithms, referred to as the weighted IF (WIF) and weighted RCF (WRCF) algorithms, respectively. Their split values are determined by considering the density of the given data. To introduce the WIF and WRCF, we first present a new geometric measure, a density measure, which is crucial for constructing the WIF and WRCF. We provide various mathematical properties of the density measure, accompanied by theorems that support and validate our claims through numerical examples.

preprint2022arXiv

Fifth-order weighted essentially non-oscillatory schemes with new Z-type nonlinear weights for hyperbolic conservation laws

In this paper we propose new Z-type nonlinear weights of the fifth-order weighted essentially non-oscillatory (WENO) finite difference scheme for hyperbolic conservation laws. Instead of employing the classical smoothness indicators for the nonlinear weights, we take the $p$th root of the smoothness indicators and follow the form of Z-type nonlinear weights, leading to fifth order accuracy in smooth regions, even at the critical points, and sharper approximations around the discontinuities. We also prove that the proposed nonlinear weights converge to the linear weights as $p \to \infty$, implying the convergence of the resulting WENO numerical flux to the finite difference numerical flux. Finally, numerical examples are presented by comparing with other WENO schemes, such as WENO-JS, WENO-M and WENO-Z, to demonstrate that the proposed WENO scheme performs better in shock capturing.

preprint2022arXiv

Machine Composition of Korean Music via Topological Data Analysis and Artificial Neural Network

Common AI music composition algorithms based on artificial neural networks are to train a machine by feeding a large number of music pieces and create artificial neural networks that can produce music similar to the input music data. This approach is a blackbox optimization, that is, the underlying composition algorithm is, in general, not known to users. In this paper, we present a way of machine composition that trains a machine the composition principle embedded in the given music data instead of directly feeding music pieces. We propose this approach by using the concept of {\color{black}{Overlap}} matrix proposed in \cite{TPJ}. In \cite{TPJ}, a type of Korean music, so-called the {\it Dodeuri} music such as Suyeonjangjigok has been analyzed using topological data analysis (TDA), particularly using persistent homology. As the raw music data is not suitable for TDA analysis, the music data is first reconstructed as a graph. The node of the graph is defined as a two-dimensional vector composed of the pitch and duration of each music note. The edge between two nodes is created when those nodes appear consecutively in the music flow. Distance is defined based on the frequency of such appearances. Through TDA on the constructed graph, a unique set of cycles is found for the given music. In \cite{TPJ}, the new concept of the {\it {\color{black}{Overlap}} matrix} has been proposed, which visualizes how those cycles are interconnected over the music flow, in a matrix form. In this paper, we explain how we use the {\color{black}{Overlap}} matrix for machine composition. The {\color{black}{Overlap}} matrix makes it possible to compose a new music piece algorithmically and also provide a seed music towards the desired artificial neural network. In this paper, we use the {\it Dodeuri} music and explain detailed steps.

preprint2013arXiv

Stable long-distance propagation and on-off switching of colliding soliton sequences with dissipative interaction

We study propagation and on-off switching of two colliding soliton sequences in the presence of second-order dispersion, Kerr nonlinearity, linear loss, cubic gain, and quintic loss. Employing a Lotka-Volterra (LV) model for dynamics of soliton amplitudes along with simulations with two perturbed coupled nonlinear Schrödinger (NLS) equations, we show that stable long-distance propagation can be achieved for a wide range of the gain-loss coefficients, including values that are outside of the perturbative regime. Furthermore, we demonstrate robust on-off and off-on switching of one of the sequences by an abrupt change in the ratio of cubic gain and quintic loss coefficients, and extend the results to pulse sequences with periodically alternating phases. Our study significantly strengthens the recently found relation between collision dynamics of sequences of NLS solitons and population dynamics in LV models, and indicates that the relation might be further extended to solitary waves of the cubic-quintic Ginzburg-Landau equation.

preprint2011arXiv

A multi-domain hybrid method for head-on collision of black holes in particle limit

A hybrid method is developed based on the spectral and finite-difference methods for solving the inhomogeneous Zerilli equation in time-domain. The developed hybrid method decomposes the domain into the spectral and finite-difference domains. The singular source term is located in the spectral domain while the solution in the region without the singular term is approximated by the higher-order finite-difference method. The spectral domain is also split into multi-domains and the finite-difference domain is placed as the boundary domain. Due to the global nature of the spectral method, a multi-domain method composed of the spectral domains only does not yield the proper power-law decay unless the range of the computational domain is large. The finite-difference domain helps reduce boundary effects due to the truncation of the computational domain. The multi-domain approach with the finite-difference boundary domain method reduces the computational costs significantly and also yields the proper power-law decay. Stable and accurate interface conditions between the finite-difference and spectral domains and the spectral and spectral domains are derived. For the singular source term, we use both the Gaussian model with various values of full width at half maximum and a localized discrete $δ$-function. The discrete $δ$-function was generalized to adopt the Gauss-Lobatto collocation points of the spectral domain. The gravitational waveforms are measured. Numerical results show that the developed hybrid method accurately yields the quasi-normal modes and the power-law decay profile. The numerical results also show that the power-law decay profile is less sensitive to the shape of the regularized $δ$-function for the Gaussian model than expected. The Gaussian model also yields better results than the localized discrete $δ$-function.

preprint2011arXiv

Efficient determination of critical parameters of nonlinear Schrödinger equation with point-like potential using generalized polynomial chaos methods

We consider the nonlinear Schrödinger equation with a point-like source term. The soliton interaction with such a singular potential yields a critical solution behavior. That is, for the given value of the potential strength and the soliton amplitude, there exists a critical velocity of the initial soliton solution, around which the solution is either trapped by or transmitted through the potential. In this paper, we propose an efficient method for finding such a critical velocity by using the generalized polynomial chaos method. For the proposed method, we assume that the soliton velocity is a random variable and expand the solution in the random space using the orthogonal polynomials. The proposed method finds the critical velocity accurately with spectral convergence. Thus the computational complexity is much reduced. Numerical results for the smaller and higher values of the potential strength confirm the spectral convergence of the proposed method.

preprint2011arXiv

Efficient determination of the critical parameters and the statistical quantities for Klein-Gordon and sine-Gordon equations with a singular potential using generalized polynomial chaos methods

We consider the Klein-Gordon and sine-Gordon type equations with a point-like potential, which describes the wave phenomenon in disordered media with a defect. The singular potential term yields a critical phenomenon--that is, the solution behavior around the critical parameter value bifurcates into two extreme cases. Pinpointing the critical value with arbitrary accuracy is even more challenging. In this work, we adopt the generalized polynomial chaos (gPC) method to determine the critical values and the mean solutions around such values. First, we consider the critical value associated with the strength of the singular potential for the Klein-Gordon equation. We expand the solution in the random variable associated with the parameter. The obtained partial differential equations are solved using the Chebyshev collocation method. Due to the existence of the singularity, the Gibbs phenomenon appears in the solution, yielding a slow convergence of the numerically computed critical value. To deal with the singularity, we adopt the consistent spectral collocation method. The gPC method, along with the consistent Chebyshev method, determines the critical value and the mean solution highly efficiently. We then consider the sine-Gordon equation, for which the critical value is associated with the initial velocity of the kink soliton solution. The critical behavior in this case is that the solution passes through (particle-pass), is trapped by (particle-capture), or is reflected by (particle-reflection) the singular potential if the initial velocity of the soliton solution is greater than, equal to, or less than the critical value, respectively. We use the gPC mean value rather than reconstructing the solution to find the critical parameter. Numerical results show that the critical value can be determined efficiently and accurately by using the proposed method.