Gaussian mixture models for clustering and classifying traffic flow in real-time for traffic operation and management

Based on Gaussian mixture models（GMM）, speed, flow and occupancy are used together in the cluster analysis of traffic flow data. Compared with other clustering and sorting techniques, as a structural model, the GMM is suitable for various kinds of traffic flow parameters. Gap statistics and domain knowledge of traffic flow are used to determine a proper number of clusters. The expectation-maximization （E-M） algorithm is used to estimate parameters of the GMM model. The clustered traffic flow pattems are then analyzed statistically and utilized for designing maximum likelihood classifiers for grouping real-time traffic flow data when new observations become available. Clustering analysis and pattern recognition can also be used to cluster and classify dynamic traffic flow patterns for freeway on-ramp and off-ramp weaving sections as well as for other facilities or things involving the concept of level of service, such as airports, parking lots, intersections, interrupted-flow pedestrian facilities, etc.

A blast furnace fault monitoring algorithm with low false alarm rate:Ensemble of greedy dynamic principal component analysis-Gaussian mixture model

The large blast furnace is essential equipment in the process of iron and steel manufacturing. Due to the complex operation process and frequent fluctuations of variables, conventional monitoring methods often bring false alarms. To address the above problem, an ensemble of greedy dynamic principal component analysis-Gaussian mixture model(EGDPCA-GMM) is proposed in this paper. First, PCA-GMM is introduced to deal with the collinearity and the non-Gaussian distribution of blast furnace data.Second, in order to explain the dynamics of data, the greedy algorithm is used to determine the extended variables and their corresponding time lags, so as to avoid introducing unnecessary noise. Then the bagging ensemble is adopted to cooperate with greedy extension to eliminate the randomness brought by the greedy algorithm and further reduce the false alarm rate(FAR) of monitoring results. Finally, the algorithm is applied to the blast furnace of a large iron and steel group in South China to verify performance.Compared with the basic algorithms, the proposed method achieves lowest FAR, while keeping missed alarm rate(MAR) remain stable.

Threshold-Based Adaptive Gaussian Mixture Model Integration(TA-GMMI)Algorithm for Mapping Snow Cover in Mountainous Terrain

Snow cover is an important parameter in the fields of computer modeling,engineering technology and energy development.With the extensive growth of novel hardware and software compositions creating smart,cyber physical systems’(CPS)efficient end-to-end workflows.In order to provide accurate snow detection results for the CPS’s terminal,this paper proposed a snow cover detection algorithm based on the unsupervised Gaussian mixture model(GMM)for the FY-4A satellite data.At present,most snow cover detection algorithms mainly utilize the characteristics of the optical spectrum,which is based on the normalized difference snow index(NDSI)with thresholds in different wavebands.These algorithms require a large amount of manually labeled data for statistical analysis to obtain the appropriate thresholds for the study area.Consideration must be given to both the high and low elevations in the study area.It is difficult to extract all snow by a fixed threshold in mountainous and rugged terrains.In this research,we avoid relying on a manual analysis for different elevations.Therefore,an algorithm based on the GMM is proposed,integrating the threshold-based algorithm and the GMM.First,the threshold-based algorithm with transferred thresholds from other satellites’analysis results are used to coarsely classify the surface objects.These results are then used to initialize the parameters of the GMM.Finally,the parameters of that model are updated by an expectation-maximum(EM)iteration algorithm,and the final results are outputted when the iterative conditions end.The results show that this algorithm can adjust itself to mountainous terrain with different elevations,and exhibits a better performance than the threshold-based algorithm.Compared with orbit satellites’snow products,the accuracy of the algorithm used for FY-4A is improved by nearly 2%,and the snow detection rate is increased by nearly 6%.Moreover,compared with microwave sensors’snow products,the accuracy is increased by nearly 3%.The validation results show that the proposed algorithm can be adapted to a complex terrain environment in mountainous areas and exhibits good performance under a transferred threshold without manually assigned labels.

