Single channel speech/music segregation based on a novel K-means clustering schema

Seyed-Hossein Alavinia, F. Razzazi, H. Sadjedi
{"title":"Single channel speech/music segregation based on a novel K-means clustering schema","authors":"Seyed-Hossein Alavinia, F. Razzazi, H. Sadjedi","doi":"10.1109/ISSPIT.2011.6151629","DOIUrl":null,"url":null,"abstract":"In this paper, we proposed a modified version of K-means clustering algorithm for single channel separation of speech and music from mixed signal. K-means method fails for high dimensional data processing due to computational complexity and curse of dimensionality issues. To improve the performance of clustering algorithm, we used PCA technique and suggested a novel schema to increase the quality of outcome signals of PCA-Kmeans approach in both FFT and STFT domains. The efficiency of the proposed method is evaluated for different codebook sizes. The comparison between modified PCA-Kmeans algorithm and PCA-Kmeans approach for codebook size 512, showed that the quality of separation signals was improved about 12% in FFT and 20% in STFT without increase in the computational complexity. In addition, the modified PCA-Kmeans algorithm reduced the separation time up to 80% in FFT domain and 85% in STFT domain and improved the quality of segregated speech by about 20% in FFT and STFT domains in comparison with standard K-means method.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2011.6151629","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we proposed a modified version of K-means clustering algorithm for single channel separation of speech and music from mixed signal. K-means method fails for high dimensional data processing due to computational complexity and curse of dimensionality issues. To improve the performance of clustering algorithm, we used PCA technique and suggested a novel schema to increase the quality of outcome signals of PCA-Kmeans approach in both FFT and STFT domains. The efficiency of the proposed method is evaluated for different codebook sizes. The comparison between modified PCA-Kmeans algorithm and PCA-Kmeans approach for codebook size 512, showed that the quality of separation signals was improved about 12% in FFT and 20% in STFT without increase in the computational complexity. In addition, the modified PCA-Kmeans algorithm reduced the separation time up to 80% in FFT domain and 85% in STFT domain and improved the quality of segregated speech by about 20% in FFT and STFT domains in comparison with standard K-means method.
基于新颖k均值聚类模式的单通道语音/音乐分离
本文提出了一种改进的K-means聚类算法,用于从混合信号中分离语音和音乐的单通道。K-means方法由于计算复杂性和维数问题的局限性,在高维数据处理中存在一定的缺陷。为了提高聚类算法的性能,我们利用PCA技术,提出了一种新的模式来提高PCA- kmeans方法在FFT和STFT域的结果信号质量。在不同码本大小下,对所提方法的效率进行了评估。将改进的PCA-Kmeans算法与码本大小为512的PCA-Kmeans方法进行比较,结果表明,在不增加计算复杂度的情况下,FFT和STFT分离信号的质量分别提高了12%和20%左右。此外,改进的PCA-Kmeans算法在FFT域和STFT域分别减少了80%和85%的分离时间,在FFT和STFT域的分离语音质量比标准K-means方法提高了约20%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信