首页> 外文会议>IEEE 10th International Conference on Signal Processing >Minimum entropy-based acoustic source localization with Laplace Distribution
【24h】

Minimum entropy-based acoustic source localization with Laplace Distribution

机译:拉普拉斯分布的基于最小熵的声源定位

获取原文

摘要

Accurate and fast localization of acoustic sources is a problem that is of significant interest in applications such as conference systems, gunshot localization systems. Recently, approaches that based on the time difference of arrival(TDOA) are becoming popular, despite the computational expenses. The TDOA localization algorithms contain two parts: the time delay estimation(TDE) algorithms and space search algorithms. The most important TDE algorithms are based on the generalized cross-correlation(GCC) method. These algorithms perform reasonably well when reverberation or noise is not too high. Lots of improved algorithms are proposed, such as SRP-PHAT. In this article, we show that acoustic source localization with Laplace Distribution can be developed on a basis of minimum entropy (ME). For traditional grid search is too expensive for a real-time system, we propose using stochastic region contraction(SRC) to make computing the ME practical. Results from simulation experiences show excellent accuracy of the ME-SRC algorithm.
机译:声源的精确和快速定位是在会议系统,枪声定位系统等应用中引起极大关注的问题。近年来,尽管计算量大,但基于到达时间差(TDOA)的方法正变得越来越流行。 TDOA定位算法包括两部分:时间延迟估计(TDE)算法和空间搜索算法。最重要的TDE算法是基于广义互相关(GCC)方法的。当混响或噪声不太高时,这些算法的性能相当好。提出了许多改进的算法,例如SRP-PHAT。在本文中,我们表明可以在最小熵(ME)的基础上发展具有拉普拉斯分布的声源定位。由于传统的网格搜索对于实时系统而言过于昂贵,因此我们建议使用随机区域收缩(SRC)来使ME的计算变得实用。仿真结果表明,ME-SRC算法具有出色的准确性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号