Eigenvalues Driven Gaussian Selection in continuous speech recognition using HMMs with full covariance matrices

Authors:
Marko Janev;Darko Pekar;Niksa Jakovljevic;Vlado Delic
Affiliations:
Faculty of Technical Sciences Novi Sad, University of Novi Sad, Novi Sad, Serbia;Alfanum Speech Technologies, Novi Sad, Serbia;Faculty of Technical Sciences Novi Sad, University of Novi Sad, Novi Sad, Serbia;Faculty of Technical Sciences Novi Sad, University of Novi Sad, Novi Sad, Serbia
Venue:
Applied Intelligence
Year:
2010

Citing 7
Cited 4

On ordered weighted averaging aggregation operators in multicriteria decisionmaking

IEEE Transactions on Systems, Man and Cybernetics
Context dependent modeling of phones in continuous speech using decision trees

HLT '91 Proceedings of the workshop on Speech and Natural Language
Fundamentals of statistical signal processing: estimation theory

Fundamentals of statistical signal processing: estimation theory
Uninorm aggregation operators

Fuzzy Sets and Systems
The ordered weighted averaging operators: theory and applications

The ordered weighted averaging operators: theory and applications
Tree-based state tying for high accuracy acoustic modelling

HLT '94 Proceedings of the workshop on Human Language Technology
Full reinforcement operators in aggregation techniques

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

A novel split-and-merge algorithm for hierarchical clustering of Gaussian mixture models

Applied Intelligence
A multi-threshold segmentation approach based on Artificial Bee Colony optimization

Applied Intelligence
A comparison of nature inspired algorithms for multi-threshold image segmentation

Expert Systems with Applications: An International Journal
A novel classification method for palmprint recognition based on reconstruction error and normalized distance

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a novel algorithm for Gaussian Selection (GS) of mixtures used in a continuous speech recognition system is presented. The system is based on hidden Markov models (HMM), using Gaussian mixtures with full covariance matrices as output distributions. The purpose of Gaussian selection is to increase the speed of a speech recognition system, without degrading the recognition accuracy. The basic idea is to form hyper-mixtures by clustering close mixtures into a single group by means of Vector Quantization (VQ) and assigning it unique Gaussian parameters for estimation. In the decoding process only those hyper-mixtures which are above a designated threshold are selected, and only mixtures belonging to them are evaluated, improving computational efficiency. There is no problem with the clustering and evaluation if overlaps between the mixtures are small, and their variances are of the same range. However, in real case, there are numerous models which do not fit this profile. A Gaussian selection scheme proposed in this paper addresses this problem. For that purpose, beside the clustering algorithm, it also incorporates an algorithm for mixture grouping. The particular mixture is assigned to a group from the predefined set of groups, based on a value aggregated from eigenvalues of the covariance matrix of that mixture using Ordered Weighted Averaging operators (OWA). After the grouping of mixtures is carried out, Gaussian mixture clustering is performed on each group separately.