Skip to main content
Article thumbnail
Location of Repository


By Lingyun Gu, Jianbo Gao and John G. Harris


Speech endpoint detection continues to be a challenging problem particularly for speech recognition in noisy environments. In this paper, we address this problem from the point of view of fractals and chaos. By studying recurrence time statistics for chaotic systems, we find the nonstationarity and transience in a time series are due to non-recurrence and lack of fractal structure in the signal. A Poincaré recurrence metric is designed to determine the stationarity change for endpoint detection. We consider the small area of beginning and ending of an utterance as transient. For nonstationary and transient time series, we expect the average number of Poincaré recurrence points for each given small block will be different for different blocks of data subsets. However, the average number of recurrence points will stay nearly constant. The resulting recurrence point variability algorithm is shown to be well suited for the detection of state transitions in a time series and is very robust for different types of noise, especially for low SNR. 1

Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.