An Improved Moving Object Detection Algorithm Based on Gaussian Mixture Models

Aiming at the problems that the classical Gaussian mixture model is unable to detect the complete moving object, and is sensitive to the light mutation scenes and so on, an improved algorithm is proposed for moving object detection based on Gaussian mixture model and three-frame difference method. In the process of extracting the moving region, the improved three-frame difference method uses the dynamic segmentation threshold and edge detection technology, and it is first used to solve the problems such as the illumination mutation and the discontinuity of the target edge. Then, a new adaptive selection strategy of the number of Gaussian distributions is introduced to reduce the processing time and improve accuracy of detection. Finally, HSV color space is used to remove shadow regions, and the whole moving object is detected. Experimental results show that the proposed algorithm can detect moving objects in various situations effectively.

Multidirectional Gaussian Mixture Models for Nonlinear Uncertainty Propagation

Monte Carlo simulations are an accurate but computationally expensive procedure for approximating the resultant non-Gaussian probability density function(PDF)after propagation of an initial Gaussian PDF through a nonlinear function.Univariate splitting libraries for Gaussian Mixture Models(GMMs)exist with up to five elements in the literature.The number of splits are extended in the present work by generating three homoscedastic univariate splitting libraries with up to 39 elements.Mulitvariate GMMs are typically handled with splits along a single direction.Instead,we generate a regular multidirectional grid over the initial multivariate Gaussian distribution by recursively applying the splitting library along multiple directions.The splitting direction is arbitrary and no longer limited to directions parallel to the columns of the square-root of the covariance matrix.A second order Stirling’s interpolation of the nonlinear function evaluated at the mean of the initial Gaussian distribution is used to quantify nonlinearity along candidate splitting directions.The directions with the highest nonlinearity benefit most from splitting.The Multidirectional GMM(MGMM)has applications for uncertainty quantification with computationally intensive nonlinear functions.The variable number of splits in each direction allows for a spectrum of models in the accuracy versus compute time design space,filling the gap between expensive Monte Carlos and fast linearized models.The multidirectional method is demonstrated with four test cases,including an orbit uncertainty propagation case,to illustrate the benefit of splitting along multiple directions and of ranking the splitting directions.

EFFECTIVE IMAGE SEGMENTATION FRAMEWORK FOR GAUSSIAN MIXTURE MODEL INCORPORATING LOCAL INFORMATION

A new two-step framework is proposed for image segmentation. In the first step, the gray-value distribution of the given image is reshaped to have larger inter-class variance and less intra-class variance. In the sec- ond step, the discriminant-based methods or clustering-based methods are performed on the reformed distribution. It is focused on the typical clustering methods-Gaussian mixture model （GMM） and its variant to demonstrate the feasibility of the framework. Due to the independence of the first step in its second step, it can be integrated into the pixel-based and the histogram-based methods to improve their segmentation quality. The experiments on artificial and real images show that the framework can achieve effective and robust segmentation results.

Cascaded projection of Gaussian mixture model for emotion recognition in speech and ECG signals

A cascaded projection of the Gaussian mixture model algorithm is proposed.First,the marginal distribution of the Gaussian mixture model is computed for different feature dimensions, and a number of sub-classifiers are generated using the marginal distribution model.Each sub-classifier is based on different feature sets.The cascaded structure is adopted to fuse the sub-classifiers dynamically to achieve sample adaptation ability.Secondly,the effectiveness of the proposed algorithm is verified on electrocardiogram emotional signal and speech emotional signal.Emotional data including fidgetiness,happiness and sadness is collected by induction experiments.Finally,the emotion feature extraction method is discussed,including heart rate variability, the chaotic electrocardiogram feature and utterance level static feature.The emotional feature reduction methods are studied, including principle component analysis,sequential forward selection, the Fisher discriminant ratio and maximal information coefficient.The experimental results show that the proposed classification algorithm can effectively improve recognition accuracy in two different scenarios.

