EMD-IT去噪算法的阈值估计方法

为解决EMD-IT去噪算法中阈值难以确定的问题,提出一种基于高斯白噪声能量分布的阈值估计方法。将含噪信号进行经验模态分解并估计各固有模态函数(IMF)中噪声的能量;根据模态单元阈值的含义,在各IMF中利用去除掉的模态单元包含的总能量等于噪声能量这一准则估计阈值。合成数据和实际心电信号的去噪仿真实验验证了该方法的有效性,其是自适应的且避免了阈值选择的主观性。     

改进的GrabCut方法在舌诊系统中的应用

数字舌象图片的正确分割是实现计算机中医舌诊自动化系统的重要前提,为了高效而准确地分割出舌象,提出了一种基于四叉树与GrabCut的舌象分割方法.该方法首先利用四叉树分解对采集的舌象初分割,然后用相似区域的颜色均值优化GrabCut算法中高斯混合模型参数,最终完成舌象分割.实验结果表明：该算法使得舌象分割效率大大提高,具有很好的实用性.     

THIRD-ORDER ASYMPTOTIC PROPERTIES OF ESTIMATORS IN GAUSSIAN ARMA PROCESSES WITH UNKNOWN MEAN

Abstract. This paper deals with the third-order asymptotic theory for Gaussian autoregressive moving-average (ARMA) processes with unknown mean μ. We are interested in the estimation of ρ = ( α₁…, α_p, β₁…, β_q ), where α ₁…, α_ρ and β ₁…, β_q are the coefficients of the autoregressive part and the moving-average part, respectively. First, we investigate the third-order asymptotic optimality of the bias adjusted maximum likelihood estimator (MLE) of ρ in the presence of the nuisance parameters μ and ² (innovation variance). Next, for a Gaussian AR(1μ μ, ²), we propose a mean corrected estimator α_c1c2 of the autoregressive coefficient. We make a comparison between the bias adjusted estimator α_c1c2* and the bias adjusted MLE, in terms of their probabilities of concentration around the true value, or equivalently, in terms of their mean squared errors. Finally some numerical studies are provided in order to verify the third-order asymptotic theory.     

基于k-最近邻筛选的BMA集合预报模型研究

针对冗余训练样本会降低BMA参数求解效率与精度问题,本文提出在BMA运算之前采用k-最近邻(k-nearest neighbor)算法筛选有价值训练样本,并用于BMA参数求解的改进模型。模拟试验在淮河王家坝站进行,分别以k-最近邻筛选、不筛选两种方案为BMA提供训练样本,统计分析两种方案中王家坝站流量模拟结果,评价BMA改进法的性能。模拟结果显示,采用k-最近邻样本筛选方法后,BMA模型对洪水过程以及洪峰的预报精度提升明显;概率预报结果的离散程度降低的同时,可靠性程度获得提升。k-最近邻样本筛选方法的引入,能够有效去除BMA模型训练样本中的冗余数据,以少量的样本获得更可靠的模型参数,改善集合预报性能。     

Computer-supported mindfulness: Evaluation of a mobile thought distancing application on naive meditators

The last 2 decades have seen a constantly increasing interest in mindfulness, due to its positive effects on health and well-being. Recently, a number of mobile applications aimed at supporting people in practicing mindfulness techniques have appeared, but their efficacy has not been formally evaluated yet. In this paper, we first introduce the reader to mindfulness techniques, traditional as well as computer-based. Then, we propose and evaluate a mobile application (called AEON) aimed at helping users in practicing thought distancing, i.e. a mindfulness technique that requires one not to react in response to his/her thoughts but to be aware of them and observe them while they go away. AEON allows the user to enter his/her thoughts and visualize them as written in ink on a parchment placed under water. By touching the screen, the user can interact with the water and produce waves that progressively dissolve each written thought. We evaluate AEON on a sample of naive meditators (i.e. people with no or minimal experience with meditation), contrasting it with two traditional thought distancing techniques that are not computer-based. The first traditional technique requires users to mentally visualize their thoughts as printed on clouds and observe them as they pass by, while the second requires users to write their thoughts on cards, then pick up the cards one at a time, look at them and toss them into a wastepaper basket. AEON obtained better results in terms of achieved mindfulness, perceived level of difficulty and degree of pleasantness. Since practicing mindfulness tends to be difficult for naive meditators, these results suggest that AEON can be a novel and effective way to help them approach mindfulness.     

