{"title":"具有时间结构的统计相关源的提取","authors":"A. Barros, A. Cichocki, N. Ohnishi","doi":"10.1109/SBRN.2000.889714","DOIUrl":null,"url":null,"abstract":"In this work we develop a very simple batch learning algorithm for semi-blind extraction of a desired source signal with temporal structure from linear mixtures. Although we use the concept of sequential blind extraction of sources and independent component analysis (ICA), we do not carry out the extraction in a completely blind manner neither we assume that sources are statistically independent. In fact, we show that the a priori information about the autocorrelation function of primary sources can be used to extract the desired signals (sources of interest) from their mixtures. Extensive computer simulations and real data application experiments confirm the validity and high performance of the proposed algorithm.","PeriodicalId":448461,"journal":{"name":"Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks","volume":"43 20","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Extraction of statistically dependent sources with temporal structure\",\"authors\":\"A. Barros, A. Cichocki, N. Ohnishi\",\"doi\":\"10.1109/SBRN.2000.889714\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we develop a very simple batch learning algorithm for semi-blind extraction of a desired source signal with temporal structure from linear mixtures. Although we use the concept of sequential blind extraction of sources and independent component analysis (ICA), we do not carry out the extraction in a completely blind manner neither we assume that sources are statistically independent. In fact, we show that the a priori information about the autocorrelation function of primary sources can be used to extract the desired signals (sources of interest) from their mixtures. Extensive computer simulations and real data application experiments confirm the validity and high performance of the proposed algorithm.\",\"PeriodicalId\":448461,\"journal\":{\"name\":\"Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks\",\"volume\":\"43 20\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-01-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SBRN.2000.889714\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBRN.2000.889714","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Extraction of statistically dependent sources with temporal structure
In this work we develop a very simple batch learning algorithm for semi-blind extraction of a desired source signal with temporal structure from linear mixtures. Although we use the concept of sequential blind extraction of sources and independent component analysis (ICA), we do not carry out the extraction in a completely blind manner neither we assume that sources are statistically independent. In fact, we show that the a priori information about the autocorrelation function of primary sources can be used to extract the desired signals (sources of interest) from their mixtures. Extensive computer simulations and real data application experiments confirm the validity and high performance of the proposed algorithm.