首页> 外文会议>IEEE International Conference on Rebooting Computing >Online Adaptive Quasi-Maximum Likelihood Blind Source Separation of Stationary Sources
【24h】

Online Adaptive Quasi-Maximum Likelihood Blind Source Separation of Stationary Sources

机译:固定源在线自适应拟最大似然盲源分离

获取原文

摘要

In the context of Blind Source Separation (BSS), we consider the problem of online separation of stationary sources. Based on the Maximum Likelihood (ML) solution for semi-blind separation of temporally-diverse Gaussian sources, and assuming that a parametric model of the sources' spectra is available, we propose an online adaptive Quasi-ML (QML) separation algorithm. The algorithm operates in an alternating fashion, updating at each iteration the (nuisance) spectra-characterizing parameters first, and then the demixing-matrix estimates, according to simple, computationally efficient update expressions which we derive. Our proposed algorithm, which leads to consistent separation of the sources, is demonstrated here, both analytically and empirically in a simulation experiment, for first-order autoregressive sources.
机译:在盲源分离(BSS)的背景下,我们考虑了固定源在线分离的问题。基于最大似然(ML)解决方案的时间盲高斯源的半盲分离,并假设源的光谱的参数化模型可用,我们提出了一种在线自适应的准ML(QML)分离算法。该算法以交替方式进行操作,根据我们得出的简单,计算有效的更新表达式,在每次迭代时首先更新(讨厌的)频谱特征参数,然后再更新混合矩阵估计。我们针对模拟的一阶自回归源,从分析和经验上证明了我们提出的算法,该算法可导致源的一致分离。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号