Markov随机场与Gaussian曲线在MR图像分割中的应用

针对扫描的人脑组织MR图像边缘分辨率低、模糊性大的特点,本文提出了一种基于模糊Markov随机场和Gaussian曲线相结合的MR图像最佳阈值分割方法。该方法通过对图像的像素邻域属性的统计将模糊论引入其中,建立模糊Markov随机场,并利用Gaussian曲线对二维直方图最佳一维投影进行拟合,确定出图像中各脑组织的二维阈值点,在二维直方图上实现对脑组织的分割。通过实验表明,本算法能够有效提高脑组织的分辨率,对噪声的鲁棒性、结果区域的连通性相对于一维Otsu和二维Otsu算法都有了很大的提高。     

一种基于混合高斯模型的多目标进化算法

目前,大多数多目标进化算法采用为单目标优化所设计的重组算子.通过证明或实验分析了几个典型的单目标优化重组算子并不适合某些多目标优化问题.提出了基于分解技术和混合高斯模型的多目标优化算法（multiobjective evolutionary algorithm based on decomposition and mixture Gaussian models,简称MOEA/D-MG）.该算法首先采用一个改进的混合高斯模型对群体建模并采样产生新个体,然后利用一个贪婪策略来更新群体.针对具有复杂Pareto前沿的多目标优化问题的测试结果表明,对给定的大多数测试题,该算法具有良好的效果.     

Integral approximation—an approach to reduced models for particulate processes

In this contribution, a model reduction technique for population balance systems describing particulate processes is presented. This technique is based on integral approximation and allows the derivation of highly accurate moment models. In contrast to other model reduction methods which can be found in literature, this integral approximation technique can be applied for arbitrarily complex phenomena specifications. The applicability of the presented method will be demonstrated for different example processes by comparing the dynamic behavior of the original population balance models with those of the derived reduced models of moments.     

基于K-L散度的恶意代码模型聚类检测方法

在云计算应用环境下,由于服务系统越来越复杂,网络安全漏洞和被攻击情况急剧增加,传统的恶意代码检测技术和防护模式已无法适应云存储环境的需求。为此,通过引入高斯混合模型,建立恶意代码的分层检测机制,使用信息增益和文档频率等方法分析和提取样本数据特征值,结合K-L散度特性,提出基于K-L散度的恶意代码模型聚类检测方法。采用KDDCUP99数据集,使用Weka开源软件完成数据预处理和聚类分析。实验结果表明,在结合信息增益和文档频率进行特征分析的前提下,与贝叶斯算法相比,该方法在虚拟环境中恶意代码的平均检测时间降低16.6%,恶意代码的平均检测率提高1.05%。     

基于NSST和RI-LPQ的纹理图像检索

针对采用单一方法提取图像特征时检索率不高的问题,结合非下采样剪切波变换(NSST)统计特征和旋转不变的局部相位量化(RI-LPQ)原理,提出一种纹理图像检索方法。非下采样剪切波不仅具有方向选择性及平移不变性,而且可以对图像进行有效的稀疏表示,与传统小波相比,可有效捕捉图像的边缘轮廓等纹理信息,与非下采样轮廓波相比,具有更高的计算效率。利用广义高斯分布函数对图像NSST高频子带系数的统计特征进行分析,RI-LPQ描述算子直接提取图像特征,采用具有权重系数的相似性测度公式对Brodatz图像库进行纹理图像检索。实验结果表明,与传统小波和轮廓波的方法相比,NSST统计特征方法的平均检索率分别提高4.77%和1.44%,纹理图像检索方法的平均检索率分别提高7.36%和1.98%。