{"title":"基于赋值问题的频域卷积源分离中排列模糊度求解方法","authors":"H. N. Vuong, Quoc Nguyen, H. L. Tran","doi":"10.1109/ATC.2011.6027488","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an effective method for blind source separation of convolutive mixtures in the frequency domain. The main difficulty in a frequency approach is the permutation problem. In the proposed method, we use the Assignment Problem (AP) approach to solve permutation ambiguity in the frequency domain. In our work, we apply different algorithms to solve the AP to find the optimal solution. Furthermore, by using a simple check procedure, the algorithm has to only solve the permutation problem in a few frequency bins instead of all. This method has been proven more efficient on computation than the previous methods using the AP approach. Computer simulation experiments with speech data are presented to illustrate the proposed method.","PeriodicalId":221905,"journal":{"name":"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)","volume":"123 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Assignment problem-based approach for solving permutation ambiguity in frequency domain convolutive source separation\",\"authors\":\"H. N. Vuong, Quoc Nguyen, H. L. Tran\",\"doi\":\"10.1109/ATC.2011.6027488\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an effective method for blind source separation of convolutive mixtures in the frequency domain. The main difficulty in a frequency approach is the permutation problem. In the proposed method, we use the Assignment Problem (AP) approach to solve permutation ambiguity in the frequency domain. In our work, we apply different algorithms to solve the AP to find the optimal solution. Furthermore, by using a simple check procedure, the algorithm has to only solve the permutation problem in a few frequency bins instead of all. This method has been proven more efficient on computation than the previous methods using the AP approach. Computer simulation experiments with speech data are presented to illustrate the proposed method.\",\"PeriodicalId\":221905,\"journal\":{\"name\":\"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)\",\"volume\":\"123 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATC.2011.6027488\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATC.2011.6027488","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Assignment problem-based approach for solving permutation ambiguity in frequency domain convolutive source separation
In this paper, we propose an effective method for blind source separation of convolutive mixtures in the frequency domain. The main difficulty in a frequency approach is the permutation problem. In the proposed method, we use the Assignment Problem (AP) approach to solve permutation ambiguity in the frequency domain. In our work, we apply different algorithms to solve the AP to find the optimal solution. Furthermore, by using a simple check procedure, the algorithm has to only solve the permutation problem in a few frequency bins instead of all. This method has been proven more efficient on computation than the previous methods using the AP approach. Computer simulation experiments with speech data are presented to illustrate the proposed method.