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.

ON USING NON-LINEAR CANONICAL CORRELATION ANALYSIS FOR VOICE CONVERSION BASED ON GAUSSIAN MIXTURE MODEL

Voice conversion algorithm aims to provide high level of similarity to the target voice with an acceptable level of quality.The main object of this paper was to build a nonlinear relationship between the parameters for the acoustical features of source and target speaker using Non-Linear Canonical Correlation Analysis(NLCCA) based on jointed Gaussian mixture model.Speaker indi-viduality transformation was achieved mainly by altering vocal tract characteristics represented by Line Spectral Frequencies(LSF).To obtain the transformed speech which sounded more like the target voices,prosody modification is involved through residual prediction.Both objective and subjective evaluations were conducted.The experimental results demonstrated that our proposed algorithm was effective and outperformed the conventional conversion method utilized by the Minimum Mean Square Error(MMSE) estimation.

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.

A GAUSSIAN MIXTURE MODEL-BASED REGULARIZATION METHOD IN ADAPTIVE IMAGE RESTORATION

A GMM (Gaussian Mixture Model) based adaptive image restoration is proposed in this paper. The feature vectors of pixels are selected and extracted. Pixels are clustered into smooth,edge or detail texture region according to variance-sum criteria function of the feature vectors. Then pa-rameters of GMM are calculated by using the statistical information of these feature vectors. GMM predicts the regularization parameter for each pixel adaptively. Hopfield Neural Network (Hopfield-NN) is used to optimize the objective function of image restoration,and network weight value matrix is updated by the output of GMM. Since GMM is used,the regularization parameters share properties of different kind of regions. In addition,the regularization parameters are different from pixel to pixel. GMM-based regularization method is consistent with human visual system,and it has strong gener-alization capability. Comparing with non-adaptive and some adaptive image restoration algorithms,experimental results show that the proposed algorithm obtains more preferable restored images.

A Robust Indoor Localization Algorithm Based on Polynomial Fitting and Gaussian Mixed Model

Wireless sensor network(WSN)positioning has a good effect on indoor positioning,so it has received extensive attention in the field of positioning.Non-line-of sight(NLOS)is a primary challenge in indoor complex environment.In this paper,a robust localization algorithm based on Gaussian mixture model and fitting polynomial is proposed to solve the problem of NLOS error.Firstly,fitting polynomials are used to predict the measured values.The residuals of predicted and measured values are clustered by Gaussian mixture model(GMM).The LOS probability and NLOS probability are calculated according to the clustering centers.The measured values are filtered by Kalman filter(KF),variable parameter unscented Kalman filter(VPUKF)and variable parameter particle filter(VPPF)in turn.The distance value processed by KF and VPUKF and the distance value processed by KF,VPUKF and VPPF are combined according to probability.Finally,the maximum likelihood method is used to calculate the position coordinate estimation.Through simulation comparison,the proposed algorithm has better positioning accuracy than several comparison algorithms in this paper.And it shows strong robustness in strong NLOS environment.

基于GMM和GA-LSTM的稀土熔盐电解过程原料含量状态识别模型

在高温高风险的稀土熔盐电解工艺中,为了实现稀土熔盐电解过程原料含量状态的智能识别,提出了一种基于混合高斯背景建模(GMM)和遗传算法优化的长短期记忆神经网络(GA-LSTM)的分类模型。模型通过GMM算法、R通道自适应滤波和中值滤波准确提取图像的火焰前景和特征,以量化熔盐电解反应的剧烈程度,进而判断稀土熔盐电解处于原料含量过多或含量正常状态;然后利用GA-LSTM神经网络建立熔盐表面火焰特征和稀土熔盐电解过程原料含量状态的非线性映射关系。结果表明:模型的识别精度高达99.79%,具有较好的泛化性,为实现稀土熔盐电解工艺自动化提供了一定的参考价值。

Semantic image annotation based on GMM and random walk model

Automatic image annotation has been an active topic of research in computer vision and pattern recognition for decades.A two stage automatic image annotation method based on Gaussian mixture model(GMM) and random walk model(abbreviated as GMM-RW) is presented.To start with,GMM fitted by the rival penalized expectation maximization(RPEM) algorithm is employed to estimate the posterior probabilities of each annotation keyword.Subsequently,a random walk process over the constructed label similarity graph is implemented to further mine the potential correlations of the candidate annotations so as to capture the refining results,which plays a crucial role in semantic based image retrieval.The contributions exhibited in this work are multifold.First,GMM is exploited to capture the initial semantic annotations,especially the RPEM algorithm is utilized to train the model that can determine the number of components in GMM automatically.Second,a label similarity graph is constructed by a weighted linear combination of label similarity and visual similarity of images associated with the corresponding labels,which is able to avoid the phenomena of polysemy and synonym efficiently during the image annotation process.Third,the random walk is implemented over the constructed label graph to further refine the candidate set of annotations generated by GMM.Conducted experiments on the standard Corel5 k demonstrate that GMM-RW is significantly more effective than several state-of-the-arts regarding their effectiveness and efficiency in the task of automatic image annotation.

