• Speech Sciences
• /
• v.11 no.3
• /
• pp.131-142
• /
• 2004

Speaker identification system basically functions by comparing spectral energy of an individual production model with that of an input signal. This study aimed to develop a new speaker identification system from two parameters from the spectral energy of numeric sounds: difference sum and correlation coefficient. A narrow-band spectrogram yielded more stable spectral energy across time than a wide-band one. In this paper, we collected empirical data from four male speakers and tested the speaker identification system. The subjects produced 18 combinations of three-digit numeric. sounds !en times each. Five productions of each three-digit number were statistically averaged to make a model for each speaker. Then, the remaining five productions were tested on the system. Results showed that when the threshold for the absolute difference sum was set to 1200, all the speakers could not pass the system while everybody could pass if set to 2800. The minimum correlation coefficient to allow all to pass was 0.82 while the coefficient of 0.95 rejected all. Thus, both threshold levels can be adjusted to the need of speaker identification system, which is desirable for further study.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.10
• /
• pp.495-501
• /
• 2002

A difference based current transformer (CT) saturation detection algorithm uses the third difference of a secondary current to detect the instants of the beginning/end of saturation. The third difference of a secondary current contains high frequency components when a CT is saturated. Thus, an effect of an anti-aliasing lowpass filter implemented in digital protection relays on the detection algorithm should be studied. This paper describes performance analysis of a lowpass filter on the CT saturation detection algorithm. The cutoff frequency of the lowpass filter is normally set to be half of a sampling frequency. In this Paper, two sampling frequencies of 3,840 (Hz) corresponding to 64 sample/cycle (s/c) and 1,920 (Hz) corresponding to 32 (s/c) are studied; the cutoff frequencies of the lowpass filters are set to be 1,920 (Hz), 960 (Hz) and 960(Hz), 480(Hz), respectively. And the proposed algorithm is verified by experiment. A 2nd order Butterworth filter is designed as a lowpass filter. The test results and experiment results clearly indicate that the saturation detection algorithm successfully detects the instants of the beginning/end of saturation even though a secondary current is filtered by the designed lowpass filters.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.6
• /
• pp.1-8
• /
• 1994

In this paper, in order to apply the idea MDPSK to TCM, we use signal set expansion and set partition by phase differences. Through this we propose the trellis-coded MDPSK. And the Viterbi decoder containing branch metrics of the squared Euclidean distance of the Lth order phase difference as well as the first order phase difference is introduced in order to improve the bit error rate(BER) in the differential detection of the trellis-coded MDPSK. The proposed Viterbi decoder is conceptually same to the sliding multiple symbol dection method which uses the branch metric with the first and Lth order phase differences. We investigate the performance of the uncoded DQPSK and the trallis-coded D8PSK in additive white Gaussian noise (AWGN) through the Monte Carlo simulation under the two cases of using and not using the Lth order phase difference metric. The study shows that trellis-coded 8DPSK is an attractive scheme for power and bandlimited systems while also improving the BER performance when the Viterbi decoder is employed to the Lth order phase order difference metric. This performance improvement has been obtained without sacrificing the bandwidth or the power efficiency.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.25 no.3
• /
• pp.389-396
• /
• 2001

Direct numerical simulation of bubble growth and merger process on a single nucleation site during partial nucleate boiling is performed. The equations governing conservation of mass, momentum and energy are solved using a finite difference method combined with a level set method for capturing the vapor-liquid interface. The level set method is modified to include the effects of phase change at the interface and contact angle at the wall. Also, a simplified formulation for predicting the evaporative heat flux in a thin liquid micro-layer is developed and incorporated into the level set formulation. Based on the numerical results, the bubble growth and merger pattern and its effect on the heat transfer are discussed.

• Journal of applied mathematics & informatics
• /
• v.38 no.1_2
• /
• pp.1-12
• /
• 2020

In this paper, we solve the difference equation $x_{n+1}={\frac{x_nx_{n-2}}{ax_n-bx_{n-2}}}$, n = 0, 1, …, where a and b are positive real numbers and the initial values x_-2, x_-1 and x₀ are real numbers. We also find invariant sets and discuss the global behavior of the solutions of aforementioned equation.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.153-156
• /
• 2003

This paper proposes a video tracking method for a deformable moving object using an active contour model. In order to decide the convergent directions of the contour points automatically, a new energy function based on a frame difference map and an updating rules of the frame difference map are presented. Experimental results on a set of synthetic and real image sequences showed that the proposed method can fully track a speedy deformable object while extracting the boundary of the object exactly in every frame.

• Honam Mathematical Journal
• /
• v.43 no.1
• /
• pp.47-58
• /
• 2021

In this paper, we introduce rough statistical convergence of difference double sequences in normed linear spaces as an extension of rough convergence. We define the set of rough statistical limit points of a difference double sequence and analyze the results with proofs.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.619-632
• /
• 2022

In this study, we examine rough ${\Delta}\mathcal{I}$-statistical convergence for difference sequences as an extension of rough convergence. We investigate the set of rough ${\Delta}\mathcal{I}$-statistical limit points of a difference sequence and analyze the results with proofs.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.1-10
• /
• 1975

This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

• Korean Management Science Review
• /
• v.25 no.2
• /
• pp.81-88
• /
• 2008

This paper presents a new algorithm for the K shortest paths problem in a network. After a shortest path is produced with Dijkstra algorithm. detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set. this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated until the $K^{th}-1$ path of the set is obtained. The computational results for networks with about 1,000,000 nodes and 2,700,000 arcs show that this algorithm can be applied to a problem of generating the detouring paths in the metropolitan traffic networks.