{"title":"基于特征函数的欠定混合物盲识别:源PDF知识的影响","authors":"M. Rajih, P. Comon","doi":"10.1109/CAMAP.2005.1574202","DOIUrl":null,"url":null,"abstract":"When the number of inputs (sources) is larger than the number of outputs (observations), linear mixtures are referred to as Under-Determined (UDM). The algorithms proposed here aim at identifying UDM using the second characteristic function (c.f.) of observations, without any need of sparsity assumption on sources, but assuming their statistical independence. The first algorithm, already proposed by the authors in P. Comon and M. Rajih (2005), assumes that the source c.f.'s are unknown. In this paper, a variant of the algorithm is described, which allows to take into account the knowledge of source c.f.'s. Performances of both algorithms are compared based on computer simulations","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"258 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Blind identification of under-determined mixtures based on the characteristic function: influence of the knowledge of source PDF's\",\"authors\":\"M. Rajih, P. Comon\",\"doi\":\"10.1109/CAMAP.2005.1574202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When the number of inputs (sources) is larger than the number of outputs (observations), linear mixtures are referred to as Under-Determined (UDM). The algorithms proposed here aim at identifying UDM using the second characteristic function (c.f.) of observations, without any need of sparsity assumption on sources, but assuming their statistical independence. The first algorithm, already proposed by the authors in P. Comon and M. Rajih (2005), assumes that the source c.f.'s are unknown. In this paper, a variant of the algorithm is described, which allows to take into account the knowledge of source c.f.'s. Performances of both algorithms are compared based on computer simulations\",\"PeriodicalId\":281761,\"journal\":{\"name\":\"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.\",\"volume\":\"258 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAMAP.2005.1574202\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMAP.2005.1574202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Blind identification of under-determined mixtures based on the characteristic function: influence of the knowledge of source PDF's
When the number of inputs (sources) is larger than the number of outputs (observations), linear mixtures are referred to as Under-Determined (UDM). The algorithms proposed here aim at identifying UDM using the second characteristic function (c.f.) of observations, without any need of sparsity assumption on sources, but assuming their statistical independence. The first algorithm, already proposed by the authors in P. Comon and M. Rajih (2005), assumes that the source c.f.'s are unknown. In this paper, a variant of the algorithm is described, which allows to take into account the knowledge of source c.f.'s. Performances of both algorithms are compared based on computer simulations