|
naistar (NAIST Academic Repository) >
学術リポジトリ naistar / NAIST Academic Repository naistar >
国際会議発表論文 / Proceedings >
情報科学研究科 / Graduate School of Information Science >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10061/8035
|
| Title: | A Microphone Array-Based 3-D N-Best Search Algorithm for the Simultaneous Recognition of Multiple Sound Sources in Real Environments |
| Authors: | Panikos Heracleous
Satoshi Nakamura
Kiyohiro Shikano |
| Issue Date: | May-2001 |
| Publisher: | IEEE |
| Start page: | 193 |
| End page: | 196 |
| Abstract: | Deals with the recognition of distant talking speech and, particularly, with the simultaneous recognition of multiple sound sources. A problem that must be solved in the recognition of distant talking speech is talker localization. In some approaches, the talker is localized by using short- and long-term power. The 3-D Viterbi search based method proposed by Yamada et al.(1998), integrates talker localization and speech recognition. This method provides high recognition rates but its application is restricted to the presence of one talker. In order to deal with multiple talkers, we extended the 3-D Viterbi search method to a 3-D N-best search method enabling the recognition of multiple sound sources. The paper describes our baseline 3-D N-best search-based system and two additional techniques, namely, a likelihood normalization technique and a path distance-based clustering technique. The paper also describes experiments carried out in order to evaluate the performance of the system |
| Description: | ICASSP2001: IEEE International Conference on Acoustics, Speech and Signal Processing, May 7-11, 2001, Salt Lake City, Utah, US. |
| URI: | http://hdl.handle.net/10061/8035 |
| ISBN: | 0780370414 |
| ISSN: | 1520-6149 |
| Rights: | Copyright 2001 IEEE |
| Text Version: | Publisher |
| Publisher DOI: | 10.1109/ICASSP.2001.940800 |
| Appears in Collections: | 情報科学研究科 / Graduate School of Information Science
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
