Distributed microphone array processing for speech source separation with classifier fusion

M. Souden, K. Kinoshita, Marc Delcroix, T. Nakatani
{"title":"Distributed microphone array processing for speech source separation with classifier fusion","authors":"M. Souden, K. Kinoshita, Marc Delcroix, T. Nakatani","doi":"10.1109/MLSP.2012.6349782","DOIUrl":null,"url":null,"abstract":"We propose a new approach for clustering and separating competing speech signals using a distributed microphone array (DMA). This approach can be viewed as an extension of expectation-maximization (EM)-based source separation to DMAs. To achieve distributed processing, we assume the conditional independence (with respect to sources' activities) of the normalized recordings of different nodes. By doing so, only the posterior probabilities of sources' activities need to be shared between nodes. Consequently, the EM algorithm is formulated such that at the expectation step, local posterior probabilities are estimated locally and shared between nodes. In the maximization step, every node fuses the received probabilities via either product or sum rules and estimates its local parameters. We show that, even if we make binary decisions (presence/ absence of speech) during EM iterations instead of transmitting continuous posterior probability values, we can achieve separation without causing significant speech distortion. Our preliminary investigations demonstrate that the proposed processing technique approaches the centralized solution and can outperform Oracle best node-wise clustering in terms of objective source separation metrics.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"138 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Workshop on Machine Learning for Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MLSP.2012.6349782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

We propose a new approach for clustering and separating competing speech signals using a distributed microphone array (DMA). This approach can be viewed as an extension of expectation-maximization (EM)-based source separation to DMAs. To achieve distributed processing, we assume the conditional independence (with respect to sources' activities) of the normalized recordings of different nodes. By doing so, only the posterior probabilities of sources' activities need to be shared between nodes. Consequently, the EM algorithm is formulated such that at the expectation step, local posterior probabilities are estimated locally and shared between nodes. In the maximization step, every node fuses the received probabilities via either product or sum rules and estimates its local parameters. We show that, even if we make binary decisions (presence/ absence of speech) during EM iterations instead of transmitting continuous posterior probability values, we can achieve separation without causing significant speech distortion. Our preliminary investigations demonstrate that the proposed processing technique approaches the centralized solution and can outperform Oracle best node-wise clustering in terms of objective source separation metrics.
基于分类器融合的声源分离分布式麦克风阵列处理
我们提出了一种利用分布式麦克风阵列(DMA)对竞争语音信号进行聚类和分离的新方法。这种方法可以看作是基于期望最大化(EM)的源分离到dma的扩展。为了实现分布式处理,我们假设不同节点的规范化记录具有条件独立性(相对于源的活动)。通过这样做,只有源活动的后验概率需要在节点之间共享。因此,EM算法的表述使得在期望步,局部后验概率被局部估计并在节点之间共享。在最大化步骤中,每个节点通过乘积或求和规则融合接收到的概率,并估计其局部参数。我们表明,即使我们在EM迭代期间做出二元决策(语音存在/缺失),而不是传输连续的后验概率值,我们也可以在不造成严重语音失真的情况下实现分离。我们的初步调查表明,所提出的处理技术接近集中式解决方案,并且在客观源分离度量方面可以优于Oracle最佳节点智能聚类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信