Content-Based Classification, Search, and Retrieval of Audio
IEEE MultiMedia
Multimodal estimation of user interruptibility for smart mobile telephones
Proceedings of the 8th international conference on Multimodal interfaces
Characteristics-based effective applause detection for meeting speech
Signal Processing
CLEAR evaluation of acoustic event detection and classification systems
CLEAR'06 Proceedings of the 1st international evaluation conference on Classification of events, activities and relationships
The CLEAR 2006 CMU acoustic environment classification system
CLEAR'06 Proceedings of the 1st international evaluation conference on Classification of events, activities and relationships
| Hi-index | 0.00 |
Hidden Markov models (HMMs) permit a natural and flexible way to model time-sequential data. The ease of concatenation and time-warping algorithms implementation on HMMs suit them very well for segmentation and content based audio classification applications, as is clear from their extended and successful use on speech recognition applications. Speech has a natural basic unit, the phone, which normally delimits the number of models to one per phone. Moreover, knowledge of the speech structure facilitates the choice of the model parameters. When modeling generic audio, on other hand, the lack of a natural basic unit, and the absence of a clear structure, make the selection and the parameter estimation of an optimal set of HMMs difficult. In this paper we present different approaches to select and estimate the HMM parameters of a set of representative generic audio classes. We compare these approaches in the context of a content- based classification application using the MuscleFish database. The models are first found through frame clustering or by traditional EM techniques under some specific selection criteria, such as the Bayesian information criterion. Further discriminative training of the initial models considerably improve their performance in the content-based classification task, obtaining results comparable with the ones obtained, for the same task, by inherently discriminative classification methods, such as support vector machines, while preserving the intrinsic flexibility of HMMs.