• The Journal of the Acoustical Society of Korea
• /
• v.22 no.8
• /
• pp.711-716
• /
• 2003

This paper proposes the method to select the number of optimal mixtures in each state in Continuous Density HMM (Hidden Markov Models), Previously, researchers used the same number of mixture components in each state of HMM regardless spectral characteristic of speaker, To model each speaker as accurately as possible, we propose to use a different number of mixture components for each state, Selection of mixture components considered the probability value of mixture by each state that affects much parameter estimation of continuous density HMM, Also, we use PCA (principal component analysis) to reduce the correlation and obtain the system' stability when it is reduced the number of mixture components, We experiment it when the proposed method used average 10% small mixture components than the conventional HMM, When experiment result is only applied selection of mixture components, the proposed method could get the similar performance, When we used principal component analysis, the feature vector of the 16 order could get the performance decrease of average 0,35% and the 25 order performance improvement of average 0.65%.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.3
• /
• pp.37-45
• /
• 1982

This paper is a sequel of the Part I paper[1] on the modified digital Costas loop. In this Part II we analyze the performance of the system in the presence of noise. It is shown that, when the input signal is corrupted by additive white Gaussian noise, the noise process in the loop becomes Rician as a result of the tan-1 (.) function of the phase error detector. Steady state probability density functions of phase errors of the first-and second-order loops have been obtained by solving the Chapman-Kolmogorov equation numerically. Also, the mean and variance of phase error in the steady state have been obtained analytically, and are compared with the results obtained by computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.853-858
• /
• 2006

TMHMM(Tied Mixture Hidden Markov Model) is an important approach to reduce the number of free parameters in speech recognition. However, this model suffers from a degradation in recognition accuracy due to its GPDF (Gaussian Probability Density Function) clustering error. This paper proposes a clustering algorithm, called HCNN(Homogeneous Centroid Neural network), to cluster acoustic feature vectors in TMHMM. Moreover, the HCNN uses the heterogeneous distance measure to allocate more code vectors in the heterogeneous areas where probability densities of different states overlap each other. When applied to Korean digit isolated word recognition, the HCNN reduces the error rate by 9.39% over CNN clustering, and 14.63% over the traditional K-means clustering.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.931-936
• /
• 2004

GBFCM(DM), Gradient-based Fuzzy c-means with Divergence Measure, for efficient clustering of GPDF(Gaussian Probability Density Function) in MPEG VBR video data modeling is proposed in this paper. The proposed GBFCM(DM) is based on GBFCM( Gradient-based Fuzzy c-means) with the Divergence for its distance measure. In this paper, sets of real-time MPEG VBR Video traffic data are considered. Each of 12 frames MPEG VBR Video data are first transformed to 12-dimensional data for modeling and the transformed 12-dimensional data are Pass through the proposed GBFCM(DM) for classification. The GBFCM(DM) is compared with conventional FCM and GBFCM algorithms. The results show that the GBFCM(DM) gives 5∼15% improvement in False Alarm Rate over conventional algorithms such as FCM and GBFCM.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.1
• /
• pp.50-59
• /
• 2014

In this paper, we develop an efficient approach to solve a multiple-item budget-constraint newsboy problem with a reservation policy. A conventional approach for solving such problem utilizes an approximation for the evaluation of an inverse of a Gaussian cumulative density function when the argument of the function is small, and a heuristic method for finding an optimal Lagrangian multiplier. In contrast to the conventional approach, this paper proposes more accurate method of evaluating the function by using the normalization and an effective numerical integration method. We also propose an efficient way to find an optimal Lagrangian multiplier by proving that the equation for the budget-constraint is in fact a monotonically increasing function in the Lagrangian multiplier. Numerical examples are tested to show the performance of the proposed approach with emphases on the behaviors of the inverse of a Gaussian cumulative density function and the Lagrangian multiplier. By using sensitivity analysis of different budget constraints, we show that the reservation policy indeed provides greater expected profit than the classical model of not having the reservation policy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.173-175
• /
• 2017

