首页> 外文会议>EUSIPCO 2007;European signal processing conference >A FAST ALGORITHM FOR BLIND SEPARATION OF NON-GAUSSIAN ANDTIME-CORRELATED SIGNALS
【24h】

A FAST ALGORITHM FOR BLIND SEPARATION OF NON-GAUSSIAN ANDTIME-CORRELATED SIGNALS

机译:一种非高斯时间相关信号的盲分离快速算法

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

摘要

In this article we propose a computationally efficientrnmethod (termed FCOMBI) to combine the strengths of non-rnGaussianity-based Blind Source Separation (BSS) and crosscorrelations-rnbased BSS. This is done by fusing the separationrnabilities of two well-known BSS algorithms: EFICArnand WASOBI. Simulations show that our approach is atrnleast as accurate and often more accurate that other stateof-rnthe-art approaches which also aim to separate simultaneouslyrnnon-Gaussian and time-correlated components.rnHowever, in terms of computational efficiency and stability,rnFCOMBI is the clear winner which makes it specially suitablernfor the analysis of very high-dimensional datasets likernhigh-density Electroencephalographic (EEG) orMagnetoencephalographicrn(MEG) recordings.
机译:在本文中,我们提出了一种计算效率高的方法(称为FCOMBI),以结合基于非高斯性的盲源分离(BSS)和基于互相关的BSS的优势。这是通过融合两种著名的BSS算法(EFICArn和WASOBI)的可分离性来完成的。仿真表明,与其他旨在同时分离非高斯和与时间相关的组件的最新技术相比,我们的方法具有更高的准确性,而且通常更准确。rn然而,就计算效率和稳定性而言,FCOMBI无疑是赢家这使其特别适用于分析高密度脑电图(EEG)或磁脑电图(MEG)记录等超高维数据集。

著录项

  • 来源
  • 会议地点 Poznan(PL);Poznan(PL)
  • 作者单位

    Institute of Signal Processing, Tampere University of Technology, P.O.Box 553, 33101 Tampere, Finland;

    rnInstitute of Information Theory and Automation, P.O.Box 18, 18208 Prague, Czech Republic;

    rnInstitute of Information Theory and Automation, P.O.Box 18, 18208 Prague, Czech Republic;

    rnInstitute of Signal Processing, Tampere University of Technology, P.O.Box 553, 33101 Tampere, Finland;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 通信理论;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号