• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.391-399
• /
• 2003

Let (X,S,$\mu$) be a measure space and M be the vector space of all real valued S-measurable functions defined on (X,S,$\mu$). For $E\;{\in}\;S$ with $\mu(E)\;<\;{\infty}$, $d_E$ is a pseudometric on M. With the notion of D = {$d_E$\mid$E\;{\in}\;S,\mu(E)\;<\;{\infty}$}, in this paper we investigate some topological structure T of M. Indeed, we shall show that it is possible to define a complete invariant metric on M which is compatible with the topology T on M.

• Journal of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1407-1419
• /
• 2021

The Iwasawa decomposition NAK of the Lie group G = SO₀(2, 1) with a left invariant metric produces Riemannian submersions G → N\G, G → A\G, G → K\G, and G → NA\G. For each of these, we calculate the curvature of the base space and the lifting of a simple closed curve to the total space G. Especially in the first case, the base space has a constant curvature 0; the holonomy displacement along a (null-homotopic) simple closed curve in the base space is determined only by the Euclidean area of the region surrounded by the curve.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.648-653
• /
• 2010

The non-metric multidimensional scaling (nMDS) is a method for analyzing the relation among objects by mapping them onto the Euclidean space. The nMDS is useful when it is difficult to use the concept of distance between pairs of objects due to non-metric dissimilarities between objects. The nMDS can be regarded as an optimization problem in which there are many local optima. Since the conventional nMDS algorithm utilizes the steepest descent method, it has a drawback in that the method can hardly find a better solution once it falls into a local optimum. To remedy this problem, in this paper, we applied the simulated annealing to the nMDS and proposed a new optimization algorithm which could search for a global optimum more effectively. We examined the algorithm using benchmarking problems and found that improvement rate of the proposed algorithm against the conventional algorithm ranged from 0.7% to 3.2%. In addition, the statistical hypothesis test also showed that the proposed algorithm outperformed the conventional one.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.112-114
• /
• 2011

On multimedia databases, in order to realize the fast access method, indexing methods for the multidimension data space are used. However, since it is a premise to use the Euclid distance as the distance measure, this method lacks in flexibility. On the other hand, there are metric indexing methods which require only to satisfy distance axiom. Since metric indexing methods can also apply for distance measures other than the Euclid distance, these methods have high flexibility. This paper proposes an improved method of VP-tree which is one of the metric indexing methods. VP-tree follows the node which suits the search range from a route node at searching. And distances between a query and all objects linked from the leaf node which finally arrived are computed, and it investigates whether each object is contained in the search range. However, search speed will become slow if the number of distance calculations in a leaf node increases. Therefore, we paid attention to the candidates selection method using the triangular inequality in a leaf node. As the improved methods, we propose a method to use the nearest neighbor object point for the query as the datum point of the triangular inequality. It becomes possible to make the search range smaller and to cut down the number of times of distance calculation by these improved methods. From evaluation experiments using 10,000 image data, it was found that our proposed method could cut 5%~12% of search time of the traditional method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.1 s.4
• /
• pp.117-125
• /
• 2004

Space-time coding and modulation exploit the presence of multiple transmit antennas to improve performance on multipath Rayleigh fading channels. In this paper, we propose the Trellis-Coded Differential Space Time Modulation-OFDM system with multiple symbol detection. The Trellis-code perform the set partition with unitary group codes. The Viterbi decoder containing new branch metrics is introduced in order to improve the bit error rate (BER) in the differential detection of the Unitary differential space time modulation. Also, we describe the Viterbi algorithm in order to use this branch metrics. Our study shows that such a Viterbi decoder improves BER performance without sacrificing bandwidth and power efficiency.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1294-1302
• /
• 2015

