An Approach to Solve Local Minimum Problem in Sound Source and Microphone Localization

Authors:
Kazunori Kobayashi;Ken'ichi Furuya;Yoichi Haneda;Akitoshi Kataoka
Affiliations:
-;-;-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2007

Citing 4
Cited 0

Voice Source Localization for Automatic Camera Pointing System in Videoconferencing

ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97) -Volume 1 - Volume 1
Performance Improvement of Hybrid Real-Coded Genetic Algorithm with Local Search and Its Applications

CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-1 (CIMCA-IAWTIC'06) - Volume 01
A real-coded genetic algorithm involving a hybrid crossover method for power plant control system design

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Closed-form 2-D angle estimation with rectangular arrays in elementspace or beamspace via unitary ESPRIT

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We previously proposed a method of sound source and microphone localization. The method estimates the locations of sound sources and microphones from only time differences of arrival between signals picked up by microphones even if all their locations are unknown. However, there is a problem that some estimation results converge to local minimum solutions because this method estimates locations iteratively and the error function has multiple minima. In this paper, we present a new iterative method to solve the local minimum problem. This method achieves accurate estimation by selecting effective initial locations from many random initial locations. The computer simulation and experimental results demonstrate that the presented method eliminates most local minimum solutions. Furthermore, the computational complexity of the presented method is similar to that of the previous method.