A Steered-Response Power Algorithm Employing Hierarchical Search for Acoustic Source Localization Using Microphone Arrays
The localization of a speaker inside a closed environment is often approached by real-time processing of multiple audio signals captured by a set of microphones. One of the leading related methods for sound source localization, the steered-response power (SRP), searches for the point of maximum powe...
Saved in:
| Published in: | IEEE transactions on signal processing Vol. 62; no. 19; pp. 5171 - 5183 |
|---|---|
| Main Authors: | , , , , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.10.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 1053-587X, 1941-0476 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The localization of a speaker inside a closed environment is often approached by real-time processing of multiple audio signals captured by a set of microphones. One of the leading related methods for sound source localization, the steered-response power (SRP), searches for the point of maximum power over a spatial grid. High-accuracy localization calls for a dense grid and/or many microphones, which tends to impractically increase computational requirements. This paper proposes a new method for sound source localization (called H-SRP), which applies the SRP approach to space regions instead of grid points. This arrangement makes room for the use of a hierarchical search inspired by the branch-and-bound paradigm, which is guaranteed to find the global maximum in anechoic environments and shown experimentally to also work under reverberant conditions. Besides benefiting from the improved robustness of volume-wise search over point-wise search as to reverberation effects, the H-SRP attains high performance with manageable complexity. In particular, an experiment using a 16-microphone array in a typical presentation room yielded localization errors of the order of 7 cm, and for a given fixed complexity, competing methods' errors are two to three times larger. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 1053-587X 1941-0476 |
| DOI: | 10.1109/TSP.2014.2336636 |