基于多阶抽样的高斯混合模型彩色图像分割

针对传统高斯混合模型应用于彩色图像分割时计算复杂度高等问题, 提出一种多阶抽样的高斯混合模型的彩色图像分割算法。首先,给出采样数定理及其证明,并推导出与聚类类别数和最小聚类相关的最小采样数目;其次,设计一罚函数判断抽样优劣,消除抽样对聚类模型影响,根据最小采样数数目,对像素点进行均匀采样,并利用高斯混合模型对采样像素点进行聚类;最后,定义像素点和类之间的距离,对剩余的像素点按距离最近原则进行划分。实验结果表明算法具有有效性。     

基于示波法和高斯拟合的血压测量方法

流行病学调查及大规模前瞻性研究表明,高血压是心血管疾病的独立风险因素,采用电子血压计进行自助式日常血压监护,是预防严重心血管事件的重要途径。提出了一种设计电子血压计的新方法:首先确定振荡波中各个单波的峰值点;然后确定拟合振荡波包络线的最佳拟合曲线;进而查找包络线的最大值,选定积分区间,提出的积分公式和最大值的位置,确定舒张压和收缩压的位置,最后确定舒张压和收缩压。比较该方法与听诊法测得的血压,结果证明使用所介绍的方法测得的血压精度符合AAM I标准、BHS(B)级标准。说明该方法是适用的,使用该方法所设计的电子血压计可以用于血压的日常监护。     

基于学习的群体动画生成技术研究

为了降低群体动画中生成大量自然而又相似的人体运动的难度和复杂性,研究了一种基于学习的群体动画生成技术。该技术首先通过建立基于高斯过程隐变量模型和隐空间动态模型的运动姿势学习模型,将高维运动姿势映射到低维隐空间中,并在低维隐空间对相邻姿势的动态演化进行建模;然后通过对已有运动数据的学习来获得组成该运动的姿势的概率分布,再通过隐空间中的动态预测和Hybrid Monte Carlo采样来得到符合给定概率分布的隐轨迹;最后通过姿势重构来得到与原运动非常相似但又不同的一系列自然的运动,以产生群体动画,从而避开了传统的基于几何和物理约束的逆运动方法固有的困难和复杂性。     

基于高斯混合模型的阴影消除算法

关于阴影消除是智能监控系统的重要组成部分,且对后续的识别和跟踪有很大的影响。根据改进的高斯混合模型检测出目标,用高斯混合阴影模型来检测阴影,并用高斯平滑滤波处理检测的结果。然后动态选择合适的阈值对图像做二值化处理,进一步对结果进行形态学滤波。经过整个过程的处理,得到了较为完整的轮廓,很好的消除了阴影,提高后续的识别和跟踪的准确性和可靠性。实验表明,算法能较好地消除阴影,且具有较好的实时性和鲁棒性。     

智能视频监控系统中物体遗留检测方法的研究

本文针对智能视频监控中的物体遗留事件检测进行了研究,给出了一套完整的检测方案。多高斯模型用于运动目标检测,其自适应性很好地解决了背景帧不断变化所带来的影响;MeanShift算法用于运动目标的跟踪,使得监控对象不再限于固定区域;目标的七阶不变矩可以很好地描述目标特征,利用这一特征通过支持向量机对目标进行识别。实验结果证明了本文方法的有效性。     

基于混合高斯模型的目标差分自适应背景模型

提出一种自适应背景更新率的方法。在混合高斯背景模型基础上。通过混合高斯匹配将前后两帧分割出的运动目标作差分。差分后再次采用混合高斯匹配分辨出过去目标区和当前目标区。在背景更新的过程中,加大过去目标区的更新率,让运动目标在出现停滞状态时给背景模型带来的干扰区域得到快速恢复。试验结果表明,该方法有效地提高背景模型的鲁棒性。     

Multi-strategy ensemble particle swarm optimization for dynamic optimization

Optimization in dynamic environments is important in real-world applications, which requires the optimization algorithms to be able to find and track the changing optimum efficiently over time. Among various algorithms for dynamic optimization, particle swarm optimization algorithms (PSOs) are attracting more and more attentions in recent years, due to their ability of keeping good balance between convergence and diversity maintenance. To tackle the challenges of dynamic optimization, several strategies have been proposed to enhance the performance of PSO, and have gained success on various dynamic optimization problems. But there still exist some issues in dynamic optimization which need to be studied carefully, i.e. the robustness of the algorithm to problems of various dynamic features. In this paper, a new multi-strategy ensemble particle swarm optimization (MEPSO) for dynamic optimization is proposed. In MEPSO, all particles are divided into two parts, denoted as part I and part II, respectively. Two new strategies, Gaussian local search and differential mutation, are introduced into these two parts, respectively. Experimental analyses reveal that the mechanisms used in part I can enhance the convergence ability of the algorithm, while mechanisms used in part II can extend the searching area of the particle population to avoid being trapped into the local optimum, and can enhance the ability of catching up with the changing optimum in dynamic environments. The whole algorithm has few parameters that need to be tuned, and all of them are not sensitive to problems. We compared MEPSO with other PSOs, including MQSO, PHPSO and Standard PSO with re-initialization, on moving peaks Benchmark and dynamic Rastrigin function. The experimental results show that MEPSO has pretty good performance on almost all testing problems adopted in this paper, and outperforms other algorithms when the dynamic environment is unimodal and changes severely, or has a great number of local optima as dynamic Rastrigin function does.     

Type-2 fuzzy Gaussian mixture models

This paper presents a new extension of Gaussian mixture models (GMMs) based on type-2 fuzzy sets (T2 FSs) referred to as T2 FGMMs. The estimated parameters of the GMM may not accurately reflect the underlying distributions of the observations because of insufficient and noisy data in real-world problems. By three-dimensional membership functions of T2 FSs, T2 FGMMs use footprint of uncertainty (FOU) as well as interval secondary membership functions to handle GMMs uncertain mean vector or uncertain covariance matrix, and thus GMMs parameters vary anywhere in an interval with uniform possibilities. As a result, the likelihood of the T2 FGMM becomes an interval rather than a precise real number to account for GMMs uncertainty. These interval likelihoods are then processed by the generalized linear model (GLM) for classification decision-making. In this paper we focus on the role of the FOU in pattern classification. Multi-category classification on different data sets from UCI repository shows that T2 FGMMs are consistently as good as or better than GMMs in case of insufficient training data, and are also insensitive to different areas of the FOU. Based on T2 FGMMs, we extend hidden Markov models (HMMs) to type-2 fuzzy HMMs (T2 FHMMs). Phoneme classification in the babble noise shows that T2 FHMMs outperform classical HMMs in terms of the robustness and classification rate. We also find that the larger area of the FOU in T2 FHMMs with uncertain mean vectors performs better in classification when the signal-to-noise ratio is lower.     

一种新的基于遗传操作的改进型遗传算法

交叉与变异是遗传算法的重要操作,提出了一种新的基于遗传操作的改进型遗传算法.采用最优保留和改进的轮盘赌选择方法,通过基因交叉概率控制交叉,根据高斯分布改进了交叉算子和变异算子,保证了算法的全局搜索能力、局部搜索能力及收敛速度.通过标准函数的数值实验,验证了新算法的有效性.