An expectation-maximization method for spatio-temporal blind source separation using an AR-MOG source model.

In this paper, we develop a maximum-likelihood (ML) spatio-temporal blind source separation (BSS) algorithm, where the temporal dependencies are explained by assuming that each source is an autoregressive (AR) process and the distribution of the associated independent identically distributed (i.i.d.) innovations process is described using a mixture of Gaussians. Unlike most ML methods, the proposed algorithm takes into account both spatial and temporal information, optimization is performed using the expectation-maximization (EM) method, the source model is adapted to maximize the likelihood, and the update equations have a simple, analytical form. The proposed method, which we refer to as autoregressive mixture of Gaussians (AR-MOG), outperforms nine other methods for artificial mixtures of real audio. We also show results for using AR-MOG to extract the fetal cardiac signal from real magnetocardiographic (MCG) data.     

Dual multivariate auto-regressive modeling in state space for temporal signal separation

Many existing independent component analysis (ICA) approaches result in deteriorated performance in temporal source separation because they have not taken into consideration of the underlying temporal structure of sources. In this paper, we model temporal sources as a general multivariate auto-regressive (AR) process whereby an underlying multivariate AR process in observation space is obtained. In this dual AR modeling, the mixing process from temporal sources to observations is the same as the mixture from the nontemporal residuals of the source AR (SAR) process to that of the observation AR (OAR) process. We can therefore avoid the source temporal effects in performing ICA by learning the demixing system on the independently distributed OAR residuals rather than the time-correlated observations. Particularly, we implement this approach by modeling each source signal as a finite mixture of generalized autoregressive conditional heteroskedastic (GARCH) process. The adaptive algorithms are proposed to extract the OAR residuals appropriately online, together with learning the demixing system via a nontemporal ICA algorithm. The experiments have shown its superior performance on temporal source separation.     

Underdetermined Convolutive Blind Source Separation via Time–Frequency Masking

In this paper, we consider the problem of separation of unknown number of sources from their underdetermined convolutive mixtures via time-frequency (TF) masking. We propose two algorithms, one for the estimation of the masks which are to be applied to the mixture in the TF domain for the separation of signals in the frequency domain, and the other for solving the permutation problem. The algorithm for mask estimation is based on the concept of angles in complex vector space. Unlike the previously reported methods, the algorithm does not require any estimation of the mixing matrix or the source positions for mask estimation. The algorithm clusters the mixture samples in the TF domain based on the Hermitian angle between the sample vector and a reference vector using the well known k -means or fuzzy c -means clustering algorithms. The membership functions so obtained from the clustering algorithms are directly used as the masks. The algorithm for solving the permutation problem clusters the estimated masks by using k-means clustering of small groups of nearby masks with overlap. The effectiveness of the algorithm in separating the sources, including collinear sources, from their underdetermined convolutive mixtures obtained in a real room environment, is demonstrated.     

Bayesian nonstationary source separation

A Bayesian nonstationary source separation algorithm is proposed in this paper to recover nonstationary sources from noisy mixtures. In order to exploit the temporal structure of the data, we use a time-varying autoregressive (TVAR) process to model each source signal. Then variational Bayesian (VB) learning is adopted to integrate the source model with blind source separation (BSS) in probabilistic form. Our separation algorithm makes full use of temporally correlated prior information and avoids overfitting in separation process. Experimental results demonstrate that our vbICA-TVAR algorithm learns the temporal structure of sources and acquires cleaner source reconstruction.     

A Semi-supervised Learning Algorithm on Gaussian Mixture with Automatic Model Selection

In Gaussian mixture modeling, it is crucial to select the number of Gaussians for a sample set, which becomes much more difficult when the overlap in the mixture is larger. Under regularization theory, we aim to solve this problem using a semi-supervised learning algorithm through incorporating pairwise constraints into entropy regularized likelihood (ERL) learning which can make automatic model selection for Gaussian mixture. The simulation experiments further demonstrate that the presented semi-supervised learning algorithm (i.e., the constrained ERL learning algorithm) can automatically detect the number of Gaussians with a good parameter estimation, even when two or more actual Gaussians in the mixture are overlapped at a high degree. Moreover, the constrained ERL learning algorithm leads to some promising results when applied to iris data classification and image database categorization.     

