arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.02458eess.AScs.SDeess.SP
收藏

超定独立向量分析

Overdetermined independent vector analysis

NTT Communication Science Laboratories, NTT Corporation(NTT公司NTT通信科学实验室)

Rintaro Ikeshita, Tomohiro Nakatani, Shoko Araki

摘要:

我们解决的卷积盲源分离问题的(过)确定的情况下,(i)的非平稳目标源$K$的数量小于麦克风$M$,(ii)有高达$M - K$平稳高斯噪声,不需要提取。独立向量分析(IVA)通过分离成$M$源并选择其中的顶部$K$高度非平稳信号来解决该问题,但是该方法遭受计算浪费,特别是当$K \ll M$时。IVA预处理中的通道减少,例如,主成分分析具有去除目标信号的风险。我们在这里扩展IVA来解决这些问题。一个这样的扩展已经通过假设正交性约束(OC),即目标和噪声信号之间的样本相关性为零来实现。建议的IVA,另一方面,不依赖于OC和利用源之间的独立性和噪声的平稳性。这使我们能够开发几个有效的算法的基础上块坐标下降方法与特定问题的加速。我们阐明了一个这样的算法完全符合传统的IVA与OC,也解释了其他新开发的算法比它更快。实验结果表明,改进的计算量的新算法相比,传统的方法。特别是,一个新的算法专门为$K = 1$优于其他。

英文摘要:

We address the convolutive blind source separation problem for the (over-)determined case where (i) the number of nonstationary target-sources $K$ is less than that of microphones $M$, and (ii) there are up to $M - K$ stationary Gaussian noises that need not to be extracted. Independent vector analysis (IVA) can solve the problem by separating into $M$ sources and selecting the top $K$ highly nonstationary signals among them, but this approach suffers from a waste of computation especially when $K \ll M$. Channel reductions in preprocessing of IVA by, e.g., principle component analysis have the risk of removing the target signals. We here extend IVA to resolve these issues. One such extension has been attained by assuming the orthogonality constraint (OC) that the sample correlation between the target and noise signals is to be zero. The proposed IVA, on the other hand, does not rely on OC and exploits only the independence between sources and the stationarity of the noises. This enables us to develop several efficient algorithms based on block coordinate descent methods with a problem specific acceleration. We clarify that one such algorithm exactly coincides with the conventional IVA with OC, and also explain that the other newly developed algorithms are faster than it. Experimental results show the improved computational load of the new algorithms compared to the conventional methods. In particular, a new algorithm specialized for $K = 1$ outperforms the others.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