Adaptive moving target detection algorithm based on Gaussian mixture model

In order to enhance the reliability of the moving target detection, an adaptive moving target detection algorithm based on the Gaussian mixture model is proposed. This algorithm employs Gaussian mixture distributions in modeling the background of each pixel. As a result, the number of Gaussian distributions is not fixed but adaptively changes with the change of the pixel value frequency. The pixels of the difference image are divided into two parts according to their values. Then the two parts are separately segmented by the adaptive threshold, and finally the foreground image is obtained. The shadow elimination method based on morphological reconstruction is introduced to improve the performance of foreground image＇s segmentation. Experimental results show that the proposed algorithm can quickly and accurately build the background model and it is more robust in different real scenes.

Integration of Expectation Maximization using Gaussian Mixture Models and Naïve Bayes for Intrusion Detection

Intrusion detection is the investigation process of information about the system activities or its data to detect any malicious behavior or unauthorized activity.Most of the IDS implement K-means clustering technique due to its linear complexity and fast computing ability.Nonetheless,it is Naïve use of the mean data value for the cluster core that presents a major drawback.The chances of two circular clusters having different radius and centering at the same mean will occur.This condition cannot be addressed by the K-means algorithm because the mean value of the various clusters is very similar together.However,if the clusters are not spherical,it fails.To overcome this issue,a new integrated hybrid model by integrating expectation maximizing(EM)clustering using a Gaussian mixture model(GMM)and naïve Bays classifier have been proposed.In this model,GMM give more flexibility than K-Means in terms of cluster covariance.Also,they use probabilities function and soft clustering,that’s why they can have multiple cluster for a single data.In GMM,we can define the cluster form in GMM by two parameters:the mean and the standard deviation.This means that by using these two parameters,the cluster can take any kind of elliptical shape.EM-GMM will be used to cluster data based on data activity into the corresponding category.

Gaussian mixture model clustering with completed likelihood minimum message length criterion

An improved Gaussian mixture model （GMM）- based clustering method is proposed for the difficult case where the true distribution of data is against the assumed GMM. First, an improved model selection criterion, the completed likelihood minimum message length criterion, is derived. It can measure both the goodness-of-fit of the candidate GMM to the data and the goodness-of-partition of the data. Secondly, by utilizing the proposed criterion as the clustering objective function, an improved expectation- maximization （EM） algorithm is developed, which can avoid poor local optimal solutions compared to the standard EM algorithm for estimating the model parameters. The experimental results demonstrate that the proposed method can rectify the over-fitting tendency of representative GMM-based clustering approaches and can robustly provide more accurate clustering results.

RBMDO Using Gaussian Mixture Model-Based Second-Order Mean-Value Saddlepoint Approximation

Actual engineering systems will be inevitably affected by uncertain factors.Thus,the Reliability-Based Multidisciplinary Design Optimization(RBMDO)has become a hotspot for recent research and application in complex engineering system design.The Second-Order/First-Order Mean-Value Saddlepoint Approximate(SOMVSA/-FOMVSA)are two popular reliability analysis strategies that are widely used in RBMDO.However,the SOMVSA method can only be used efficiently when the distribution of input variables is Gaussian distribution,which significantly limits its application.In this study,the Gaussian Mixture Model-based Second-Order Mean-Value Saddlepoint Approximation(GMM-SOMVSA)is introduced to tackle above problem.It is integrated with the Collaborative Optimization(CO)method to solve RBMDO problems.Furthermore,the formula and procedure of RBMDO using GMM-SOMVSA-Based CO(GMM-SOMVSA-CO)are proposed.Finally,an engineering example is given to show the application of the GMM-SOMVSA-CO method.

Application of a Novel Method for Machine Performance Degradation Assessment Based on Gaussian Mixture Model and Logistic Regression

