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.

Latent Growth Mixture Modeling to Estimate Differential PTSD Trajectories and Associated Risk Factors in Psychiatric Staff Following Workplace Violence

Background: Workplace violence (WV) towards psychiatric staff has commonly been associated with Posttraumatic Stress Disorder (PTSD). However, prospective studies have shown that not all psychiatric staff who experience workplace violence experience post-traumatic stress. Purpose: We want to examine the longitudinal trajectories of PTSD in this population to identify possible subgroups that might be more at risk. Furthermore, we need to investigate whether certain risk factors of PTSD might identify membership in the subgroups. Method: In a sample of psychiatric staff from 18 psychiatric wards in Denmark who had reported an incident of WV, we used Latent Growth Mixture Modelling (LGMM) and further logistic regression analysis to investigate this. Results: We found three separate PTSD trajectories: a recovering, a delayed-onset, and a moderate-stable trajectory. Higher social support and negative cognitive appraisals about oneself, the world and self-blame predicted membership in the delayed-onset trajectory, while higher social support and lower accept coping predicted membership in the delayed-onset trajectory. Conclusion: Although most psychiatric staff go through a natural recovery, it is important to be aware of and identify staff members who might be struggling long-term. More focus on the factors that might predict these groups should be an important task for psychiatric departments to prevent posttraumatic symptomatology from work.

DSP-TMM:A Robust Cluster Analysis Method Based on Diversity Self-Paced T-Mixture Model

In order to implement the robust cluster analysis,solve the problem that the outliers in the data will have a serious disturbance to the probability density parameter estimation,and therefore affect the accuracy of clustering,a robust cluster analysis method is proposed which is based on the diversity self-paced t-mixture model.This model firstly adopts the t-distribution as the submodel which tail is easily controllable.On this basis,it utilizes the entropy penalty expectation conditional maximal algorithm as a pre-clustering step to estimate the initial parameters.After that,this model introduces l2,1-norm as a self-paced regularization term and developes a new ECM optimization algorithm,in order to select high confidence samples from each component in training.Finally,experimental results on several real-world datasets in different noise environments show that the diversity self-paced t-mixture model outperforms the state-of-the-art clustering methods.It provides significant guidance for the construction of the robust mixture distribution model.

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.

Multi-resolution image segmentation based on Gaussian mixture model

Mixture model based image segmentation method, which assumes that image pixels are independent and do not consider the position relationship between pixels, is not robust to noise and usually leads to misclassification. A new segmentation method, called multi-resolution Ganssian mixture model method, is proposed. First, an image pyramid is constructed and son-father link relationship is built between each level of pyramid. Then the mixture model segmentation method is applied to the top level. The segmentation result on the top level is passed top-down to the bottom level according to the son-father link relationship between levels. The proposed method considers not only local but also global information of image, it overcomes the effect of noise and can obtain better segmentation result. Experimental result demonstrates its effectiveness.

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.

Use of Linear Spectral Mixture Model to Estimate Rice Planted Area Based on MODIS Data

MODIS （Moderate Resolution Imaging Spectroradiometer） is a key instrument aboard the Terra （EOS AM） and Aqua （EOS PM） satellites. Linear spectral mixture models are applied to MOIDS data for the sub-pixel classification of land covers. Shaoxing county of Zhejiang Province in China was chosen to be the study site and early rice was selected as the study crop. The derived proportions of land covers from MODIS pixel using linear spectral mixture models were compared with unsupervised classification derived from TM data acquired on the same day, which implies that MODIS data could be used as satellite data source for rice cultivation area estimation, possibly rice growth monitoring and yield forecasting on the regional scale.

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.

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.

Numerical simulation of slurry jets using mixture model

Slurry jets in a static uniform environment were simulated with a two-phase mixture model in which flow-particle interactions were considered. A standard k-e turbulence model was chosen to close the governing equations. The computational results were in agreement with previous laboratory measurements. The characteristics of the two-phase flow field and the influences of hydraulic and geometric parameters on the distribution of the slurry jets were analyzed on the basis of the computational results. The calculated results reveal that if the initial velocity of the slurry jet is high, the jet spreads less in the radial direction. When the slurry jet is less influenced by the ambient fluid （when the Stokes number St is relatively large）, the turbulent kinetic energy k and turbulent dissipation rate e, which are relatively concentrated around the jet axis, decrease more rapidly after the slurry jet passes through the nozzle. For different values of St, the radial distributions of streamwise velocity and particle volume fraction are both self-similar and fit a Gaussian profile after the slurry jet fully develops. The decay rate of the particle velocity is lower than that of water velocity along the jet axis, and the axial distributions of the centerline particle streamwise velocity are self-similar along the jet axis. The pattern of particle dispersion depends on the Stokes number St. When St = 0.39, the panicle dispersion along the radial direction is considerable, and the relative velocity is very low due to the low dynamic response time. When St = 3.08, the dispersion of particles along the radial direction is very little, and most of the particles have high relative velocities along the streamwise direction.

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.

