Nonuniform linear array DOA estimation using EM criterion

In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources.     

Explaining IS continuance in environments where usage is mandatory

Several research efforts over the last decade have attempted to explain user acceptance in mandated environments. This research is an attempt in the same direction. It addresses users’ satisfaction in mandated environments to further contribute to our understanding of how we can manage mandated use of information systems (IS) effectively beyond initial adoption. To better explain users’ IS continuance a revised post-acceptance model is proposed and empirically tested using the structural equation modelling technique. The results demonstrate the reliability and validity of the proposed measurement model and further demonstrate that confirmed expectations and ease of use perceptions explain 61% of the users’ satisfaction in this setting. Our findings have important implications for the management of users in mandated environments as well as for further research in the area of mandated use. To that end, we offer directions for future research.     

Segment-based adaptive hyper-Erlang model for long-tailed network traffic approximation

Modeling the long-tailedness property of network traffic with phase-type distributions is a powerful means to facilitate the consequent performance evaluation and queuing based analysis. This paper improves the recently proposed Fixed Hyper-Erlang model (FHE) by introducing an adaptive framework (Adaptive Hyper-Erlang model, AHE) to determine the crucially performance-sensitive model parameters. The adaptive model fits long-tailed traffic data set directly with a mixed Erlang distribution in a new divide-and-conquer manner. Compared with the well-known hyperexponential based models and the Fixed Hyper-Erlang model, the Adaptive Hyper-Erlang model is more flexible and practicable in addition to its accuracy in fitting the tail behavior.

基于局部区域能量最小化模型的图像分割

在马尔可夫随机场(MRF)和概率理论的基础上,提出局部区域能量最小化模型,将传统基于像素的分割转化为基于区域的分割,能减小均匀区域中的误分类率。在该模型和MRF模型下,使用ICM算法、Gibbs采样算法、Metropolis采样算法对图像进行分割,结果表明该模型能取得更精确的分割结果,可有效拟制图像噪音和纹理对分割的影响。     

基于CSMDEM算法的GMM学习方法

基于Mahalanobis距离的EM(MDEM)算法存在过分裂问题。为此,提出一种竞争结束MDEM(CSMDEM)算法。该算法将最小描述长度准则作为竞争结束条件嵌入到MDEM算法中,能够在估计混合模型参数的同时选择模型阶数。实验结果表明,该算法具有较低的平均EM迭代次数,能够较好地拟合高斯混合模型。当其被应用到跳频网台分选时,能够以较高的正确率分选跳频信号。     

改进的FCM与局部信息相结合的图像分割

传统的EM算法和FCM算法分割精度低,时间消耗大。为解决以上不足,提出了一种基于EM、FCM和KCN三种算法相结合的全新的图像分割算法。该算法有较好的分割精度。考虑到图像会受到噪声的干扰,在改进算法的基础上又引入图像的局部信息。首先利用图像的局部信息重塑图像的灰度直方图,增强了像素的类间散布性和类内紧凑性,然后让改进的算法在重塑图像上执行。实验结果表明,该算法具有很好的分割效果和较强的抗噪性能。     

字符分布特征对带有通配符串匹配问题的影响

近年来,字符串匹配问题被不断扩展。其中,具有代表性的是在模式中引入可变长度的通配符,本文称之为PMWL问题。针对此问题,已有工作分析了在不同的模式特征下,匹配数Ω随文本长度增加呈指数级增长。本文同时考虑文本分布特征和模式特征,建立了期望模型E(Ω)＝n*D*π(P),其中n为文本长度,D为模式中各通配符跨度的乘积,π(P)为基于字符分布的模式出现概率。实验部分,在人工随机数据和DNA真实数据上验证了E(Ω)的准确性,得到预测误差率分别为1.8%~3.2%和4.7%~7.8%;在不同字符分布中,分析了模式模长和通配符跨度对匹配数Ω的影响。E(Ω)模型揭示了Ω的增长趋势不一定呈指数级,而取决于π(P)和D的共同影响。此外,E(Ω)模型能够在线性时间内得到近似完备解。     

位置信息记录中基于期望最大化的名称消重算法

在包含位置信息的签到记录中,每条记录仅包含名称和位置(经纬度)两个属性。传统的名称消重算法通过匹配实体的属性值或者计算实体间的名称相似性进行消重,忽略了位置信息的特殊性。为了提高位置信息记录中名称消重的质量,提出了一种基于期望最大化的位置名称消重算法。首先,提出了一种包含核心单词和背景单词的文本名称模型,并给出了计算模型参数值的期望最大化算法。其次,在文本名称模型中引入位置信息,将整个地图划分为若干个网格,分别计算每个网格中核心单词和背景单词的分布情况,并提出了一种考虑位置的文本名称模型。最后,将位置文本名称模型用于位置信息记录中的名称消重,并给出了相应的名称消重算法。实验表明, 与传统的名称消重模型相比,提出的位置名称消重模型可以更好地识别出名称中包含的核心词汇,因而在名称消重时具有更好的性能。     

基于EM算法的混合模型医学图像分割

医学图像分割中的期望最大化(EM)算法在求解混合模型参数时存在局限性。为此,提出一种模糊约束的混合模型图像分割算法。该算法以像素的独立性假设为前提,在采用EM算法对模型参数进行求解的过程中,通过模糊集合论方法,引入像素空间信息。实验结果表明,该算法没有引入新的模型参数,能够保持独立混合模型的简单性,且具有自动模型选择能力,可以获得较理想的分割结果。     

Learning mixtures of point distribution models with the EM algorithm

This paper demonstrates how the EM algorithm can be used for learning and matching mixtures of point distribution models. We make two contributions. First, we show how shape-classes can be learned in an unsupervised manner. We present a fast procedure for training point distribution models using the EM algorithm. Rather than estimating the class means and covariance matrices needed to construct the PDM, the method iteratively refines the eigenvectors of the covariance matrix using a gradient ascent technique. Second, we show how recognition by alignment can be realised by fitting a mixture of linear shape deformations. We evaluate the method on the problem of learning the class-structure and recognising Arabic characters.