The currently prevalent machine performance degradation assessment techniques involve estimating a machine＇s current condition based upon the recognition of indications of failure features,which entail complete data collected in different conditions.However,failure data are always hard to acquire,thus making those techniques hard to be applied.In this paper,a novel method which does not need failure history data is introduced.Wavelet packet decomposition（WPD） is used to extract features from raw signals,principal component analysis（PCA） is utilized to reduce feature dimensions,and Gaussian mixture model（GMM） is then applied to approximate the feature space distributions.Single-channel confidence value（SCV） is calculated by the overlap between GMM of the monitoring condition and that of the normal condition,which can indicate the performance of single-channel.Furthermore,multi-channel confidence value（MCV）,which can be deemed as the overall performance index of multi-channel,is calculated via logistic regression（LR） and that the task of decision-level sensor fusion is also completed.Both SCV and MCV can serve as the basis on which proactive maintenance measures can be taken,thus preventing machine breakdown.The method has been adopted to assess the performance of the turbine of a centrifugal compressor in a factory of Petro-China,and the result shows that it can effectively complete this task.The proposed method has engineering significance for machine performance degradation assessment.

Color-texture segmentation using JSEG based on Gaussian mixture modeling

An improved approach for J-value segmentation （JSEG） is presented for unsupervised color image segmentation. Instead of color quantization algorithm, an automatic classification method based on adaptive mean shift （AMS） based clustering is used for nonparametric clustering of image data set. The clustering results are used to construct Gaussian mixture modelling （GMM） of image data for the calculation of soft J value. The region growing algorithm used in JSEG is then applied in segmenting the image based on the multiscale soft J-images. Experiments show that the synergism of JSEG and the soft classification based on AMS based clustering and GMM overcomes the limitations of JSEG successfully and is more robust.

Multimodal process monitoring based on transition-constrained Gaussian mixture model

Reliable process monitoring is important for ensuring process safety and product quality.A production process is generally characterized bymultiple operation modes,and monitoring thesemultimodal processes is challenging.Most multimodal monitoring methods rely on the assumption that the modes are independent of each other,which may not be appropriate for practical application.This study proposes a transition-constrained Gaussian mixture model method for efficient multimodal process monitoring.This technique can reduce falsely and frequently occurring mode transitions by considering the time series information in the mode identification of historical and online data.This process enables the identified modes to reflect the stability of actual working conditions,improve mode identification accuracy,and enhance monitoring reliability in cases of mode overlap.Case studies on a numerical simulation example and simulation of the penicillin fermentation process are provided to verify the effectiveness of the proposed approach inmultimodal process monitoring with mode overlap.

A multi-target tracking algorithm based on Gaussian mixture model

Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is proposed.The algorithm is used to cluster the measurements,and the association matrix between measurements and tracks is constructed by the posterior probability.Compared with the traditional data association algorithm,this algorithm has better tracking performance and less computational complexity.Simulation results demonstrate the effectiveness of the proposed algorithm.

Research on Initialization on EM Algorithm Based on Gaussian Mixture Model

The EM algorithm is a very popular maximum likelihood estimation method, the iterative algorithm for solving the maximum likelihood estimator when the observation data is the incomplete data, but also is very effective algorithm to estimate the finite mixture model parameters. However, EM algorithm can not guarantee to find the global optimal solution, and often easy to fall into local optimal solution, so it is sensitive to the determination of initial value to iteration. Traditional EM algorithm select the initial value at random, we propose an improved method of selection of initial value. First, we use the k-nearest-neighbor method to delete outliers. Second, use the k-means to initialize the EM algorithm. Compare this method with the original random initial value method, numerical experiments show that the parameter estimation effect of the initialization of the EM algorithm is significantly better than the effect of the original EM algorithm.

Automatic Delineation of Lung Parenchyma Based on Multilevel Thresholding and Gaussian Mixture Modelling

