Dual-Branch Speech Enhancement Network for Noise-Robust Automatic Speech Recognition

Automatic speech recognition (ASR) has achieved remarkable successes thanks to the end-to-end deep neural networks, but it is still challenging in the noisy and reverberation environments. The joint training of front-end speech enhancement (SE) and speech recognition system becomes a popular solution to the noise-robust ASR. However, the speech distortion problem arisen due to excessive information suppression by the SE module. To address this issue, in this paper, a novel dual-branch SE (DBSE) module is proposed as the front-end of the ASR system for joint training. Particularly, the two branches extract the clean speeches using different ways: one branch directly extracts clean speeches and the other branch utilizes spectral subtraction method. The final denoising speech signals are obtained by combining the outputs from both branches. In this way, the oversuppressed information can be compensated from each other. The two-stage joint training strategy is adopted for the noise-robust ASR model where the proposed DBSE is first pretrained by multitask reconstruction loss, and then the DBSE and ASR model is jointly trained using the speech recognition based loss function. Comparisons with several state-of-the-art ASR algorithms on benchmark dataset are conducted, and the results demonstrate the superior performance of our proposed algorithm.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10865505
Primary Topic
Speech and Audio Processing
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dual-Branch Speech Enhancement Network for Noise-Robust Automatic Speech Recognition

Haobin Jiang, Jiuwen Cao, Tianlei Wang, Dinghan Hu
Speech and Audio Processing
article

Dual-Branch Speech Enhancement Network for Noise-Robust Automatic Speech Recognition

Haobin Jiang, Jiuwen Cao, Tianlei Wang, Dinghan Hu
article en

Abstract

Automatic speech recognition (ASR) has achieved remarkable successes thanks to the end-to-end deep neural networks, but it is still challenging in the noisy and reverberation environments. The joint training of front-end speech enhancement (SE) and speech recognition system becomes a popular solution to the noise-robust ASR. However, the speech distortion problem arisen due to excessive information suppression by the SE module. To address this issue, in this paper, a novel dual-branch SE (DBSE) module is proposed as the front-end of the ASR system for joint training. Particularly, the two branches extract the clean speeches using different ways: one branch directly extracts clean speeches and the other branch utilizes spectral subtraction method. The final denoising speech signals are obtained by combining the outputs from both branches. In this way, the oversuppressed information can be compensated from each other. The two-stage joint training strategy is adopted for the noise-robust ASR model where the proposed DBSE is first pretrained by multitask reconstruction loss, and then the DBSE and ASR model is jointly trained using the speech recognition based loss function. Comparisons with several state-of-the-art ASR algorithms on benchmark dataset are conducted, and the results demonstrate the superior performance of our proposed algorithm.

China International Science and Technology Cooperation (CN)
National Natural Science Foundation of China, Natural Science Foundation of Zhejiang Province
Openalex Percentile: Top 70%
Speech and Audio Processing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.