基于特征函数的欠定混合物盲识别:源PDF知识的影响

M. Rajih, P. Comon
{"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}
引用次数: 8

摘要

当输入(源)的数量大于输出(观测)的数量时,线性混合被称为待定(UDM)。本文提出的算法旨在利用观测值的第二个特征函数(c.f.)识别UDM,不需要对源进行稀疏性假设,但假设其统计独立性。第一种算法已经由P. Comon和M. Rajih(2005)的作者提出,它假设源c.f.。是未知的。在本文中,描述了该算法的一种变体,它允许考虑源c.f.的知识。在计算机仿真的基础上,比较了两种算法的性能
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信