HMM based fast keyworld spotting algorithm with no garbage models

Sunil, S and Palit, Supriyo and Sreenivas, TV (1997) HMM based fast keyworld spotting algorithm with no garbage models. In: 1997 International Conference on Information, Communications and Signal Processing, ICICS, 9-12 September, Singapore, pp. 1020-1023.

Preview

PDF HMM_based.pdf Download (311kB)

Abstract

The problem of discriminating keyword and non-keyword speech which is important in wordspotting applications is addressed. We have shown that garbage models cannot reduce both the rejection and false alarm rates simultaneously. To achieve this we have proposed a new scoring and search method for HMM based wordspotting without garbage models. This is a simple forward search method which incorporates the duration modelling of the keyword for efficient discrimination of keyword and non-keyword speech. This method is computationally fast, which makes it suitable for real-time implementation. The results are reported on a speaker independent database containing 10 keywords embedded in 150 carrier sentences

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE
Department/Centre:	Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited:	28 Mar 2007
Last Modified:	19 Sep 2010 04:35
URI:	http://eprints.iisc.ac.in/id/eprint/9928

Actions (login required)

View Item