基于GMM聚类的铁路网络数据风险等级分类方法

铁路行业信息基础设施及重要信息系统产生的数据种类繁多、数量庞大且价值密度高,而不同类型或等级的铁路网络数据存在不同级别的安全风险。为了完善铁路网络数据风险评估机制,设计一种基于高斯混合模型(GMM,Gaussian Mixture Model)聚类的铁路网络数据风险等级分类方法。从数据和风险角度提取关键信息,构建风险信息数据集;通过K-means聚类获得初始聚类中心;基于混合距离计算进行GMM聚类,实现数据风险等级划分。经实验验证,与传统K-means聚类、谱聚类算法相比,GMM聚类算法对铁路网络数据的聚类效果更优,能够更加准确地对铁路网络数据进行风险等级分类,从而为进一步落实铁路网络数据安全管理要求提供重要的技术支撑。

MODELING INTRAPERSONAL DEFORMATION SUBSPACE USING GMM FOR PALMPRINT IDENTIFICATION

In this paper, an efficient model of palmprint identification is presented based on subspace density estimation using Gaussian Mixture Model (GMM). While a few training samples are available for each person, we use intrapersonal palmprint deformations to train the global GMM instead of modeling GMMs for every class. To reduce the dimension of such variations while preserving density function of sample space, Principle Component Analysis (PCA) is used to find the principle differences and form the Intrapersonal Deformation Subspace (IDS). After training GMM using Expectation Maximization (EM) algorithm in IDS, a maximum likelihood strategy is carried out to identify a person. Experimental results demonstrate the advantage of our method compared with traditional PCA method and single Gaussian strategy.

基于改进JRD及误差修正的轴承剩余寿命预测方法

目前,风电机组齿轮箱性能发生初始退化时难以识别,现有退化指标易出现剧烈波动、单调性较差,且无法准确预测齿轮箱关键部件如轴承的剩余使用寿命(RUL),针对该问题,提出了一种基于改进杰森-瑞丽散度(JRD)及误差修正的双指数模型轴承RUL预测方法。首先,提取了振动信号样本的多域特征指标,利用高斯混合模型(GMM)与指数型权重JRD,得到了样本的后验概率分布向量,再经归一化处理得到置信值(CV);然后,对轴承从初始健康状态退化至当前检查时刻的CV值进行了相空间重构,提取了CV序列的动力学特征,并将其作为相关向量机(RVM)的训练集,获得了支撑整个退化轨迹的相关向量;最后,利用双指数模型拟合了相关向量,外推趋势至失效门限以计算RUL,并引入了差分整合移动平均自回归模型(ARIMA),对拟合相关向量产生的拟合误差进行了预测,以修正预测的结果。实验结果表明:改进后的退化指标单调性指标提高14.3%;且在不同工况、不同时刻下,经误差修正后的轴承的RUL预测结果较未修正之前有明显提高。研究结果表明:该预测方法可为风电机组齿轮箱重要部件的预测性维护提供参考。

高斯混合模型与文本图卷积网络结合的虚假评论识别算法

针对文本图卷积网络(Text GCN)窗口边权阈值策略不足的问题,为了更精准地挖掘相关的词关联结构、提高预测精度,提出一种高斯混合模型(GMM)与Text GCN结合的虚假评论识别算法F-Text GCN。首先,利用GMM分离噪声边权分布的特性,提高虚假评论在训练数据上相对正常评论数不足的边信号强度;然后,考虑到信源的多样性,综合文档、词汇和评论以及非文本特征构造邻接矩阵;最后,通过Text GCN的谱分解提取邻接矩阵的虚假评论关联结构实施预测。根据国内某大型电商平台采集的126086条实际中文评论数据开展实证研究,实验结果表明,F-Text GCN识别虚假评论的F1值达到82.92%,与预训练表征模型BERT和文本卷积神经网络相比分别提升了10.46%和11.60%,相较于只使用评论文本信源的Text GCN模型F1值提升了2.94%;研究了高仿虚假评论的预测错误率,在支持向量机(SVM)作用后难识别的评论样本上尝试二次识别,F-Text GCN整体预测准确率可达94.71%,相较于Text GCN和SVM,在识别准确率上分别提升了2.91%和14.54%。研究发现,虚假评论的二阶图邻居结构显示出较强的干预消费者决策的词汇,这表明所提算法特别适用于提取用于虚假评论检测的长程词语搭配结构和全局句子特征模式变化的场景。

改进的基于GMM的运动目标检测方法

针对传统混合高斯背景建模(GMM)在一些复杂场景下未能有效地描述背景,提出了一种改进算法。该算法引入更新和消退控制因子改进参数更新模型,并定量约束运动目标停留时间,采用从时间域上过滤得到的快速变化的背景进行背景减除操作,最后在空间域上对检测结果进行数学形态学的处理。实验结果表明,该算法能够提高背景建立和形成速度,增强对背景扰动和光照变化的抗干扰能力,对固定摄像机场景下运动目标的检测具有良好的鲁棒性。

基于分裂EM算法的GMM参数估计

