首页> 外文会议>IEEE International Conference on Robotics & Automation >A new hierarchical binaural sound source localization method based on Interaural Matching Filter
【24h】

A new hierarchical binaural sound source localization method based on Interaural Matching Filter

机译:基于双耳匹配滤波器的分层双耳声源定位新方法

获取原文

摘要

Binaural sound source localization is an important technique in friendly Human-Robot Interaction (HRI) for its easy-implementation with only two microphones. This paper develops a robust method based on a hierarchical probabilistic model. Reliable frequency sub-bands are used to PHAT — ργ method in the first layer to obtain a priori crude Interaural Time-Delay (ITD) and the probabilistic distribution of candidate azimuths. The second layer utilizes Interaural Intensity Difference (IID) to reduce matching time and refine candidate azimuths as well as elevations. A novel feature named Interaural Matching Filter (IMF), which can eliminate the difference between ITDs and IIDs, is proposed in the third layer. The probability of sound source location is acquired by computing the similarity between the IMF of received binaural signal and the IMFs in templates. Finally, combined with the former ITDs and IIDs, the similarity matrix is used to make a decision of sound source location based on a Bayes rule. Our innovation lies in adding selecting reliable frequency components into time-delay estimation and foremost taking IMF as a feature of sound source. Compared with several state-of-the-art algorithms, experimental results show our approach has a better performance even in noisy environments without increasing storages, and also has less time complexity.
机译:双耳声源定位是友好的人机交互(HRI)的一项重要技术,因为它只需两个麦克风即可轻松实现。本文提出了一种基于分层概率模型的鲁棒方法。在第一层中将可靠的子频带用于PHAT-ργ方法,以获得先验原始听觉间延迟(ITD)和候选方位角的概率分布。第二层利用耳间强度差(IID)来减少匹配时间并细化候选方位角和高程。第三层提出了一种新颖的功能,称为耳间匹配滤波器(IMF),可以消除ITD和IID之间的差异。通过计算接收到的双耳信号的IMF与模板中的IMF之间的相似度来获取声源定位的概率。最后,结合以前的ITD和IID,使用相似度矩阵基于贝叶斯规则来确定声源位置。我们的创新在于在时延估计中增加选择可靠的频率分量,并且最重要的是将IMF作为声源的功能。与几种最新的算法相比,实验结果表明,即使在嘈杂的环境中也无需增加存储量,我们的方法仍具有更好的性能,并且时间复杂度更低。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号