scholarly journals A Batch Rival Penalized Expectation-Maximization Algorithm for Gaussian Mixture Clustering with Automatic Model Selection

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Jiechang Wen ◽  
Dan Zhang ◽  
Yiu-ming Cheung ◽  
Hailin Liu ◽  
Xinge You

Within the learning framework of maximum weighted likelihood (MWL) proposed by Cheung, 2004 and 2005, this paper will develop a batch Rival Penalized Expectation-Maximization (RPEM) algorithm for density mixture clustering provided that all observations are available before the learning process. Compared to the adaptive RPEM algorithm in Cheung, 2004 and 2005, this batch RPEM need not assign the learning rate analogous to the Expectation-Maximization (EM) algorithm (Dempster et al., 1977), but still preserves the capability of automatic model selection. Further, the convergence speed of this batch RPEM is faster than the EM and the adaptive RPEM in general. The experiments show the superior performance of the proposed algorithm on the synthetic data and color image segmentation.

2021 ◽  
Vol 87 (9) ◽  
pp. 615-630
Author(s):  
Longjie Ye ◽  
Ka Zhang ◽  
Wen Xiao ◽  
Yehua Sheng ◽  
Dong Su ◽  
...  

This paper proposes a Gaussian mixture model of a ground filtering method based on hierarchical curvature constraints. Firstly, the thin plate spline function is iteratively applied to interpolate the reference surface. Secondly, gradually changing grid size and curvature threshold are used to construct hierarchical constraints. Finally, an adaptive height difference classifier based on the Gaussian mixture model is proposed. Using the latent variables obtained by the expectation-maximization algorithm, the posterior probability of each point is computed. As a result, ground and objects can be marked separately according to the calculated possibility. 15 data samples provided by the International Society for Photogrammetry and Remote Sensing are used to verify the proposed method, which is also compared with eight classical filtering algorithms. Experimental results demonstrate that the average total errors and average Cohen's kappa coefficient of the proposed method are 6.91% and 80.9%, respectively. In general, it has better performance in areas with terrain discontinuities and bridges.


2013 ◽  
Vol 380-384 ◽  
pp. 2695-2698
Author(s):  
Cai Tian Zhang ◽  
Yi Bo Zhang

For detecting the network intrusion signal in deep camouflage precisely and effectively, a new detection method based chaotic synchronization is proposed in this paper. The Gaussian mixture model of the network data combined with expectation maximization algorithm is established firstly for the afterwards detection, the chaotic synchronization concept is proposed to detect the intrusion signals. According to the simulation result, the new method which this paper proposed shows good performance of detection the intrusion signals. The detection ROC is plotted for the chaotic synchronization detection method and traditional ARMA method, and it shows that the detection performance of the chaotic synchronization algorithm is much better than the traditional ARMA detection method. It shows good application prospect of the new method in the network intrusion signal detection.


Sign in / Sign up

Export Citation Format

Share Document