With the rapid progress of the digital area has come the increase in demand for multi-media services. Imaging processing as a result is being hailed as a technological field that can offer smart and efficient methods for the processing and analysis of images. In general, noise exist in various types, depending on the cause and form. Some leading examples of noise are AWGN(additive white Gaussian noise), salt and pepper noise and complex noise. This study suggests an algorithm to remove complex noise by using the standard deviation and noise density of the partial mask in order to effectively remove complex noise in images.

• Journal of Auto-vehicle Safety Association
• /
• v.11 no.2
• /
• pp.29-34
• /
• 2019

This paper presents a new method for construction of a static obstacle map. A static obstacle is important since it is utilized to path planning and decision. Several established approaches generate static obstacle map by grid method and counting algorithm. However, these approaches are occasionally ineffective since the density of LiDAR layer is low. Our approach solved this problem by applying probability theory. First, we converted all LiDAR point to Gaussian distribution to considers an uncertainty of LiDAR point. This Gaussian distribution represents likelihood of obstacle. Second, we modeled dynamic transition of a static obstacle map by adopting the Hidden Markov Model. Due to the dynamic characteristics of the vehicle in relation to the conditions of the next stage only, a more accurate map of the obstacles can be obtained using the Hidden Markov Model. Experimental data obtained from test driving demonstrates that our approach is suitable for mapping static obstacles. In addition, this result shows that our algorithm has an advantage in estimating not only static obstacles but also dynamic characteristics of moving target such as driving vehicles.

• Structural Engineering and Mechanics
• /
• v.77 no.3
• /
• pp.355-368
• /
• 2021

The time-varying mean (TVM) component of non-stationary wind speeds is commonly extracted utilizing empirical mode decomposition (EMD) in practice, whereas the accuracy of the extracted TVM is difficult to be quantified. To deal with this problem, this paper proposes an approach to identify and extract the optimal TVM from several TVM results obtained by the EMD. It is suggested that the optimal TVM of a 10-min time history of wind speeds should meet both the following conditions: (1) the probability density function (PDF) of fluctuating wind component agrees well with the modified Gaussian function (MGF). At this stage, a coefficient p is newly defined as an evaluation index to quantify the correlation between PDF and MGF. The smaller the p is, the better the derived TVM is; (2) the number of local maxima of obtained optimal TVM within a 10-min time interval is less than 6. The proposed approach is validated by a numerical example, and it is also adopted to extract the optimal TVM from the field measurement records of wind speeds collected during a sandstorm event.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.629-635
• /
• 2017

In this paper, we proposed a nonlinear synthesis filter for noise reduction to reduce the effects of Gaussian noise and impulse noise. When the centralization of the local mask is judged to be Gaussian noise by the noise judgment, the weight value of the weight filter are applied differently according to the spatial weight filter and the pixel change by using the sample variance in the local mask. And if it is determined as the impulse noise, we proposed an algorithm that applies different weights of local histogram weight filter and standard median filter according to noise density of mask. In order to evaluate the performance of the proposed filter algorithm, we used PSNR(peak signal to noise ratio) and compared existing methods and proposed filter algorithm in the mixed noise environment with Gaussian noise, impulsive noise, and two noises mixed.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.409-414
• /
• 2013

Naive Bayesian classifiers are a powerful and well-known type of classifiers that can be easily induced from a dataset of sample cases. However, the strong conditional independence assumptions can sometimes lead to weak classification performance. Normally, naive Bayesian classifiers use Gaussian distributions to handle continuous attributes and to represent the likelihood of the features conditioned on the classes. The probability density of attributes, however, is not always well fitted by a Gaussian distribution. Another eminent type of classifier is the neuro-fuzzy classifier, which can learn fuzzy rules and fuzzy sets using supervised learning. Since there are specific structural similarities between a neuro-fuzzy classifier and a naive Bayesian classifier, the purpose of this study is to apply learning distribution graphs constructed by a neuro-fuzzy network to naive Bayesian classifiers. We compare the Gaussian distribution graphs with the fuzzy distribution graphs for the naive Bayesian classifier. We applied these two types of distribution graphs to classify leukemia and colon DNA microarray data sets. The results demonstrate that a naive Bayesian classifier with fuzzy distribution graphs is more reliable than that with Gaussian distribution graphs.