• Communications for Statistical Applications and Methods
• /
• v.20 no.5
• /
• pp.395-404
• /
• 2013

This paper studies the skewness of the absolute value GARCH(1, 1) models with Gaussian mixture innovations (Gaussian mixture AVGARCH(1, 1) models). The maximum estimated-likelihood estimator (MELE) employed (a two- step estimation method in order to estimate the skewness of Gaussian mixture AVGARCH(1, 1) models. Through the real data analysis, the adequacy of adopting Gaussian mixture innovations is exhibited in reflecting the skewness of two major Korean stock indices.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.733-739
• /
• 2012

In this paper, a smoke detection algorithm robust to brightness and color variations depending on time and weather is proposed. The proposed smoke detection algorithm specifies the candidate region using difference images of input and background images, determines smoke by comparing feature coefficients of Gaussian mixture model of difference images. Thresholds for specifying candidate region is divided by four levels according to average brightness and chrominance of input images. Clusters of Gaussian mixture models of difference images are aligned according to average brightness. Smoke is determined by comparing distance of Gaussian mixture model parameters. The proposed algorithm is implemented by media dedicated DSP. As results of experiments, it is shown that the proposed algorithm is effective to detect smoke with camera installed outdoor.

• ETRI Journal
• /
• v.43 no.1
• /
• pp.74-81
• /
• 2021

The mixture model is a very powerful and flexible tool in clustering analysis. Based on the Dirichlet process and parsimonious Gaussian distribution, we propose a new nonparametric mixture framework for solving challenging clustering problems. Meanwhile, the inference of the model depends on the efficient online variational Bayesian approach, which enhances the information exchange between the whole and the part to a certain extent and applies to scalable datasets. The experiments on the scene database indicate that the novel clustering framework, when combined with a convolutional neural network for feature extraction, has meaningful advantages over other models.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.6
• /
• pp.332-338
• /
• 2013

We propose a method for target detection in Infrared images. In order to effectively detect a target region from an image with noises and clutters, spatial information of the target is first considered by analyzing pixel distributions of projections in horizontal and vertical directions. These distributions are represented as Gaussian distributions, and Gaussian Mixture Model is created from these distributions in order to find thresholding points of the target region. Through analyzing the calculated Gaussian Mixture Model, the target region is detected by eliminating various backgrounds such as noises and clutters. This is performed by using a novel thresholding method which can effectively detect the target region. As experimental results, the proposed method has achieved better performance than existing methods.

• Journal of KIISE:Software and Applications
• /
• v.30 no.5_6
• /
• pp.454-460
• /
• 2003

In this paper, we propose an efficient method for recognizing human lips. Based on Point Distribution Model, a lip shape is represented as a set of points. We calculate a lip model and the distribution of shape parameters using Principle Component Analysis and Gaussian mixture, respectively. The Expectation Maximization algorithm is used to determine the maximum likelihood parameter of Gaussian mixture. The lip contour model is derived by using the gray value changes at each point and in regions around the point and used to search the lip shape in a image. The experiments have been performed for many images, and show very encouraging result.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.195-198
• /
• 2002

One-dimensional radar signature, such as range profile, is highly dependent on the aspect angle. Therefore, radar target recognition over wide angular region is a very difficult task. In this paper, we propose the Bayes classifier with Gaussian mixture model for radar target recognition over wide-angular region and compare performances of proposed technique and radar target recognition with subclasses concept in the literature of probability of correct classification ratio.

• Smart Media Journal
• /
• v.2 no.2
• /
• pp.14-19
• /
• 2013

Recently, due to the increase of the use of scanned images, the text segmentation techniques, which play critical role to optimize the quality of the scanned images, are required to be updated and advanced. In this study, an algorithm has been developed based on the modification of Gaussian mixture model (GMM) by integrating the calculation of Gaussian detection gradient and the estimation of the number clusters. The experimental results show an efficient method for text segmentation in natural scenes such as storefronts, street signs, scanned journals and newspapers at different size, shape or color of texts in condition of lighting changes and complex background. These indicate that our model algorithm and research approach can address various issues, which are still limitations of other senior algorithms and methods.

• 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.

• 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.

• Speech Sciences
• /
• v.5 no.1
• /
• pp.7-21
• /
• 1999

This paper proposes an improved training procedure in speech recognition based on the continuous density of the Hidden Markov Model (CDHMM). Of the three parameters (initial state distribution probability, state transition probability, output probability density function (p.d.f.) of state) governing the CDHMM model, we focus on the third parameter and propose an efficient algorithm that determines the p.d.f. of each state. It is known that the resulting CDHMM model converges to a local maximum point of parameter estimation via the iterative Expectation Maximization procedure. Specifically, we propose two independent algorithms that can be embedded in the segmental K -means training procedure by replacing relevant key steps; the adaptation of the number of mixture Gaussian p.d.f. and the initialization using the CDHMM parameters previously estimated. The proposed adaptation algorithm searches for the optimal number of mixture Gaussian humps to ensure that the p.d.f. is consistently re-estimated, enabling the model to converge toward the global maximum point. By applying an appropriate threshold value, which measures the amount of collective changes of weighted variances, the optimized number of mixture Gaussian branch is determined. The initialization algorithm essentially exploits the CDHMM parameters previously estimated and uses them as the basis for the current initial segmentation subroutine. It captures the trend of previous training history whereas the uniform segmentation decimates it. The recognition performance of the proposed adaptation procedures along with the suggested initialization is verified to be always better than that of existing training procedure using fixed number of mixture Gaussian p.d.f.