• The Journal of the Acoustical Society of Korea
• /
• v.23 no.1
• /
• pp.75-81
• /
• 2004

Gaussian selection (GS) is a popular approach in the continuous density hidden Markov model for fast decoding. It enables fast likelihood computation by reducing the number of Gaussian components calculated. In this paper, we propose a new GS method for the phonetic tied-mixture (PTM) hidden Markov models. The PTM model can represent each state of the same topological location with a shared set of Gaussian mixture components and contort dependent weights. Thus the proposed method imposes constraint on the weights as well as the number of Gaussian components to reduce the computational load. Experimental results show that the proposed method reduces the percentage of Gaussian computation to 16.41%, compared with 20-30% for the conventional GS methods, with little degradation in recognition.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.26-29
• /
• 2002

Radial Basis Function (RBF) networks is known as efficient method in classification problems and function approximation. The basis function of RBF networks is usual adopted normal distribution like the Gaussian function. The output of the Gaussian function has the maximum at the center and decrease as increase the distance from the center. For learning of neural network, the method treating the limited area of input space is sometimes more useful than the method treating the whole of input space. The q-normal distribution is the set of probability density function include the Gaussian function. In this paper, we introduce the RBF networks with the basis function of q-normal distribution and actually approximate a function using the RBF networks.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.333-342
• /
• 2014

Most hyper-ellipsoidal clustering (HEC) approaches use the Mahalanobis distance as a distance metric. It has been proven that HEC, under this condition, cannot be realized since the cost function of partitional clustering is a constant. We demonstrate that HEC with a modified Gaussian kernel metric can be interpreted as a problem of finding condensed ellipsoidal clusters (with respect to the volumes and densities of the clusters) and propose a practical HEC algorithm that is able to efficiently handle clusters that are ellipsoidal in shape and that are of different size and density. We then try to refine the HEC algorithm by utilizing ellipsoids defined on the kernel feature space to deal with more complex-shaped clusters. The proposed methods lead to a significant improvement in the clustering results over K-means algorithm, fuzzy C-means algorithm, GMM-EM algorithm, and HEC algorithm based on minimum-volume ellipsoids using Mahalanobis distance.

• Communications for Statistical Applications and Methods
• /
• v.19 no.2
• /
• pp.267-276
• /
• 2012

Bagai et al. (1989) proposed a distribution-free test for stochastic ordering in the competing risk model, and recently Murakami (2009) utilized a standard saddlepoint approximation to provide tail probabilities for the Bagai statistic under finite sample sizes. In the present paper, we consider the Gaussian-polynomial approximation proposed in Ha and Provost (2007) and compare it to the saddlepoint approximation in terms of approximating the percentiles of the Bagai statistic. We make numerical comparisons of these approximations for moderate sample sizes as was done in Murakami (2009). From the numerical results, it was observed that the Gaussianpolynomial approximation provides comparable or greater accuracy in the tail probabilities than the saddlepoint approximation. Unlike saddlepoint approximation, the Gaussian-polynomial approximation provides a simple explicit representation of the approximated density function. We also discuss the details of computations.

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

• Journal of the Korean Physical Society
• /
• v.73 no.11
• /
• pp.1612-1618
• /
• 2018

In this work, the ground-state properties of an interacting electron gas confined in a two-dimensional quantum dot system with the Gaussian potential ${\upsilon}(r)=V_0(1-{\exp}(-r^2/p))$, where $V_0$ and p are confinement parameters, are determined numerically by using the Thomas-Fermi approximation. The shape of the potential is modified by changing the $V_0$ and the p values, and the influence of the confining potential on the system's properties, such as the chemical energy, the density profile, the kinetic energy, the confining energy, etc., is analyzed for both the non-interacting and the interacting cases. The results are compared with those calculated for a harmonic potential, and excellent agreement is obtained in the limit of high p values for both the non-interacting and the interacting cases.

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

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.57-63
• /
• 2008

In this paper, we present an efficient noise reduction method using bivariate Gaussian density function in the wavelet domain. In our method, the probability model for the interstate dependency in the wavelet domain is modeled by bivariate Gaussian function, and then, the noise reduction is performed by Bayesian estimation. The statistical parameter for Bayesian estimation can be approximately obtained by the $H{\ddot{o}}lder$ inequality. The simulation results show that our method outperforms the previous methods using bivariate probability models.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.203-210
• /
• 2015

We consider fractional Brownian motion and FARIMA process with Gaussian innovations and show that the suitably scaled distributions of the FARIMA processes converge to fractional Brownian motion in the sense of finite dimensional distributions. We figure out ACF function and estimate the self-similarity parameter H of FARIMA(0, d, 0) by using R/S method. Finally, we display power spectrum density of FARIMA process.

• Journal of the Optical Society of Korea
• /
• v.18 no.2
• /
• pp.124-128
• /
• 2014

We derive joint probability density functions (JPDFs) for two adjacent data from direct-detection optical receivers in dense wavelength-division multiplexing systems. We show that the decision using two data per bit can increase the receiver sensitivity compared with the conventional decision. Our JPDFs can be used for software-defined optical receivers enhancing the receiver sensitivities for intensity-modulated channels.