• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1531-1539
• /
• 2004

In this paper, we propose an efficient method for locating human lips. Based on Point Distribution Model and Principle Component Analysis, a lip shape model is built. Lip boundary model is represented based on the concatenated gray level distribution model. We calculate the distribution of shape parameters using Gaussian mixture. The problem to locate lip is simplified as the minimization problem of matching object function. The Down Hill Simplex Algorithm is used for the minimization with Gaussian Mixture for setting initial condition and refining estimate of lip shape parameter, which can refrain iteration from converging to local minima. The experiments have been performed for many images, and show very encouraging result.

• Smart Media Journal
• /
• v.4 no.3
• /
• pp.50-55
• /
• 2015

In this paper, we present background modeling method based on Gaussian mixture model to subtract background for night-time video surveillance. In night-time video, it is hard work to distinguish the object from the background because a background pixel is similar to a object pixel. To solve this problem, we change the pixel of input frame to more advantageous value to make the Gaussian mixture model using scaled histogram stretching in preprocessing step. Using scaled pixel value of input frame, we then exploit GMM to find the ideal background pixelwisely. In case that the pixel of next frame is not included in any Gaussian, the matching test in old GMM method ignores the information of stored background by eliminating the Gaussian distribution with low weight. Therefore we consider the stacked data by applying the difference between the old mean and new pixel intensity to new mean instead of removing the Gaussian with low weight. Some experiments demonstrate that the proposed background modeling method shows the superiority of our algorithm effectively.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.6
• /
• pp.705-713
• /
• 2006

For the analysis of multiunit extracellular neural signals as multiple spike trains, neural spike sorting is essential. Existing algorithms for the spike sorting have been unsatisfactory when the signal-to-noise ratio(SNR) is low, especially for implementation of fully-automated systems. We present a novel method that shows satisfactory performance even under low SNR, and compare its performance with a recent method based on principal component analysis(PCA) and fuzzy c-means(FCM) clustering algorithm. Our system consists of a spike detector that shows high performance under low SNR, a feature extractor that utilizes projection pursuit based on negentropy maximization, and an unsupervised classifier based on Gaussian mixture model. It is shown that the proposed feature extractor gives better performance compared to the PCA, and the proposed combination of spike detector, feature extraction, and unsupervised classification yields much better performance than the PCA-FCM, in that the realization of fully-automated unsupervised spike sorting becomes more feasible.

• Speech Sciences
• /
• v.14 no.1
• /
• pp.151-162
• /
• 2007

This study focuses on the classification of pathological voice using GMM (Gaussian Mixture Model) and compares the results to the previous work which was done by ANN (Artificial Neural Network). Speech data from normal people and patients were collected, then diagnosed and classified into two different categories. Six characteristic parameters (Jitter, Shimmer, NHR, SPI, APQ and RAP) were chosen. Then the classification method based on the artificial neural network and Gaussian mixture method was employed to discriminate the data into normal and pathological speech. The GMM method attained 98.4% average correct classification rate with training data and 95.2% average correct classification rate with test data. The different mixture number (3 to 15) of GMM was used in order to obtain an optimal condition for classification. We also compared the average classification rate based on GMM, ANN and HMM. The proper number of mixtures on Gaussian model needs to be investigated in our future work.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.246-249
• /
• 2009

Due to the additive white Gaussian noise (AWGN), images are often corrupted. In recent days, Bayesian estimation techniques to recover noisy images in the wavelet domain have been studied. The probability density function (PDF) of an image in wavelet domain can be described using highly-sharp head and long-tailed shapes. If a priori probability density function having the above properties would be applied well adaptively, better results could be obtained. There were some frequently proposed PDFs such as Gaussian, Laplace distributions, and so on. These functions model the wavelet coefficients satisfactorily and have its own of characteristics. In this paper, mixture distributions of Gaussian and Laplace distribution are proposed, which attempt to corporate these distributions' merits. Such mixture model will be used to remove the noise in images by adopting Maximum a Posteriori (MAP) estimation method. With respect to visual quality, numerical performance and computational complexity, the proposed technique gained better results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.1
• /
• pp.29-36
• /
• 2004

Generally, wavelet coefficients can be classified into two categories: large coefficients with much signal information and small coefficients with little signal component. This statistical characteristic of wavelet coefficient is approximated to Gaussian mixture model and efficiently applied to noise reduction. In this paper, we propose an image denoising method using mixture modeling of wavelet coefficients. Binary mask value is generated by proper threshold which classifies wavelet coefficients into two categories. Information of binary mask value is used to remove image noise. We also develope an enhancement method of mask value using morphological filter, and apply it to image denoising for improvement of the proposed method. Simulation results shows the proposed method have better PSNRs than those of the state of art denoising methods.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.1
• /
• pp.27-34
• /
• 2019

This paper presents a chamber pressure model development of K2 rifle by applying Gaussian mixture model. In order to materialize a real recoil force of a virtual reality shooting rifle in military combat training, the chamber pressure which is one of major components of the recoil force needs to be investigated and modeled. Over 200,000 data of the chamber pressure were collected by implementing live fire experiments with both K100 and M193 of 5.56 mm bullets. Gaussian mixture method was also applied to create a mathematical model that satisfies nonlinear, asymmetry, and deviations of the chamber pressure which is caused by irregular characteristics of propellant combustion. In addition, Polynomial and Fourier Regression were used for comparison of results, and the sum of squared errors, the coefficient of determination and root-mean-square errors were analyzed for performance measurement.

• Phonetics and Speech Sciences
• /
• v.7 no.3
• /
• pp.131-138
• /
• 2015

In this paper, we propose L1-norm regularization for state vector adaptation of subspace Gaussian mixture model (SGMM). When you design a speaker adaptation system with GMM-HMM acoustic model, MAP is the most typical technique to be considered. However, in MAP adaptation procedure, large number of parameters should be updated simultaneously. We can adopt sparse adaptation such as L1-norm regularization or sparse MAP to cope with that, but the performance of sparse adaptation is not good as MAP adaptation. However, SGMM does not suffer a lot from sparse adaptation as GMM-HMM because each Gaussian mean vector in SGMM is defined as a weighted sum of basis vectors, which is much robust to the fluctuation of parameters. Since there are only a few adaptation techniques appropriate for SGMM, our proposed method could be powerful especially when the number of adaptation data is limited. Experimental results show that error reduction rate of the proposed method is better than the result of MAP adaptation of SGMM, even with small adaptation data.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.715-723
• /
• 2002

This paper is to show a clustering application of a density estimation method that utilizes the Gaussian mixture model. We define "closeness measure" as a clustering criterion to see how close given two Gaussian components are. Closeness measure is defined as the ratio of log likelihood between two Gaussian components. According to simulations using artificial data, the clustering algorithm turned out to be very powerful in that it can correctly determine clusters in complex situations, and very flexible in that it can produce different sizes of clusters based on different threshold valuesold values

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.1
• /
• pp.56-61
• /
• 2010

This paper describes optimization methods of acoustic models in HMM-based continuous speech recognition. Most of the conventional speech recognition systems use the same number of Gaussian mixture components for each HMM state. However, since the number of data samples available for each state is different from each other, it is possible to reduce the overall number of model parameters and the computational cost at the decoding step by optimizing the number of Gaussian mixture components. In this study, we introduced the Gaussian mixture weight term at the merging stage of Gaussian components in the minimum description length (MDL) based acoustic modeling optimization. Experimental results showed that the proposed method can obtain better ASR accuracy than the previous optimization method which does not consider the Gaussian mixture weight term.