Show simple item record

dc.contributor.authorMoir, T
dc.contributor.authorAgaiby, H
dc.date.accessioned2011-08-02T20:12:55Z
dc.date.available2011-08-02T20:12:55Z
dc.date.copyright1997
dc.date.issued2011-08-03
dc.identifier.citationEurospeech 97. 5th European Conference on Speech Communication and Technology, Rhodes Greece, 1997-09-22 - 1997-09-25, pages 1119 - 1122
dc.identifier.urihttp://hdl.handle.net/10292/1546
dc.description.abstractThis paper introduces a word boundary detection algorithm that works in a variety of noise conditions including what is commonly called the 'cocktail party' situation. The algorithm uses the direction of the signal as the main criterion for differentiating between desired-speech and background noise. To determine the signal direction the algorithm calculates estimates of the time delay between signals received at two microphones. These time delay estimates together with estimates of the coherence function and signal energy are used to locate word boundaries. The algorithm was tested using speech embedded in different types and levels of noise including car noise, factory noise, babble noise, and competing talkers. The test results showed that the algorithm performs very well under adverse conditions and with SNR down to -14.5dB.
dc.publisherInternational Speech Communication Association (ISCA)
dc.relation.urihttp://www.isca-speech.org/archive/eurospeech_1997/e97_1119.html
dc.rightsUse, reproduction, modification, and other intellectual property rights to content posted on isca-speech.org shall be subject to the terms of any applicable approved license. With respect to content posted on isca-speech.org the submitting user / member retains ownership of such content.
dc.titleKnowing the wheat from the weeds in noisy speech
dc.typeConference Contribution
dc.rights.accessrightsOpenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record