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

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

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.407-409
• /
• 2015

In this paper, a hardware implementation of MOD(Moving Object Detection) algorithm is described, which is based GMM(Gaussian Mixture Model) and background subtraction. The EGML(Effective Gaussian Mixture Learning) is used to model and update background. Some approximations of EGML calculations are applied to reduce hardware complexity, and pipelining technique is used to improve operating speed. Gaussian parameters are adjustable according to various environment conditions to achieve better MOD performance. MOD processor is verified by using FPGA-in-the-loop verification, and it can operate with 109 MHz clock frequency on XC5VSX95T FPGA device.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.808-810
• /
• 2011

The background estimation algorithms had a significant impact on the performance of image processing and recognition. In this paper, background estimation algorithms were analysis of complexity and performance as preprocessing of image recognition. It was evaluated the performance of Gaussian Running Average, Mixture of Gaussian, and KDE algorithm. The simulation results show that KDE algorithm outperforms compared to the other algorithms.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.07a
• /
• pp.35-36
• /
• 2022

본 논문은 딥러닝 사람 자세 추정 모델이 사람의 관절 키포인트를 예측하는데 관절의 2차원 면적에 의해 키포인트별 𝜎, 즉, 표준 편차를 가지는 가우시안 커널(Gaussian Kernel)을 예측하는 방법을 제안한다. 각 관절 키포인트에 대해 다른 𝜎를 가지는 정답 히트맵(Ground Truth Heatmap)과 제안한 Gaussian Mixture Block를 모델에 추가해서 관절의 크기를 맞는 히트맵을 예측한다.

• Proceedings of the KSR Conference
• /
• 2011.05a
• /
• pp.1161-1166
• /
• 2011

A camera is mounted vertically downwards viewing the people heads from the top. This configuration is successful in people counting technique especially when only a few isolated people pass through a counting region in a non-crowded situation. Thus, this paper describes object counting which detects and count moving people using mixture of gaussian and motion vector. This method is intended to estimates the number of people in outdoor environment. This method use single gaussian background modeling which is more robust an noise and has adaptiveness. The experimental results that is based on mixture of gaussian and motion vector is also helpful to design intelligent surveillance.

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

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

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.434-434
• /
• 2006