A lot of image quality assessment metrics that can precisely reflect the human visual system (HVS) have previously been researched. The Structural SIMilarity (SSIM) index is a remarkable HVS-aware metric that utilizes structural information, since the HVS is sensitive to the overall structure of an image. However, SSIM fails to deal with color difference in terms of the HVS. In order to solve this problem, the Structural and Hue SIMilarity (SHSIM) index has been selected with the Hue, Saturation, Intensity (HSI) model as a color space, but it cannot reflect the HVS-aware color difference between two color images. In this paper, we propose a new image quality assessment method for a color image by using a CIE Lab color space. In addition, by using a support vector machine (SVM) classifier, we also propose an optimization system for applying optimal metric according to the types of distortion. To evaluate the proposed index, a LIVE database, which is the most well-known in the area of image quality assessment, is employed and four criteria are used. Experimental results show that the proposed index is more consistent with the other methods.

• East Asian mathematical journal
• /
• v.36 no.3
• /
• pp.389-415
• /
• 2020

Let M be a semi-invariant submanifold of codimension 3 with almost contact metric structure (𝜙, ξ, η, g) in a complex space form M_n+1(c), c ≠ 0. We denote by R_ξ and R'_X be the structure Jacobi operator with respect to the structure vector ξ and be R'_X = (∇_XR)(·, X)X for any unit vector field X on M, respectively. Suppose that the third fundamental form t satisfies dt(X, Y) = 2𝜃g(𝜙X, Y) for a scalar 𝜃(≠ 2c) and any vector fields X and Y on M. In this paper, we prove that if it satisfies R_ξ𝜙 = 𝜙R_ξ and at the same time R'_ξ = 0, then M is a Hopf real hypersurfaces of type (A), provided that the scalar curvature ${\bar{r}}$ of M holds ${\bar{r}}-2(n-1)c{\leq}0$.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.9 no.2
• /
• pp.45-51
• /
• 2000

This study proposes that analysis and evaluation method of time series ultrasonic signal using the chaotic feature extrac-tion for degradation extent. Features extracted from time series data using the chaotic time series signal analyze quantitatively material degradation extent. For this purpose analysis objective in this study if fractal dimension lyapunov exponent and strange attractor on hyperspace. The lyapunov exponent is a measure of the rate at which nearby trajectories in phase space diverge. Chaotic trajectories have at least one positive lyapunov exponent. The fractal dimension appears as a metric space such as the phase space trajectory of a dynamical syste, In experiment fractal(correlation) dimensions and lyapunov experiments showed values of mean 3.837-4.211 and 0.054-0.078 in case of degradation material The proposed chaotic feature extraction in this study can enhances ultrasonic pattern recognition results from degrada-tion signals.

• Journal of Welding and Joining
• /
• v.16 no.6
• /
• pp.86-96
• /
• 1998

This study proposes the analysis method of time series ultrasonic signal using the chaotic feature extraction for degradation extent evaluation. Features extracted from time series data using the chaotic time series signal analyze quantitatively degradation extent. For this purpose, analysis objective in this study is fractal dimension, lyapunov exponent, strange attractor on hyperspace. The lyapunov exponent is a measure of the rate at which nearby trajectories in phase space diverge. Chaotic trajectories have at least one positive lyapunov exponent. The fractal dimension appears as a metric space such as the phase space trajectory of a dynamical system. In experiment, fractal correlation) dimensions, lyapunov exponents, energy variation showed values of 2.217∼2.411, 0.097∼ 0.146, 1.601∼1.476 voltage according to degardation extent. The proposed chaotic feature extraction in this study can enhances precision ate of degradation extent evaluation from degradation extent results of the degraded materials (SA508 CL.3)

• Journal of the Korean Mathematical Society
• /
• v.41 no.2
• /
• pp.379-396
• /
• 2004

In this article, we study rotation surfaces in the 4-dimensional pseudo-Euclidean space E$_2$$^4$. Also, we obtain the complete classification theorems for the flat rotation surfaces with finite type Gauss map, pointwise 1-type Gauss map and an equation in terms of the mean curvature vector. In fact, we characterize the flat rotation surfaces of finite type immersion with the Gauss map and the mean curvature vector field, namely the Gauss map of finite type, pointwise 1-type Gauss map and some algebraic equations in terms of the Gauss map and the mean curvature vector field related to the Laplacian of the surfaces with respect to the induced metric.