Near-End Listening Enhancement Using a Noise-Robust Linear Time-Invariant Filter

In environments with competing sound sources, speech intelligibility can be significantly compromised. This paper addresses the near-end listening enhancement (NELE) problem, i.e., the problem of processing an available clean speech signal in order to maximize its intelligibility when it is subsequently presented to a human listener in an adverse acoustic situation. We propose a time-invariant and low-complexity NELE algorithm that maximizes an approximation of the Speech Intelligibility Index by redistributing speech energy across frequency bands. Unlike existing algorithms, the proposed algorithm incorporates a mechanism that allows it to distinguish between temporally fluctuating and non-fluctuating noise maskers by using only long-term speech and noise statistics. Simulation results show that the proposed method outperforms baseline algorithms, whether time-invariant or time-varying, in a wide range of noise conditions.

Authors

Institutions

Publication Details

Published
2024-09-09
DOI
https://doi.org/10.1109/iwaenc61483.2024.10694258
Primary Topic
Speech and Audio Processing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Near-End Listening Enhancement Using a Noise-Robust Linear Time-Invariant Filter

Jan Østergaard, Zheng‐Hua Tan, Jesper Jensen, Wai-Yip Chan et al.
Speech and Audio Processing
article

Near-End Listening Enhancement Using a Noise-Robust Linear Time-Invariant Filter

Jan Østergaard, Zheng‐Hua Tan, Jesper Jensen, Wai-Yip Chan, Filippo Villani
article en

Abstract

In environments with competing sound sources, speech intelligibility can be significantly compromised. This paper addresses the near-end listening enhancement (NELE) problem, i.e., the problem of processing an available clean speech signal in order to maximize its intelligibility when it is subsequently presented to a human listener in an adverse acoustic situation. We propose a time-invariant and low-complexity NELE algorithm that maximizes an approximation of the Speech Intelligibility Index by redistributing speech energy across frequency bands. Unlike existing algorithms, the proposed algorithm incorporates a mechanism that allows it to distinguish between temporally fluctuating and non-fluctuating noise maskers by using only long-term speech and noise statistics. Simulation results show that the proposed method outperforms baseline algorithms, whether time-invariant or time-varying, in a wide range of noise conditions.

Queen's University (CA), Aalborg University (DK)
Openalex Percentile: Top 81%
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.