Blind Source Separation of Postnonlinear Convolutive Mixture

In this paper, a novel solution is developed to solve blind source separation of postnonlinear convolutive mixtures. The proposed model extends the conventional linear instantaneous mixture model to include both convolutive mixing and postnonlinear distortion. The maximum-likelihood (ML) approach solution based on the expectation-maximization (EM) algorithm is developed to estimate the source signals and the parameters in the proposed nonlinear model. In the proposed solution, the sufficient statistics associated with the source signals are estimated in the E-step, while the model parameters are optimized through these statistics in the M-step. However, the complication resulted from the postnonlinear function associated with the mixture renders these statistics difficult to be formulated in a closed form and hence causes intractability in the parameter optimization. A computationally efficient algorithm is proposed which uses the extended Kalman smoother (EKS) to facilitate the E-step tractable and a set of self-updated polynomials is used as the nonlinearity estimator to facilitate closed form estimations of the parameters in the M-step. The theoretical foundation of the proposed solution has been rigorously developed and discussed in details. Both simulations and recorded speech signals have been carried out to verify the success and efficacy of the proposed algorithm. Remarkable improvement has been obtained when compared with the existing algorithms.     

Simplifying mixture models using the unscented transform

Mixture of Gaussians (MoG) model is a useful tool in statistical learning. In many learning processes that are based on mixture models, computational requirements are very demanding due to the large number of components involved in the model. We propose a novel algorithm for learning a simplified representation of a Gaussian mixture, that is based on the Unscented Transform which was introduced for filtering nonlinear dynamical systems. The superiority of the proposed method is validated on both simulation experiments and categorization of a real image database. The proposed categorization methodology is based on modeling each image using a Gaussian mixture model. A category model is obtained by learning a simplified mixture model from all the images in the category.     

基于自适应混合高斯模型的时空背景建模

提出了一种基于自适应混合髙斯模型的时空背景建模方法, 有效地融合了像素在时空域上的分布信息, 改善了传统的混合髙斯背景建模方法对非平稳场景较为敏感的缺点. 首先利用混合髙斯模型学习每个像素在时间域上的分布, 构造了基于像素的时间域背景模型, 在此基础上, 通过非参数密度估计方法统计每个像素邻域内表示背景的髙斯成分在空间上的分布, 构造了基于像素的空间域背景模型; 在决策层融合了基于时空背景模型的背景减除结果. 为了提高本文时空背景建模的效率, 提出了一种新的混合高斯模型髙斯成分个数的自适应选择策略, 并利用积分图实现了空间域背景模型的快速计算. 通过在不同的场景下与多个背景建模方法比较, 实验结果验证了本文算法的有效性.     

Sparse Bayesian Learning for non-Gaussian sources

In this paper, we show that in the multiple measurement vector model we can take advantage of having multiple samples to learn the properties of the distributions of the sources as part of the recovery process and demonstrate that this improves the recovery performance. We propose a method to solve the simultaneous sparse approximation problem using a mixture of Gaussians prior, inspired by existing Sparse Bayesian Learning approaches. We justify our proposed prior by showing that there are a number of signals modelled better by a mixture of Gaussians prior than the standard zero-mean Gaussian prior, such as communications signals which often have a multimodal distribution. We further show that this method can be applied to data distributed according to an alpha-stable distribution. We also show that our proposed method can be applied to compressed sensing of ultrasound images and demonstrate an improvement over existing methods.     

基于先验估计的传播中心溯源算法

针对多数信息传播溯源算法未考虑先验估计对溯源的作用和价值,造成溯源检测率较低、错误距离较大等问题,文中利用易感-感染模型(SI)模拟信息在加权网络上的传播过程,提出基于先验估计的传播中心溯源算法.算法综合考虑邻居节点中感染节点和未被感染节点,根据它们的数量关系作为源节点先验估计值,有效弥补现有溯源算法先验估计不足的缺陷.在人工网络和真实网络上的实验表明,文中算法检测率较高、错误距离较小、真实源节点排名精确度较高.     

