Dongxia Wang, Jie Cui, Jinghua Wang, Hua Tan, Ming Xu
{"title":"基于凸壳卷积非负矩阵分解的多媒体通信语音增强","authors":"Dongxia Wang, Jie Cui, Jinghua Wang, Hua Tan, Ming Xu","doi":"10.1109/CSP55486.2022.00033","DOIUrl":null,"url":null,"abstract":"In this paper, an effective speech enhancement method is proposed for the next generation multimedia communication system. The priori knowledge of the enhancement stage is obtained by the modified Convex Hull Convolutive NMF with less information loss. To deal with the difficulty of its optimal gain estimation, an iterative algorithm is then introduced to update the coefficient matrix. The experimental results under different types of noise environment show that the proposed algorithm can reduce the signal distortions dramatically, and provide better enhancement performance than the benchmark algorithms simultaneously, especially under adverse conditions.","PeriodicalId":187713,"journal":{"name":"2022 6th International Conference on Cryptography, Security and Privacy (CSP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Convex Hull Convolutive Non-negative Matrix Factorization Based Speech Enhancement For Multimedia Communication\",\"authors\":\"Dongxia Wang, Jie Cui, Jinghua Wang, Hua Tan, Ming Xu\",\"doi\":\"10.1109/CSP55486.2022.00033\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an effective speech enhancement method is proposed for the next generation multimedia communication system. The priori knowledge of the enhancement stage is obtained by the modified Convex Hull Convolutive NMF with less information loss. To deal with the difficulty of its optimal gain estimation, an iterative algorithm is then introduced to update the coefficient matrix. The experimental results under different types of noise environment show that the proposed algorithm can reduce the signal distortions dramatically, and provide better enhancement performance than the benchmark algorithms simultaneously, especially under adverse conditions.\",\"PeriodicalId\":187713,\"journal\":{\"name\":\"2022 6th International Conference on Cryptography, Security and Privacy (CSP)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 6th International Conference on Cryptography, Security and Privacy (CSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSP55486.2022.00033\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 6th International Conference on Cryptography, Security and Privacy (CSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSP55486.2022.00033","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Convex Hull Convolutive Non-negative Matrix Factorization Based Speech Enhancement For Multimedia Communication
In this paper, an effective speech enhancement method is proposed for the next generation multimedia communication system. The priori knowledge of the enhancement stage is obtained by the modified Convex Hull Convolutive NMF with less information loss. To deal with the difficulty of its optimal gain estimation, an iterative algorithm is then introduced to update the coefficient matrix. The experimental results under different types of noise environment show that the proposed algorithm can reduce the signal distortions dramatically, and provide better enhancement performance than the benchmark algorithms simultaneously, especially under adverse conditions.