𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for parallel model combination for noisy speech recognition

✍ Scribed by Tai-Hwei Hwang; Hsiao-Chuan Wang


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
223 KB
Volume
14
Category
Article
ISSN
0885-2308

No coin nor oath required. For personal study only.

✦ Synopsis


Based on the log-normal assumption, parallel model combination (PMC) provides an effective method to adapt the cepstral means and variances of speech models for noisy speech recognition. In addition, the log-add method has been derived to adapt the mean by ignoring the cepstral variance during the process of PMC. This method is efficient for speech recognition in a high signal-to-noise ratio (SNR) environment. In this paper, a new interpretation of the log-add method is proposed. This leads to a modified scheme for performing the adaptation procedure in PMC. This modified method is shown to be efficient in improving recognition accuracy in low SNR. Based on this modified PMC method, we derive a direct adaptation procedure for the variance of speech models in the cepstral domain. The proposed method is a fast algorithm because the computation for the transformation of the covariance matrix is no longer required. Three recognition tasks are conducted to evaluate the proposed method. Experimental results show that the proposed technique not only requires lower computational cost but it also outperforms the original PMC technique in noisy environments.


πŸ“œ SIMILAR VOLUMES


A word graph algorithm for large vocabul
✍ Stefan Ortmanns; Hermann Ney; Xavier Aubert πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 360 KB

This paper describes a method for the construction of a word graph (or lattice) for large vocabulary, continuous speech recognition. The advantage of a word graph is that a fairly good degree of decoupling between acoustic recognition at the 10-ms level and the final search at the word level using a

A Fast Parallel Algorithm for the Poisso
✍ Leonardo Borges; Prabir Daripa πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 411 KB

A parallel algorithm for solving the Poisson equation with either Dirichlet or Neumann conditions is presented. The solver follows some of the principles introduced in a previous fast algorithm for evaluating singular integral transforms by Daripa et al. Here we present recursive relations in Fourie

A fast, one-equation integration algorit
✍ de Souza Neto, E. A. πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 178 KB

## Abstract This paper introduces an elastic predictor/return mapping integration algorithm for a simplified version of the Lemaitre ductile damage model, whose return mapping stage requires the solution of only one scalar non‐linear equation. The simplified damage model differs from its original c

Hypercolumn model: A combination model o
✍ Naoyuki Tsuruta; Rin-ichiro Taniguchi; Makoto Amamiya πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 702 KB

In this paper, a neural network model, the hypercolumn model (HCM), which is applicable to general image recognition, is proposed. The HCM is a combination model of hierarchical self-organizing maps (HSOM) and neocognitron (NC); it resolves the disadvantages of both the HSOM and the NC, and inherits

A path-stack algorithm for optimizing dy
✍ Jeff Z. Ma; Li Deng πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 135 KB

In this paper we report our recent research whose goal is to improve the performance of a novel speech recognizer based on an underlying statistical hidden dynamic model of phonetic reduction in the production of conversational speech. We have developed a path-stack search algorithm which efficientl