...
首页> 外文期刊>Circuits, systems, and signal processing >PARAFAC-Based Blind Identification of Underdetermined Mixtures Using Gaussian Mixture Model
【24h】

PARAFAC-Based Blind Identification of Underdetermined Mixtures Using Gaussian Mixture Model

机译:基于PARAFAC的不确定混合物的高斯混合物模型盲识别

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

This paper presents a novel algorithm, named GMM-PARAFAC, for blind identification of underdetermined instantaneous linear mixtures. The GMM-PARAFAC algorithm uses Gaussian mixture model (GMM) to model non-Gaussianity of the independent sources. We show that the distribution of the observations can also be modeled by a GMM, and derive a maximum-likelihood function with regard to the mixing matrix by estimating the GMM parameters of the observations via the expectation-maximization algorithm. In order to reduce the computation complexity, the mixing matrix is estimated by maximizing a tight upper bound of the likelihood instead of the log-likelihood itself. The maximum of the tight upper bound is obtained by decomposition of a three-way tensor which is obtained by stacking the covariance matrices of the GMM of the observations. Simulation results validate the superiority of the GMM-PARAFAC algorithm.
机译:本文提出了一种新算法,名为GMM-PARAFAC,用于盲目识别不确定的瞬时线性混合物。 GMM-PARAFAC算法使用高斯混合模型(GMM)对独立源的非高斯性进行建模。我们表明,观测值的分布也可以由GMM建模,并通过期望最大化算法估算观测值的GMM参数,从而得出关于混合矩阵的最大似然函数。为了降低计算复杂度,通过最大化似然性的紧密上限而不是对数似然本身来估计混合矩阵。紧密上限的最大值是通过分解三向张量获得的,该张量是通过堆叠观测值的GMM的协方差矩阵获得的。仿真结果验证了GMM-PARAFAC算法的优越性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号