Delineation of the lung parenchyma in the thoracic Computed Tomography(CT)is an important processing step for most of the pulmonary image analysis such as lung volume extraction,lung nodule detection and pulmonary vessel segmentation.An automatic method for accurate delineation of lung parenchyma in thoracic Computed Tomography images is presented in this paper.The proposed method involves a segmentation phase followed by a lung boundary correction technique.The tissues in the thoracic Computed Tomography can be represented by a number of Gaussians.We propose a histogram utilized Adaptive Multilevel Thresholding(AMT)for estimating the total number of Gaussians and their initial parameters.The parameters of Gaussian components are updated by Expectation Maximization(EM)algorithm.The segmented lung parenchyma from the Gaussian Mixture model(GMM)undergoes an Adaptive Morphological Filtering(AMF)to reduce the boundary errors.The proposed method has been tested on 70 diseased and 119 normal lung images from 28 cases obtained from Lung Image Database Consortium(LIDC).The performance of the proposed system has been validated.

An unsupervised clustering method for nuclear magnetic resonance transverse relaxation spectrums based on the Gaussian mixture model and its application

To make the quantitative results of nuclear magnetic resonance(NMR) transverse relaxation(T;) spectrums reflect the type and pore structure of reservoir more directly, an unsupervised clustering method was developed to obtain the quantitative pore structure information from the NMR T;spectrums based on the Gaussian mixture model(GMM). Firstly, We conducted the principal component analysis on T;spectrums in order to reduce the dimension data and the dependence of the original variables. Secondly, the dimension-reduced data was fitted using the GMM probability density function, and the model parameters and optimal clustering numbers were obtained according to the expectation-maximization algorithm and the change of the Akaike information criterion. Finally, the T;spectrum features and pore structure types of different clustering groups were analyzed and compared with T;geometric mean and T;arithmetic mean. The effectiveness of the algorithm has been verified by numerical simulation and field NMR logging data. The research shows that the clustering results based on GMM method have good correlations with the shape and distribution of the T;spectrum, pore structure, and petroleum productivity, providing a new means for quantitative identification of pore structure, reservoir grading, and oil and gas productivity evaluation.

Multimodality Prediction of Chaotic Time Series with Sparse Hard-Cut EM Learning of the Gaussian Process Mixture Model

The contribution of this work is twofold： （1） a multimodality prediction method of chaotic time series with the Gaussian process mixture （GPM） model is proposed, which employs a divide and conquer strategy. It automatically divides the chaotic time series into multiple modalities with different extrinsic patterns and intrinsic characteristics, and thus can more precisely fit the chaotic time series. （2） An effective sparse hard-cut expec- tation maximization （SHC-EM） learning algorithm for the GPM model is proposed to improve the prediction performance. SHO-EM replaces a large learning sample set with fewer pseudo inputs, accelerating model learning based on these pseudo inputs. Experiments on Lorenz and Chua time series demonstrate that the proposed method yields not only accurate multimodality prediction, but also the prediction confidence interval SHC-EM outperforms the traditional variational 1earning in terms of both prediction accuracy and speed. In addition, SHC-EM is more robust and insusceptible to noise than variational learning.

An efficient approach for shadow detection based on Gaussian mixture model

An efficient approach was proposed for discriminating shadows from moving objects. In the background subtraction stage, moving objects were extracted. Then, the initial classification for moving shadow pixels and foreground object pixels was performed by using color invariant features. In the shadow model learning stage, instead of a single Gaussian distribution, it was assumed that the density function computed on the values of chromaticity difference or bright difference, can be modeled as a mixture of Gaussian consisting of two density functions. Meanwhile, the Gaussian parameter estimation was performed by using EM algorithm. The estimates were used to obtain shadow mask according to two constraints. Finally, experiments were carried out. The visual experiment results confirm the effectiveness of proposed method. Quantitative results in terms of the shadow detection rate and the shadow discrimination rate(the maximum values are 85.79% and 97.56%, respectively) show that the proposed approach achieves a satisfying result with post-processing step.