A Mixture Model Parameters Estimation Algorithm for Inter-Contact Times in Internet of Vehicles

Communication opportunities among vehicles are important for data transmission over the Internet of Vehicles(IoV).Mixture models are appropriate to describe complex spatial-temporal data.By calculating the expectation of hidden variables in vehicle communication,Expectation Maximization(EM)algorithm solves the maximum likelihood estimation of parameters,and then obtains the mixture model of vehicle communication opportunities.However,the EM algorithm requires multiple iterations and each iteration needs to process all the data.Thus its computational complexity is high.A parameter estimation algorithm with low computational complexity based on Bin Count(BC)and Differential Evolution(DE)(PEBCDE)is proposed.It overcomes the disadvantages of the EM algorithm in solving mixture models for big data.In order to reduce the computational complexity of the mixture models in the IoV,massive data are divided into relatively few time intervals and then counted.According to these few counted values,the parameters of the mixture model are obtained by using DE algorithm.Through modeling and analysis of simulation data and instance data,the PEBCDE algorithm is verified and discussed from two aspects,i.e.,accuracy and efficiency.The numerical solution of the probability distribution parameters is obtained,which further provides a more detailed statistical model for the distribution of the opportunity interval of the IoV.

Effective Frameworks Based on Infinite Mixture Model for Real-World Applications

Interest in automated data classification and identification systems has increased over the past years in conjunction with the high demand for artificial intelligence and security applications.In particular,recognizing human activities with accurate results have become a topic of high interest.Although the current tools have reached remarkable successes,it is still a challenging problem due to various uncontrolled environments and conditions.In this paper two statistical frameworks based on nonparametric hierarchical Bayesian models and Gamma distribution are proposed to solve some realworld applications.In particular,two nonparametric hierarchical Bayesian models based on Dirichlet process and Pitman-Yor process are developed.These models are then applied to address the problem of modelling grouped data where observations are organized into groups and these groups are statistically linked by sharing mixture components.The choice of the Gamma mixtures is motivated by its flexibility for modelling heavy-tailed distributions.In addition,deploying the Dirichlet process prior is justified by its advantage of automatically finding the right number of components and providing nice properties.Moreover,a learning step via variational Bayesian setting is presented in a flexible way.The priors over the parameters are selected appropriately and the posteriors are approximated effectively in a closed form.Experimental results based on a real-life applications that concerns texture classification and human actions recognition show the capabilities and effectiveness of the proposed framework.

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.

Parameter Optimization Method for Gaussian Mixture Model with Data Evolution

To learn from evolutionary experimental data points effectively,an evolutionary Gaussian mixture model based on constraint consistency(EGMM)is proposed and the corresponding method of parameter optimization is presented.Here,the Gaussian mixture model(GMM)is adopted to describe the data points,and the differences between the posterior probabilities of pairwise points under the current parameters are introduced to measure the temporal smoothness.Then,parameter optimization of EGMM can be realized by evolutionary clustering.Compared with most of the existing data analysis methods by evolutionary clustering,both the whole features and individual differences of data points are considered in the clustering framework of EGMM.It decreases the algorithm sensitivity to noises and increases the robustness of evaluated parameters.Experimental result shows that the clustering sequence really reflects the shift of data distribution,and the proposed algorithm can provide better clustering quality and temporal smoothness.

Automated segmentation of intraretinal cystoid macular edema based on Gaussian mixture model

We introduce a method based on Gaussian mixture model(GMM)clustering and level-set to automatically detect intraretina fluid on diabetic retinopathy(DR)from spectral domain optical coherence tomography(SD-OCT)images in this paper.First,each B-scan is segmented using GMM clustering.The original chustering results are refined using location and thickness infor-mation.Then,the spatial information among every consecutive five B-scans is used to search potential fluid.Finally,the improved level-set method is used to obtain the accurate boundaries.The high sensitivity and accuracy demonstrated here show its potential for detection of fluid.

A Weighted Spatially Constrained Finite Mixture Model for Image Segmentation

Spatially Constrained Mixture Model(SCMM)is an image segmentation model that works over the framework of maximum a-posteriori and Markov Random Field(MAP-MRF).It developed its own maximization step to be used within this framework.This research has proposed an improvement in the SCMM’s maximization step for segmenting simulated brain Magnetic Resonance Images(MRIs).The improved model is named as the Weighted Spatially Constrained Finite Mixture Model(WSCFMM).To compare the performance of SCMM and WSCFMM,simulated T1-Weighted normal MRIs were segmented.A region of interest(ROI)was extracted from segmented images.The similarity level between the extracted ROI and the ground truth(GT)was found by using the Jaccard and Dice similarity measuring method.According to the Jaccard similarity measuring method,WSCFMM showed an overall improvement of 4.72%,whereas the Dice similarity measuring method provided an overall improvement of 2.65%against the SCMM.Besides,WSCFMM signicantly stabilized and reduced the execution time by showing an improvement of 83.71%.The study concludes that WSCFMM is a stable model and performs better as compared to the SCMM in noisy and noise-free environments.