期望最大化(Expectation Maximization,EM)算法是一种求参数极大似然估计的迭代算法,常用来估计混合密度分布模型的参数。EM算法的主要问题是参数初始化依赖于先验知识且在迭代过程中容易收敛到局部极大值。提出一种新的基于分裂EM算法的GMM参数估计算法,该方法从一个确定的单高斯分布开始,在EM优化过程中逐渐分裂并估计混合分布的参数,解决了参数迭代收敛到局部极值问题。大量的实验表明,与现有的其他参数估计算法相比,算法具有较好的运算效率和估算准确性。

基于GMM的间歇过程故障检测

对间歇过程的多操作阶段进行划分时,往往会被离群点和噪声干扰,影响建模的精确性,针对此问题提出一种新的方法:主元分析–多方向高斯混合模型(Principal component analysis-multiple Gaussian mixture model,PCA-MGMM)建模方法.首先用最短长度法对数据进行等长处理,融合不同展开方法相结合的处理方式消除数据预估问题;利用主元分析方法将数据转换到对故障较为敏感的低维子空间中,得到主元的同时消除了离群点和噪声的干扰;通过改进的高斯混合模型(Gaussian mixture model,GMM)算法对各阶段主元进行聚类,减少了运算量的同时自动得到最佳高斯成分和对应的统计分布参数;最后将局部指标融合为全局概率监控指标,实现了连续的在线监控.通过一个实际的半导体制造过程的仿真研究验证了所提方法的有效性.

基于EM和GMM相结合的自适应灰度图像分割算法

提出一种阈值自适应、EM方法估计GMM参量的图像分割算法,能够根据图像的内容结合区域和边界两方面的信息自适应地选择阈值,精确地进行图像边界分割.算法首先提取图像的边界,然后根据边界的直方图计算图像的可分割性,由可分割性确定EM方法的阈值进行GMM分割,最后合并图像的近似区域.实验数据表明,相比其它图像分割算法,以及固定阈值的传统EM算法,本算法的分割结果更为准确.

融合GMM及SVM的特定音频事件高精度识别方法

针对特定音频事件识别中持续时间特别短的音频事件漏检概率高、识别速度较慢的问题,提出一种融合高斯混合模型(GMM)及支持向量机(SVM)的特定音频事件识别算法.该方法利用GMM的统计分布描述能力和SVM的推广泛化能力,将GMM和SVM分别识别的结果进行融合处理,以手枪、步枪、机关枪等10类以上枪声为实验数据,无需针对每种枪声生成相应的识别模板,仅需训练生成2个识别模板.实验结果表明,识别准确率达到92.71%.该方法模板数量少,不需要多次训练,算法复杂度较低,不仅便于应用而且可大幅提升识别效率.

融入空间关系的GMM全色高分辨率遥感影像监督分割方法

为了解决高分辨率遥感影像中相同地物目标异质性和空间破碎性增大及不同地物目标的相似性增强所带来的分割新问题,该文提出一种融入空间关系的高斯混合模型(GMM)高分辨遥感影像监督分割方法。该方法首先按分割区域进行监督采样,并通过最小二乘法进行直方图拟合,对影像中的每个类别区域建立GMM用来精确表征高分辨遥感影像每个分割区域复杂的地物光谱特征;然后在GMM的概率测度域融入空间关系,使每个像素的区域所属由该像素邻域窗口内所有像素概率测度共同决定,以刻画高分辨率遥感影像中像素间的空间相关性;最后按照最大概率测度原则完成对高分辨率遥感影像的分割。为了验证文中算法的可行性与有效性分别对合成影像及真实高分辨率遥感影像进行分割实验,并和经典的FCM方法及HMRF-FCM方法进行对比,定量与定性的结果证明了文中方法能够提高分割精度。

基于MFCC和GMM的昆虫声音自动识别

昆虫的运动、取食、鸣叫都会发出声音,这些声音存在种内相似性和种间差异性,因此可用来识别昆虫的种类。基于昆虫声音的昆虫种类自动检测技术对协助农业和林业从业人员方便地识别昆虫种类非常有意义。本研究采用了语音识别领域里的声音参数化技术来实现昆虫的声音自动鉴别。声音样本经预处理后,提取梅尔倒谱系数(Mel-frequency cepstrum coefficient,MFCC)作为特征,并用这些样本提取的MFCC特征集训练混合高斯模型(Gaussian mixturemodel,GMM)。最后用训练所得到的GMM对未知类别的昆虫声音样本进行分类。该方法在包含58种昆虫声音的样本库中进行了评估,取得了较高的识别正确率(平均精度为98.95%)和较理想的时间性能。该测试结果证明了基于MFCC和GMM的语音参数化技术可以用来有效地识别昆虫种类。

基于改进GMM的耳语语音情感识别方法研究

提出一种基于改进GMM模型的耳语情感语音识别方法。该方法在GMM的每个成员通过用矢量量化误差值取代传统GMM的输出概率值来计算模型的得分,使得建模时所需训练数据量减少,并且识别速度有所提高。实验结果表明当训练数据较少时,提出的新的识别方法的实验结果明显好于传统的GMM方法,证明了该方法的有效性。