• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1038-1042
• /
• 2012

In this paper, a new distance measure for biased PDFs is proposed and a related equalizer algorithm is also derived for supervised adaptive equalization for multipath channels with impulsive and time-varying DC bias noise. From the simulation results in the non-Gaussian noise environments, the proposed algorithm has proven not only robust to impulsive noise but also to have the capability of cancelling time-varying DC bias noise effectively.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.48-55
• /
• 2000

In this paper, an assumption to design a quantizer, is proposed that if one small region of a probability density function is represented larger probability and bigger total error than another neighbour region, then the quantizer is not optimal. It is tested when the probability functions are Gaussian, Laplacian and uniform density function by the computer simulations. A new LBG algorithm which originates from this assumption in addition to LBG algorithm, is designed for the vector quantizer. The new LBG algorithm presents better performance than the original LBG algorithm in the average error and the variance of the error.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.1
• /
• pp.192-200
• /
• 1994

The methodology of a simple probabilistic fatigue crack under random loading is proposed. Using the crack closure concept, the crack opening stress is assumed to be constant during random loading. The loading history was analyzed to determine the probability density functions, probability distribution functions and other related parameters for the probabilistic fatigue crack growth analysis. Fatigue crack growth using the exisiting available data was predicted by the proposed probabilistic analysis and compared with experimental data.

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

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.251-268
• /
• 2007

A Gaussian sum filter (GSF) is proposed in this paper on simultaneous localization and mapping (SLAM) for mobile robot navigation. In particular, the SLAM problem is tackled here for cases when only bearing measurements are available. Within the stochastic mapping framework using an extended Kalman filter (EKF), a Gaussian probability density function (pdf) is assumed to describe the range-and-bearing sensor noise. In the case of a bearing-only sensor, a sum of weighted Gaussians is used to represent the non-Gaussian robot-landmark range uncertainty, resulting in a bank of EKFs for estimation of the robot and landmark locations. In our approach, the Gaussian parameters are designed on the basis of minimizing the representation error. The computational complexity of the GSF is reduced by applying the sequential probability ratio test (SPRT) to remove under-performing EKFs. Extensive experimental results are included to demonstrate the effectiveness and efficiency of the proposed techniques.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.1
• /
• pp.109-118
• /
• 2008

We present two estimators for discrete non-Gaussian and nonstationary probability density estimation based on a dynamic Bayesian network (DBN). The first estimator is for off line computation and consists of a DBN whose transition distribution is represented in terms of kernel functions. The estimator parameters are the weights and shifts of the kernel functions. The parameters are determined through a recursive learning algorithm using maximum likelihood (ML) estimation. The second estimator is a DBN whose parameters form the transition probabilities. We use an asymptotically convergent, recursive, on-line algorithm to update the parameters using observation data. The DBN calculates the state probabilities using the estimated parameters. We provide examples that demonstrate the usefulness and simplicity of the two proposed estimators.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.931-936
• /
• 2004

GBFCM(DM), Gradient-based Fuzzy c-means with Divergence Measure, for efficient clustering of GPDF(Gaussian Probability Density Function) in MPEG VBR video data modeling is proposed in this paper. The proposed GBFCM(DM) is based on GBFCM( Gradient-based Fuzzy c-means) with the Divergence for its distance measure. In this paper, sets of real-time MPEG VBR Video traffic data are considered. Each of 12 frames MPEG VBR Video data are first transformed to 12-dimensional data for modeling and the transformed 12-dimensional data are Pass through the proposed GBFCM(DM) for classification. The GBFCM(DM) is compared with conventional FCM and GBFCM algorithms. The results show that the GBFCM(DM) gives 5∼15% improvement in False Alarm Rate over conventional algorithms such as FCM and GBFCM.

• Journal of Environmental Impact Assessment
• /
• v.10 no.2
• /
• pp.123-133
• /
• 2001

Gaussian dispersion model is the most widely used tool for the ground level air pollution simulation. Though in spite of the convenience there are important problems on the Pasquill- Gifford' stability classification scheme which was used to define the turbulent state of the atmosphere or to describe the dispersion capabilities of the atmosphere which was each covers a broad range of stability conditions, and that they were very site specific, and the vertical dispersion calculation formula on the case of the unstable atmospheric condition. This paper was carried out to revise the Gaussian dispension model for the purposed of increase the modeling performance and propose the revised model, which was composed of the turbulent characteristics in the unstable atmospheric conditions. The proposed models in this study were composed of the profile method, Monin-Obukhove length, the probability density function model and the lateral dispersion function which was composed of the turbulent parameters, $u_*$(friction velocity), $w_*$(convective velocity scale), $T_L$(lagrangian time scale) for the model specific. There were very good performance results compare with the tracer experiment result on the case of the short distance (<1415m) from the source, but increase the simulation error(%) to stand off the source in the all models. In conclusion, the revised Gaussian dispersion model using the turbulent characteristics may be a good contribution for the development of the air pollution simulation model.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.3
• /
• pp.1416-1421
• /
• 2013

In this paper, the Euclidean distance between the probability density functions (PDFs) for biased errors and a Dirac-delta function located at zero on the error axis is proposed as a new performance criterion for adaptive systems in non-Gaussian noise environments. Also, based on the proposed performance criterion, a supervised adaptive algorithm is derived and applied to adaptive equalization in the shallow-water communication channel distorted by severe multipath fading, impulsive and DC-bias noise. The simulation results compared with the performance of the existing MEDE algorithm show that the proposed algorithm yields over 5 dB of MSE enhancement and the capability of relocating the mean of the error PDF to zero on the error axis.