首页> 外文会议>2018 52nd Asilomar Conference on Signals, Systems, and Computers >Independent Component Analysis Based on Non-polynomial Approximation of Negentropy: Application to MRS Source Separation
【24h】

Independent Component Analysis Based on Non-polynomial Approximation of Negentropy: Application to MRS Source Separation

机译:基于负多项式非多项式逼近的独立分量分析:在MRS源分离中的应用

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

摘要

In this paper, a new ICA algorithm based on non-polynomial approximation of negentropy that captures both the asymmetry of the sources' PDF and the $sub/super$-Gaussianity of this latter is proposed. A gradient-ascent iteration with quasi-optimal stepsize is used to maximize the considered cost function. With this quasi-optimal computation in the case of highly non-linear objective function, the main advantages of the proposed algorithm are 1) its robustness to outliers compared to kurtosis-based ICA method especially for situations of small data size, and 2) its ability to capture sources' asymmetric probability density functions which is a property that can't be fulfilled in classic ICA algorithms like FastICA. Numerical results reported in the context of source separation of brain magnetic resonance spectroscopy show the superiority of the proposed algorithm over the FastICA algorithm in terms of both source separation accuracy and the number of iterations required for convergence.
机译:本文提出了一种新的基于负熵非多项式逼近的ICA算法,该算法既捕获了源PDF的不对称性,又捕获了源PDF的$ sub / super $ -Gaussianity。具有准最佳步长的梯度上升迭代用于最大化考虑的成本函数。通过在高度非线性目标函数的情况下进行这种准最优计算,所提出的算法的主要优点是:1)与基于峰度的ICA方法相比,其对异常值的鲁棒性;尤其是在数据量较小的情况下;以及2)捕获源非对称概率密度函数的能力,这是经典ICA算法(如FastICA)无法实现的特性。在脑磁共振波谱的源分离方面报道的数值结果表明,在源分离精度和收敛所需迭代次数方面,该算法优于FastICA算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号