• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

使用广义自相关的盲源提取

Blind source extraction using generalized autocorrelations.

作者信息

Shi Zhenwei, Zhang Changshui

出版信息

IEEE Trans Neural Netw. 2007 Sep;18(5):1516-24. doi: 10.1109/tnn.2007.895823.

DOI:10.1109/tnn.2007.895823
PMID:18220199
Abstract

This letter addresses blind (semiblind) source extraction (BSE) problem when a desired source signal has temporal structures, such as linear or nonlinear autocorrelations. Using the temporal characteristics of sources, we develop objective functions based on the generalized autocorrelations of primary sources. Maximizing the objective functions, we propose simple fixed-point source extraction algorithms. We give the stability analysis and prove convergence properties of the algorithms as the generalized autocorrelation function is linear or nonlinear. Especially, as the generalized autocorrelation function is linear, the algorithm has interesting character of "one-iteration" convergence under some conditions. Computer simulations and real-data application experiments show that the algorithms are appealing BSE methods for temporal signals of interest by capturing the linear or nonlinear autocorrelations of the desired sources.

摘要

本文探讨当期望源信号具有时间结构(如线性或非线性自相关)时的盲(半盲)源提取(BSE)问题。利用源的时间特性,我们基于主源的广义自相关开发目标函数。通过最大化目标函数,我们提出了简单的定点源提取算法。我们给出了稳定性分析,并证明了算法在广义自相关函数为线性或非线性时的收敛特性。特别地,当广义自相关函数为线性时,该算法在某些条件下具有“一次迭代”收敛的有趣特性。计算机仿真和实际数据应用实验表明,这些算法通过捕捉期望源的线性或非线性自相关,是用于感兴趣时间信号的有吸引力的BSE方法。

相似文献

1
Blind source extraction using generalized autocorrelations.使用广义自相关的盲源提取
IEEE Trans Neural Netw. 2007 Sep;18(5):1516-24. doi: 10.1109/tnn.2007.895823.
2
On blind separability based on the temporal predictability method.
Neural Comput. 2009 Dec;21(12):3519-31. doi: 10.1162/neco.2009.10-08-890.
3
Analysis and online realization of the CCA approach for blind source separation.用于盲源分离的CCA方法的分析与在线实现
IEEE Trans Neural Netw. 2007 Sep;18(5):1505-10. doi: 10.1109/tnn.2007.894017.
4
From blind signal extraction to blind instantaneous signal separation: criteria, algorithms, and stability.从盲信号提取到盲瞬时信号分离:准则、算法与稳定性
IEEE Trans Neural Netw. 2004 Jul;15(4):859-73. doi: 10.1109/TNN.2004.828764.
5
Parametric image alignment using enhanced correlation coefficient maximization.使用增强相关系数最大化的参数图像对齐
IEEE Trans Pattern Anal Mach Intell. 2008 Oct;30(10):1858-65. doi: 10.1109/TPAMI.2008.113.
6
A Markov model for blind image separation by a mean-field EM algorithm.一种基于平均场期望最大化算法的盲图像分离马尔可夫模型。
IEEE Trans Image Process. 2006 Feb;15(2):473-82. doi: 10.1109/tip.2005.860323.
7
Focus area extraction by blind deconvolution for defining regions of interest.通过盲反卷积进行感兴趣区域定义的聚焦区域提取。
IEEE Trans Pattern Anal Mach Intell. 2007 Jun;29(6):1080-5. doi: 10.1109/TPAMI.2007.1079.
8
Gaussian mean-shift is an EM algorithm.高斯均值漂移是一种期望最大化(EM)算法。
IEEE Trans Pattern Anal Mach Intell. 2007 May;29(5):767-76. doi: 10.1109/TPAMI.2007.1057.
9
Blind image deconvolution through support vector regression.基于支持向量回归的盲图像去卷积
IEEE Trans Neural Netw. 2007 May;18(3):931-5. doi: 10.1109/TNN.2007.891622.
10
A hybrid SEM algorithm for high-dimensional unsupervised learning using a finite generalized Dirichlet mixture.一种使用有限广义狄利克雷混合的用于高维无监督学习的混合SEM算法。
IEEE Trans Image Process. 2006 Sep;15(9):2657-68. doi: 10.1109/tip.2006.877379.

引用本文的文献

1
A Null Space-Based Blind Source Separation for Fetal Electrocardiogram Signals.基于零空间的胎儿心电信号盲分离。
Sensors (Basel). 2020 Jun 22;20(12):3536. doi: 10.3390/s20123536.
2
A Fetal Electrocardiogram Signal Extraction Algorithm Based on the Temporal Structure and the Non-Gaussianity.一种基于时间结构和非高斯性的胎儿心电图信号提取算法。
Comput Math Methods Med. 2016;2016:9658410. doi: 10.1155/2016/9658410. Epub 2016 Jan 26.