一种基于区域的彩色图像分割方法

介绍了一种基于区域的彩色图像分割方法。该方法首先提取图像像素点的颜色、纹理等特征,然后采用Gaussian混合模型,通过EM算法学习,根据提出的选择最佳高斯混合模型参数K的准则,确定K,利用图像像素点特征的相似度在特征空间中粗略的将像素点划分为不同的组,最后在各个组内依据其位置信息对图像再进一步划分,得到图像的区域分割。实验结果表明,该分割方法具有较好的分割性能。     

面向细粒度源代码变更的缺陷预测方法

软件在其生命周期中不断地发生变更,以适应需求和环境的变化。为了及时预测每次变更是否引入了缺陷,研究者们提出了面向软件源代码变更的缺陷预测方法。然而现有方法存在以下3点不足：(1)仅实现了较粗粒度(事务级和源文件级变更)的预测;(2)仅采用向量空间模型表征变更,没有充分挖掘蕴藏在软件库中的程序结构、自然语言语义以及历史等信息;(3)仅探讨较短时间范围内的预测,未考虑在长时间软件演化过程中由于新需求或人员重组等外界因素所带来的概念漂移问题。针对现有的不足,提出一种面向源代码变更的缺陷预测方法。该方法将细粒度(语句级)变更作为预测对象,从而有效降低了质量保证成本;采用程序静态分析和自然语言语义主题推断相结合的技术深入挖掘软件库,从变更的上下文、内容、时间以及人员4个方面构建特征集,从而揭示了变更易于引入缺陷的因素;采用特征熵差值矩阵分析了软件演化过程中概念漂移问题的特点,并通过一种伴随概念回顾的动态窗口学习机制实现了长时间的稳定预测。通过6个著名开源软件验证了该方法的有效性。     

Independent Component Analysis for Time-dependent Processes Using AR Source Model

Independent component analysis is a fundamental and important task in unsupervised learning, that was studied mainly in the domain of Hebbian learning. In this paper, the temporal dependencies are explained by assuming that each source is an autoregressive (AR) process and innovations are independently and identically distributed (i.i.d). First, the likelihood of the model is derived, which takes into account both spatial and temporal information of the sources. Next, batch and on-line blind source separation algorithms are developed by maximizing likelihood function, and their local stability analysis are introduced simultaneously. Finally, computer simulations show that the algorithms achieve better separation of the mixed signals and mixed nature images which are difficult to be separated by the basic independent component analysis algorithms.     

Positive vectors clustering using inverted Dirichlet finite mixture models

In this work we present an unsupervised algorithm for learning finite mixture models from multivariate positive data. Indeed, this kind of data appears naturally in many applications, yet it has not been adequately addressed in the past. This mixture model is based on the inverted Dirichlet distribution, which offers a good representation and modeling of positive non-Gaussian data. The proposed approach for estimating the parameters of an inverted Dirichlet mixture is based on the maximum likelihood (ML) using Newton Raphson method. We also develop an approach, based on the minimum message length (MML) criterion, to select the optimal number of clusters to represent the data using such a mixture. Experimental results are presented using artificial histograms and real data sets. The challenging problem of software modules classification is investigated within the proposed statistical framework, also.     

MIMO-OFDM系统中一种改进的最大似然信道估计算法*

对MIMO-OFDM系统中的信道估计进行研究,提出了一种对最大似然（ML）算法的改进,该算法首先采用ML算法获得初始估计值,然后联合检测进行迭代信道估计,充分利用上了接收端联合数据检测得到的数据信号信息与信道估计进行信息交互来提高估计性能,仿真结果表明,相对于传统估计方法,这种改进方法能够得到更好的均方误差和误码率性能,尤其是在导频数量较少时,此改进算法的性能提升将更明显。     

Blind Source Separation Using Quadratic form Innovation

