MétaCan
Menu
Retour à la cohorte
Enregistrement W310658760 · doi:10.21437/eurospeech.2001-384

Robust automatic speech recognition in low-SNR car environments by the application of a connectionist subspace-based approach to the melbased cepstral coefficients

2001· article· en· W310658760 sur OpenAlexaff
Sid‐Ahmed Selouani, Hesham Tolba, Douglas O’Shaughnessy

Notice bibliographique

Revuenon disponible
Typearticle
Langueen
DomaineComputer Science
ThématiqueSpeech and Audio Processing
Établissements canadiensUniversité du Québec
Organismes subventionnairesnon disponible
Mots-clésComputer scienceSpeech recognitionTIMITRobustness (evolution)Pattern recognition (psychology)CepstrumArtificial intelligenceMel-frequency cepstrumHidden Markov modelSubspace topologyNoise (video)Multilayer perceptronPreprocessorNoise reductionSpeech enhancementFeature extractionArtificial neural network

Résumé

récupéré en direct d'OpenAlex

ABSTRACTIn this paper, the problem of robust large-vocabulary continuous-speech recognition (CSR) in the presence of highly interferingcar noise has been considered. Our approach is based on thenoise reduction of the parameters that we use for recognition,that is, the Mel-based cepstral coefficients. This is achieved bythe use of a Multilayer Perceptron (MLP) network for noise re-duction in the cepstral domain in order to get less-variant pa-rameters. Then, the obtained enhanced features are refined viathe Karhunen-Lo`eve Transform (KLT) implemented using thePrincipal Component Analysis (PCA). Experiments show thatthe use of the enhanced parameters using such an approach in-creases the recognition rate of the CSR process in highly inter-fering car noise environments. The HTK Hidden Markov ModelToolkit was used throughout our experiments. Results show thatthe proposed hybrid technique when included in the front-endof an HTK-based CSR system, outperforms that of the conven-tional recognition process based on either a KLT- or an MLP-based preprocessing recognition in severe interfering car noiseenvironments for a wide range of SNRs varying from 16 dB to-4 dB using a noisy version of the TIMIT database.1. INTRODUCTIONThe performance of existing CSR systems, whose designs arepredicated on relatively noise-free conditions, degrades rapidlyin the presence of a high level of adverse conditions. Several ap-proaches have been studied for achieving noise robustness [1, 2].In this paper, we focus on optimizing the performance of a CSRsystem by choosing a suitable distortion measure. The idea ofa robust distance measure is to extract relevant features fromspeech signals which must be insensitive to degradations of thespeech signal due to interfering noise or distortions. Many ap-proaches [3] have been used to extract relevant features froma speech signal. Cepstral parameters are well suited to speechrecognition due to their compact orthogonality. Unfortunately,cepstral features are highly sensitive to noise. It was shown in[4] that cepstral distributions for clean data are well behaved andapproximately normal, but in the presence of noise, their profilesare changed significantly and this consequently degrades the per-formance of an CSR system. However, the cepstrum coefficientshave the additional advantage that one can derive from them aset of parameters which are invariant to any fixed frequency-response distortion introduced by either the adverse environ-ments or thetransmission channels. Severalapproaches toobtaina new set of robust parameters were introduced in [5, 6, 7].In this paper, we propose a novel robust CSR system to be usedin car noisy environments. Our approach for noise reduction isapplied in the cepstral domain. It is based on the application ofa combination of the Karhunen-Lo`eve Transform (KLT) and aConnectionist approach. Each of these two approaches has beensuccessfully used in both speech enhancement and recognitionprocesses. We show in this paper through experiments on highlynoisy data that a cepstral noise reduction can be obtained us-ing such an approach and consequently an improvement of therecognition performance.This paper will be organized into the following sections. In sec-tion 2 we describe the basis of the MLP network and the PCAapproaches that will be used to describe our proposed hybridPCA-MLP approach. Then, we proceed in section 3 with the de-scription of the database, the platform used in our experimentsand the evaluation of the proposed MLP-PCA-based recognizerin a noisy car environment and the comparison of such a recog-nizer to both the MLP- and the PCA-based recognizers in orderto evaluate its performance. Finally, in section 5 we concludeand discuss our results.2. PROPOSED ENHANCEMENT APPROACH2.1. Multilayer Perceptron NetworkAs mentioned above, the first step that has been proposed to im-prove the performance of the CSRprocess in highly noisy caren-vironments in the cepstral domain is the use of a multilayer per-ceptron (MLP) network. The fact that the noise and the speechsignal are combined in a nonlinear way in the cepstral domainmotivated us to choose the MLP, since it can approximate the re-quired nonlinear function to some extent [6, 7]. The input of theMLP is the noisy MFCC vector

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Comment cette classification a été obtenuedéplier

Prédiction distillée sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.

score de la tête « metaresearch » (Codex)0,001
score de la tête « metaresearch » (Gemma)0,000
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesaucune
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Autre devis · Signal consensuel: aucune
GenreSignal candidat: Empirique · Signal consensuel: aucune
Score de désaccord entre enseignants0,847
Score d'incertitude au seuil0,358

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0010,000
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0000,000
Bibliométrie0,0000,001
Études des sciences et des technologies0,0000,000
Communication savante0,0000,000
Science ouverte0,0010,000
Intégrité de la recherche0,0000,000
Charge utile insuffisante (le modèle a refusé de juger)0,0000,000

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,023
Tête enseignante GPT0,224
Écart entre enseignants0,201 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.

Les modèles n’ont appliqué aucune catégorie : rien dans la taxonomie ne correspondait à ce travail.
Devis d'étudeAutre devis
Domainenon disponible
GenreEmpirique

Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».

En bref

Citations3
Publié2001
Routes d'admission1
Résumé présentoui

Explorer davantage

Même sujetSpeech and Audio ProcessingTravaux en français237 207