独立分量分析中新的峰度优化算法

Wei Zhao, Yue-hong Shen, Jian-gong Wang, Zhi-Gang Yuan, Wei Jian
{"title":"独立分量分析中新的峰度优化算法","authors":"Wei Zhao, Yue-hong Shen, Jian-gong Wang, Zhi-Gang Yuan, Wei Jian","doi":"10.1109/ICIST.2014.6920323","DOIUrl":null,"url":null,"abstract":"This paper considers the independent component analysis (ICA) case in blind source separation (BSS), in which observations result from the linear and instantaneous mixture of sources. Inspired from the recently proposed reference-based contrast criteria, a similar contrast function is proposed, based on which novel optimization algorithms are proposed. They are very similar to the former classical fast fixed-point (FastICA) algorithms based on the kurtosis, but differ in the fact that they are more efficient than the corresponding latter ones respectively in terms of the computational speed, which is particularly striking when the number of samples is large. The validity and performance of the new algorithms are investigated through simulations, in which comparison and analysis are also performed.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New kurtosis optimization algorithms for independent component analysis\",\"authors\":\"Wei Zhao, Yue-hong Shen, Jian-gong Wang, Zhi-Gang Yuan, Wei Jian\",\"doi\":\"10.1109/ICIST.2014.6920323\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the independent component analysis (ICA) case in blind source separation (BSS), in which observations result from the linear and instantaneous mixture of sources. Inspired from the recently proposed reference-based contrast criteria, a similar contrast function is proposed, based on which novel optimization algorithms are proposed. They are very similar to the former classical fast fixed-point (FastICA) algorithms based on the kurtosis, but differ in the fact that they are more efficient than the corresponding latter ones respectively in terms of the computational speed, which is particularly striking when the number of samples is large. The validity and performance of the new algorithms are investigated through simulations, in which comparison and analysis are also performed.\",\"PeriodicalId\":306383,\"journal\":{\"name\":\"2014 4th IEEE International Conference on Information Science and Technology\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 4th IEEE International Conference on Information Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIST.2014.6920323\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 4th IEEE International Conference on Information Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST.2014.6920323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了盲源分离(BSS)中的独立分量分析(ICA)情况,该情况下的观测结果来自于源的线性和瞬时混合。在最近提出的基于参考的对比准则的启发下,提出了一个类似的对比函数,并在此基础上提出了新的优化算法。它们与之前基于峭度的经典快速不动点(FastICA)算法非常相似,但不同之处在于它们在计算速度上分别比后者更高效,这在样本数量较大时尤为显著。通过仿真研究了新算法的有效性和性能,并进行了比较和分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
New kurtosis optimization algorithms for independent component analysis
This paper considers the independent component analysis (ICA) case in blind source separation (BSS), in which observations result from the linear and instantaneous mixture of sources. Inspired from the recently proposed reference-based contrast criteria, a similar contrast function is proposed, based on which novel optimization algorithms are proposed. They are very similar to the former classical fast fixed-point (FastICA) algorithms based on the kurtosis, but differ in the fact that they are more efficient than the corresponding latter ones respectively in terms of the computational speed, which is particularly striking when the number of samples is large. The validity and performance of the new algorithms are investigated through simulations, in which comparison and analysis are also performed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信