Publication

Comparison of HMM experts with MLP experts in the Full Combination Multi-Band Approach to Robust ASR

Publications associées (51)

Improved Phone Posterior Estimation Through k-NN and MLP-Based Similarity

In this work, we investigate the possible use of k-nearest neighbour (kNN) classifiers to perform frame-based acoustic phonetic classification, hence replacing Gaussian Mixture Models (GMM) or MultiLayer Perceptrons (MLP) used in standard Hidden Markov Mod ...

Idiap2009

Application of Artificial Neural Network to Predict Survival Time for Patients with Bladder Cancer

Rafal Tomasz Dlugosz

This paper presents an application of an artificial neural network to determine survival time of patients with a bladder cancer. Different learning methods have been investigated to find a solution, which is most optimal from a computational complexity poi ...

Springer-Verlag2009

On Joint Modelling of Grapheme and Phoneme Information using KL-HMM for ASR

Hervé Bourlard, Guillermo Aradilla

In this paper, we propose a simple approach to jointly model both grapheme and phoneme information using Kullback-Leibler divergence based HMM (KL-HMM) system. More specifically, graphemes are used as subword units and phoneme posterior probabilities estim ...

Idiap2009

MLP-based Log Spectral Energy Mapping for Robust Overlapping Speech Recognition

Hervé Bourlard, John David Scott Dines, Weifeng Li

This paper investigates a multilayer perceptron (MLP) based acoustic feature mapping to extract robust features for automatic speech recognition (ASR) of overlapping speech. The MLP is trained to learn the mapping from log mel filter bank energies (MFBEs) ...

IDIAP2007

Posterior-Based Features and Distances in Template Matching for Speech Recognition

Hervé Bourlard, Guillermo Aradilla

The use of large speech corpora in example-based approaches for speech recognition is mainly focused on increasing the number of examples. This strategy presents some difficulties because databases may not provide enough examples for some rare words. In th ...

2007

Posterior-Based Features and Distances in Template Matching for Speech Recognition

Hervé Bourlard, Guillermo Aradilla

IDIAP2007

Direct optimisation of a multilayer perceptron for the estimation of cepstral mean and variance statistics

John David Scott Dines

We propose an alternative means of training a multilayer perceptron for the task of speech activity detection based on a criterion to minimise the error in the estimation of mean and variance statistics for speech cepstrum based features using the Kullback ...

IDIAP2007

The segmentation of multi-channel meeting recordings for automatic speech recognition

John David Scott Dines

One major research challenge in the domain of the analysis of meeting room data is the automatic transcription of what is spoken during meetings, a task which has gained considerable attention within the ASR research community through the NIST rich transcr ...

2006

The segmentation of multi-channel meeting recordings for automatic speech recognition

John David Scott Dines

IDIAP2006

Joint speech and speaker recognition

The goal of the thesis is to investigate different approaches that combine and integrate Automatic Speech Recognition (ASR) and Speaker Recognition (SR) systems, with applications to (1) User-Customized Password Speaker Verification (UCP-SV) systems, and, ...

EPFL2005

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search