基于单源点识别和改进聚类方法的混合矩阵估计

Dongyang Zhu, Xiaohong Ma
{"title":"基于单源点识别和改进聚类方法的混合矩阵估计","authors":"Dongyang Zhu, Xiaohong Ma","doi":"10.1109/ICAWST.2011.6163156","DOIUrl":null,"url":null,"abstract":"Mixing matrix is the key issue in the under-determined blind source separation with sparse representation. The performance of traditional clustering method degrades when the sources do not satisfy W-disjoint orthogonal condition. This paper puts forward an effective method, which sets less condition on the sparseness of the sources, to improve the estimation of the mixing matrix. Firstly, we detect the points in the time-frequency domain of the observations that only single source contributes. Samples at these points are more reliable for the mixing matrix estimation. Secondly, the number of sources, which often needs to be known a priori, is estimated through the characteristics of the observed signals. Finally, an improved initial cluster center selection method is presented for the defects of the traditional K-means cluster algorithm. The numerical performance of the proposed methods are provided highlighting their performance gain compared to existing ones, especially in the cases where the number of sources is unknown and the sources are relatively less sparse.","PeriodicalId":126169,"journal":{"name":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Mixing matrix estimation based on single-source point identification and improved clustering method\",\"authors\":\"Dongyang Zhu, Xiaohong Ma\",\"doi\":\"10.1109/ICAWST.2011.6163156\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mixing matrix is the key issue in the under-determined blind source separation with sparse representation. The performance of traditional clustering method degrades when the sources do not satisfy W-disjoint orthogonal condition. This paper puts forward an effective method, which sets less condition on the sparseness of the sources, to improve the estimation of the mixing matrix. Firstly, we detect the points in the time-frequency domain of the observations that only single source contributes. Samples at these points are more reliable for the mixing matrix estimation. Secondly, the number of sources, which often needs to be known a priori, is estimated through the characteristics of the observed signals. Finally, an improved initial cluster center selection method is presented for the defects of the traditional K-means cluster algorithm. The numerical performance of the proposed methods are provided highlighting their performance gain compared to existing ones, especially in the cases where the number of sources is unknown and the sources are relatively less sparse.\",\"PeriodicalId\":126169,\"journal\":{\"name\":\"2011 3rd International Conference on Awareness Science and Technology (iCAST)\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 3rd International Conference on Awareness Science and Technology (iCAST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAWST.2011.6163156\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 3rd International Conference on Awareness Science and Technology (iCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAWST.2011.6163156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

混合矩阵是稀疏表示欠定盲源分离中的关键问题。当源不满足w -不相交正交条件时,传统聚类方法的性能会下降。本文提出了一种有效的方法,该方法对源的稀疏性设置较少的条件,以改善混合矩阵的估计。首先,我们在观测值的时频域中检测只有单一源贡献的点。在这些点上的样本对于混合矩阵估计是更可靠的。其次,通过观测信号的特征来估计源的数量,而源的数量通常需要先验地知道。最后,针对传统k均值聚类算法的缺陷,提出了一种改进的初始聚类中心选择方法。给出了所提方法的数值性能,突出了它们与现有方法相比的性能增益,特别是在源数量未知且源相对较少稀疏的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mixing matrix estimation based on single-source point identification and improved clustering method
Mixing matrix is the key issue in the under-determined blind source separation with sparse representation. The performance of traditional clustering method degrades when the sources do not satisfy W-disjoint orthogonal condition. This paper puts forward an effective method, which sets less condition on the sparseness of the sources, to improve the estimation of the mixing matrix. Firstly, we detect the points in the time-frequency domain of the observations that only single source contributes. Samples at these points are more reliable for the mixing matrix estimation. Secondly, the number of sources, which often needs to be known a priori, is estimated through the characteristics of the observed signals. Finally, an improved initial cluster center selection method is presented for the defects of the traditional K-means cluster algorithm. The numerical performance of the proposed methods are provided highlighting their performance gain compared to existing ones, especially in the cases where the number of sources is unknown and the sources are relatively less sparse.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信