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