Full metadata record
DC FieldValueLanguage
dc.contributor.authorWu, GDen_US
dc.contributor.authorLin, CTen_US
dc.date.accessioned2014-12-08T15:44:15Z-
dc.date.available2014-12-08T15:44:15Z-
dc.date.issued2001-02-01en_US
dc.identifier.issn1083-4419en_US
dc.identifier.urihttp://dx.doi.org/10.1109/3477.907566en_US
dc.identifier.urihttp://hdl.handle.net/11536/29875-
dc.description.abstractThis paper discusses the problem of automatic word boundary detection in the presence of variable-level background noise. Commonly used robust word boundary detection algorithms always assume that the background noise level is fixed. In fact, the background noise level mag vary during the procedure of recording. This is the major reason that most robust word boundary detection algorithms cannot work well in the condition of variable background noise level, In order to solve this problem, we first propose a refined time-frequency (RTF) parameter for extracting both the time and frequency features of noisy speech signals. The RTF parameter extends the (time-frequency) TF parameter proposed by Junqua et al, from single band to multiband spectrum analysis, where the frequency bands help to make the distinction between speech signal and noise clear. The RTF parameter can extract useful frequency information, Based on this RTF parameter, we further propose a new word boundary detection algorithm by using a recurrent sell-organizing neural fuzzy inference network (RSONFIN). Since RSONFIN can process the temporal relations, the proposed RTF-based RSONFIN algorithm can find the variation of the background noise level and detect correct word boundaries in the condition of variable background noise level. As compared to normal neural networks, the RSONFIN can always find itself an economic network size with high-learning speed, Due to the self-learning ability of RSONFIN, this RTF-based RSONFIN algorithm avoids the need for empirically determining ambiguous decision rules in normal word boundary detection algorithms. Experimental results show that this new algorithm achieves higher recognition rate than the TF-based algorithm which has been shown to outperform several commonly used word boundary detection algorithms by about 12% in variable background noise level condition. It also reduces the recognition error rate due to endpoint detection to about 23%, compared to an average of 47% obtained by the TF-based algorithm in the same condition.en_US
dc.language.isoen_USen_US
dc.subjectcepstrumen_US
dc.subjectlinear prediction coefficient (LPC)en_US
dc.subjectmel-scale filter banken_US
dc.subjectrecurrent networken_US
dc.subjectspace partitionen_US
dc.subjecttime-frequency (TF)en_US
dc.titleA recurrent neural fuzzy network for word boundary detection in variable noise-level environmentsen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/3477.907566en_US
dc.identifier.journalIEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICSen_US
dc.citation.volume31en_US
dc.citation.issue1en_US
dc.citation.spage84en_US
dc.citation.epage97en_US
dc.contributor.department電控工程研究所zh_TW
dc.contributor.departmentInstitute of Electrical and Control Engineeringen_US
dc.identifier.wosnumberWOS:000167276800006-
dc.citation.woscount18-
Appears in Collections:Articles


Files in This Item:

  1. 000167276800006.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.