Blind source separation (BSS) is an increasingly popular data analysis technique with many applications. Several methods for BSS using the statistical properties of original sources have been proposed, for a famous one, such as non-Gaussianity, which leads to independent component analysis (ICA). This paper proposes a blind source separation method based on a novel statistical property: the quadratic form innovation of original sources, which includes linear predictability and energy (square) predictability as special cases. A gradient learning algorithm is presented by minimizing a loss function of the quadratic form innovation. Also, we give the stability analysis of the proposed BSS algorithm. Simulations verify the efficient implementation of the proposed method.     

基于Delaunay四面体剖分的网格分割算法

为了构建有意义曲面分片,提出一种基于Delaunay四面体剖分的网格分割算法.首先根据Delaunay四面体剖分得到多边形网格内部的四面体,求出每个面上反映网格内部信息的Delaunay体距离;然后对Delaunay体距离进行平滑处理,再对网格上面的Delaunay体距离进行聚类,用高斯混合模型对Delaunay体距离作柱状图的拟合,利用期望最大化算法来快速求得拟合结果;最后结合图切分技术,同时考虑聚类的结果、分割区域的边界平滑和视觉认知中的最小规则,得到最终的网格分割结果.实验结果表明,采用文中算法可以有效地实现有意义的网格分割.     

基于最大后验估计的谣言源定位器

随着互联网的普及,信息能够通过互联网以极快的速度被传播给大众。但同时,一些虚假信息比如谣言也借助网络的级联效应泛滥成灾,因此如何在传播网络中快速准确地确定谣言传播源成为一个亟待解决的问题。文章针对社交网络提出了一种谣言源定位的方法,与现有的基于最大后验(Maximum-a-posteriori,MAP)概率估计的方法不同,该方法首先考虑全局和局部感染点、非感染点的影响,使用效果更优的MAP先验概率估计(Prior Probability Estimation,PPE)计算方式。然后基于最小生成树贪心算法来稀疏化社交网络,让MAP中的似然估计(Likelihood Estimation,LE)计算更符合真实的传播结构。最后,采用新的MAP值来估计传播网络中节点为传播源的可能性,从而更准确地定位谣言源点。将所提方法与现有的几种方法分别在模型网络和真实网络中进行了对比,实验结果表明,所提方法优于现有的谣言源定位方法。     

Background subtraction using finite mixtures of asymmetric Gaussian distributions and shadow detection

Foreground segmentation of moving regions in image sequences is a fundamental step in many vision systems including automated video surveillance, human-machine interface, and optical motion capture. Many models have been introduced to deal with the problems of modeling the background and detecting the moving objects in the scene. One of the successful solutions to these problems is the use of the well-known adaptive Gaussian mixture model. However, this method suffers from some drawbacks. Modeling the background using the Gaussian mixture implies the assumption that the background and foreground distributions are Gaussians which is not always the case for most environments. In addition, it is unable to distinguish between moving shadows and moving objects. In this paper, we try to overcome these problem using a mixture of asymmetric Gaussians to enhance the robustness and flexibility of mixture modeling, and a shadow detection scheme to remove unwanted shadows from the scene. Furthermore, we apply this method to real image sequences of both indoor and outdoor scenes. The results of comparing our method to different state of the art background subtraction methods show the efficiency of our model for real-time segmentation.     

基于Givens变换矩阵的时间结构信号盲源分离新算法

对于时间结构信号的盲源分离(Blind Source Separation,BSS),独立成分分析(Independent Component Analysis,ICA)是十分有效的方法。在对观测信号白化处理后,ICA的关键是寻找去除高阶相关性的正交分离矩阵。鉴于任意维数正交矩阵可以表示为Givens变换矩阵的乘积,提出了一种新的时间结构信号盲源分离算法。首先,利用Givens变换矩阵参数化表示正交分离矩阵,减少了要估计参数的个数;其次,以多步时延协方差矩阵的联合近似对角化为目标函数,将盲源分离问题转化为无约束优化问题,并利用拟牛顿法中的BFGS算法对Givens变换矩阵中的参数进行估计,得到分离矩阵;最后,以实际的混合语音信号分离做仿真实验,验证了该算法对时间结构信号的盲源分离是有效的。