{"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}
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.