• Journal of KIEE
• /
• v.10 no.1
• /
• pp.7-15
• /
• 2000

Source separation is a statistical method, the goal of which is to separate the linear instantaneous mixtures of statistically independent sources without resorting to any prior knowledge. This paper addresses a source separation algorithm which is able to separate the mixtures of sub- and super-Gaussian sources. The nonlinear function in the proposed algorithm is derived from the generalized Gaussian distribution that is a set of distributions parameterized by a real positive number (Gaussian exponent). Based on the relationship between the kurtosis and the Gaussian exponent, we present a simple and efficient way of selecting proper nonlinear functions for source separation. Useful behavior of the proposed method is demonstrated by computer simulations.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.402-404
• /
• 2003

We present two methods for the automatic selection of the threshold values in unsupervised change detection. Both methods consist of the same two procedures: 1) to determine the parameters of Gaussian mixtures from a difference image or ratio image, 2) to determine threshold values using the Bayesian rule for minimum error. In the first method, the Expectation-Maximization algorithm is applied for estimating the parameters of the Gaussian mixtures. The second method is based on the iterative thresholding that successively employs thresholding and estimation of the model parameters. The effectiveness and applicability of the methods proposed here are illustrated by an experiment on the multi-temporal KOMPAT-1 EOC images.

• MALSORI
• /
• no.60
• /
• pp.109-123
• /
• 2006

Since computing the log-likelihood of Gaussian mixture density is a major computational burden for the speech recognizer based on the continuous HMM, several techniques have been proposed to reduce the number of mixtures to be used for recognition. In this paper, we propose a modified Bucket Box Intersection (BBI) algorithm, in which two relative thresholds are employed: one is the relative threshold in the conventional BBI algorithm and the other is used to reduce the number of the Gaussian boxes which are intersected by the hyperplanes at the boxes' edges. The experimental results show that the proposed algorithm reduces the number of Gaussian mixtures by 12.92% during the recognition phase with negligible performance degradation compared to the conventional BBI algorithm.

• Journal of Digital Convergence
• /
• v.10 no.7
• /
• pp.167-172
• /
• 2012

In vocabulary recognition using HMM(Hidden Markov Model) by model for the observation of a discrete probability distribution indicates the advantages of low computational complexity, but relatively low recognition rate has the disadvantage that require sophisticated smoothing process. Gaussian mixtures in order to improve them with a continuous probability density CHMM (Continuous Hidden Markov Model) model is proposed for the optimization of the library system. In this paper is system configuration thread control in recognition Gaussian mixtures model provides a model to optimize of the CHMM vocabulary recognition. The result of applying the proposed system, the recognition rate of 98.1% in vocabulary recognition, respectively.

• Speech Sciences
• /
• v.11 no.2
• /
• pp.237-245
• /
• 2004

In general, Gaussian mixture model(GMM) is used to estimate the speaker model for speaker identification. The parameter estimates of the GMM are obtained by using the expectation-maximization (EM) algorithm for the maximum likelihood(ML) estimation. However, if the number of mixtures isn't defined well in the GMM, those parameters are obtained inappropriately. The problem to find the number of components is significant to estimate the optimal parameter in mixture model. In this paper, to estimate the optimal number of mixtures, we propose the method that starts from the sufficient mixtures, after, the number is reduced by investigating the mutual information between mixtures for GMM. In result, we can estimate the optimal number of mixtures. The effectiveness of the proposed method is shown by the experiment using artificial data. Also, we performed the speaker identification applying the proposed method comparing with other approaches.

• Journal of Industrial Technology
• /
• v.18
• /
• pp.267-275
• /
• 1998

Continuous thermodynamics has been applied for modeling of phase equilibria in multicomponent mixtures, to avoid disadvantages of the pseudo-component and key-component method. In this paper continuous thermodynamic relations formulated by using the Pate-Teja equation of state were adopted for calculations of phase equilibria in natural gas mixtures, crude oil mixtures and mixtures extracted by supercritical $CO_2$ fluids. Calculations of phase equilibria were performed by two procedures ; a moment method coupled with the beta distribution function and a quadrature method combined with Gaussian-Legendre polynomials. Calculated results were compared with experimental data. It was showed that continuous thermodynamic frameworks considered in this paper were well-matched to experimental data.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.3
• /
• pp.9-14
• /
• 2002

In this paper we propose a method for performance enhancement of speech recognizer under noisy conditions. The parallel combination model which is presented at the PMC method using multiple Gaussian-distributed mixtures have been adapted to the variation of each mixture. The CDHMM(continuous observation density HMM) which has multiple Gaussian distributed mixtures are combined by the proposed PMC method. Also, the EM(expectation maximization) algorithm is used for adapting the model mean parameter in order to reduce the variation of the mixture density. The result of simulation, the proposed PMC adaptation method show better performance than the conventional PMC method.

• Communications for Statistical Applications and Methods
• /
• v.19 no.1
• /
• pp.157-168
• /
• 2012

The EM algorithm is the most important tool to obtain the maximum likelihood estimator in finite mixture models due to its stability and simplicity. However, its convergence rate is often slow because the conventional EM algorithm is based on a large missing data space. Several techniques have been proposed in the literature to reduce the missing data space. In this paper, we review existing methods and propose a new EM algorithm for Gaussian mixtures, which reduces the missing data space while preserving the stability of the conventional EM algorithm. The performance of the proposed method is evaluated with other existing methods via simulation studies.

• The Korean Journal of Applied Statistics
• /
• v.21 no.5
• /
• pp.825-833
• /
• 2008

Discriminant analysis based on Gaussian mixture models, an useful tool for multi-class classifications, can be extended to semi-supervised learning. We consider a model selection problem for a Gaussian mixture model in semi-supervised learning. More specifically, we adopt Bayesian information criterion to determine the number of subclasses in the mixture model. Through simulations, we illustrate the usefulness of the criterion.

• Speech Sciences
• /
• v.12 no.4
• /
• pp.31-42
• /
• 2005

Recently, Gaussian Mixture Model (GMM), a special form of CHMM, has been applied to speaker identification and it has proved that performance of GMM is better than CHMM. Therefore, in this paper the speaker models based on GMM and a new GMM using the modified EM algorithm are introduced and evaluated for text-independent speaker identification. Various experiments were performed to evaluate identification performance of two algorithms. As a result of the experiments, the GMM speaker model attained 94.6% identification accuracy using 40 seconds of training data and 32 mixtures and 97.8% accuracy using 80 seconds of training data and 64 mixtures. On the other hand, the new GMM speaker model achieved 95.0% identification accuracy using 40 seconds of training data and 32 mixtures and 98.2% accuracy using 80 seconds of training data and 64 mixtures. It shows that the new GMM speaker identification performance is better than the GMM speaker identification performance.