针对传统的多重信号分类(multiple signal classification,简称MUSIC)算法定位声源位置时存在计算量大的问题,提出了一种基于宏微导向的蚁群(ant colony optimization,简称ACO)-MUSIC两级相控声源定位算法。首先,利用ACO估算出声源所在...针对传统的多重信号分类(multiple signal classification,简称MUSIC)算法定位声源位置时存在计算量大的问题,提出了一种基于宏微导向的蚁群(ant colony optimization,简称ACO)-MUSIC两级相控声源定位算法。首先,利用ACO估算出声源所在的宏观位置,再用MUSIC算法精确搜索声源所在的微观方位;其次,对提出的算法进行数值仿真,并搭建实验系统进行验证。仿真和实验结果表明,所提出的算法可以高精度、快速地定位出声源所在的位置;在搜索步距为0.05°时,算法的计算复杂度和计算时间仅为传统MUSIC算法的0.25%和2.8%。展开更多
A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decompositi...A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decomposition (MCAED) algorithm, the proposed method can iteratively estimate impulse response coefficients between the speech source and microphones by the adaptive subgradient projection method. Then, it acquires the time delays of microphone pairs, and calculates the source position by the geometric method. Compared with the traditional normal least mean square (NLMS) algorithm, the adaptive subgradient projection method achieves faster and more accurate convergence in a low signal-to-noise ratio (SNR) environment. Simulations for glasses digital hearing aids with four-component square array demonstrate the robust performance of the proposed method.展开更多
The steered response power-phase transform (SRP-PHAT) sound source localization algorithm is robust in a real environment. However, the large computation complexity limits the practical application of SRP-PHAT. For a ...The steered response power-phase transform (SRP-PHAT) sound source localization algorithm is robust in a real environment. However, the large computation complexity limits the practical application of SRP-PHAT. For a microphone array, each location corresponds to a set of time differences of arrival (TDOAs), and this paper collects them into a TDOA vector. Since the TDOA vectors in the adjacent regions are similar, we present a fast algorithm based on clustering search to reduce the computation complexity of SRP-PHAT. In the training stage, the K-means or Iterative Self-Organizing Data Analysis Technique (ISODATA) clustering algorithm is used to find the centroid in each cluster with similar TDOA vectors. In the procedure of sound localization, the optimal cluster is found by comparing the steered response powers (SRPs) of all centroids. The SRPs of all candidate locations in the optimal cluster are compared to localize the sound source. Experiments both in simulation environments and real environments have been performed to compare the localization accuracy and computational load of the proposed method with those of the conventional SRP-PHAT algorithm. The results show that the proposed method is able to reduce the computational load drastically and maintains almost the same localization accuracy and robustness as those of the conventional SRP-PHAT algorithm. The difference in localization performance brought by different clustering algorithms used in the training stage is trivial.展开更多
文摘针对传统的多重信号分类(multiple signal classification,简称MUSIC)算法定位声源位置时存在计算量大的问题,提出了一种基于宏微导向的蚁群(ant colony optimization,简称ACO)-MUSIC两级相控声源定位算法。首先,利用ACO估算出声源所在的宏观位置,再用MUSIC算法精确搜索声源所在的微观方位;其次,对提出的算法进行数值仿真,并搭建实验系统进行验证。仿真和实验结果表明,所提出的算法可以高精度、快速地定位出声源所在的位置;在搜索步距为0.05°时,算法的计算复杂度和计算时间仅为传统MUSIC算法的0.25%和2.8%。
基金Supported by the National Natural Science Foundation of China (60872073)~~
文摘A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decomposition (MCAED) algorithm, the proposed method can iteratively estimate impulse response coefficients between the speech source and microphones by the adaptive subgradient projection method. Then, it acquires the time delays of microphone pairs, and calculates the source position by the geometric method. Compared with the traditional normal least mean square (NLMS) algorithm, the adaptive subgradient projection method achieves faster and more accurate convergence in a low signal-to-noise ratio (SNR) environment. Simulations for glasses digital hearing aids with four-component square array demonstrate the robust performance of the proposed method.
基金supported by the National Natural Science Foundation of China(Grant Nos. 60971098 and 61201345)the Beijing Key Laboratory of Advanced Information Science and Network Technology(Grant No.XDXX1308)
文摘The steered response power-phase transform (SRP-PHAT) sound source localization algorithm is robust in a real environment. However, the large computation complexity limits the practical application of SRP-PHAT. For a microphone array, each location corresponds to a set of time differences of arrival (TDOAs), and this paper collects them into a TDOA vector. Since the TDOA vectors in the adjacent regions are similar, we present a fast algorithm based on clustering search to reduce the computation complexity of SRP-PHAT. In the training stage, the K-means or Iterative Self-Organizing Data Analysis Technique (ISODATA) clustering algorithm is used to find the centroid in each cluster with similar TDOA vectors. In the procedure of sound localization, the optimal cluster is found by comparing the steered response powers (SRPs) of all centroids. The SRPs of all candidate locations in the optimal cluster are compared to localize the sound source. Experiments both in simulation environments and real environments have been performed to compare the localization accuracy and computational load of the proposed method with those of the conventional SRP-PHAT algorithm. The results show that the proposed method is able to reduce the computational load drastically and maintains almost the same localization accuracy and robustness as those of the conventional SRP-PHAT algorithm. The difference in localization performance brought by different clustering algorithms used in the training stage is trivial.