Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.28033

Subjective Evaluation of DNN AND Auditory-Model-Based Hearing-Loss Compensation

Chuan Wen·Brent Nissens·Nele De Poortere·Morgan Thienpont·Matthias Inghels·Attila Fráter·Guy Torfs·Sarah Verhulst
View original source ↗Read source document ↗Export metadata ↓

Abstract

Outer-hair-cell (OHC) loss is a primary deficit of sensorineural hearing loss (SNHL), impairing cochlear amplification and frequency selectivity and thereby elevating hearing thresholds. Biophysically-inspired DNN-based hearing-aid (HA) algorithms have been proposed to compensate for OHC deficits and have shown clear benefits in objective speech intelligibility and quality metrics (e.g. HASPI, HASQI). However, comprehensive subjective validation of these benefits in human listeners is still missing. In this work, we present a subjective evaluation of a biophysically-inspired HA model targeting OHC deficits. The cochlear module of an auditory model was individualized based on each listener's pure-tone audiogram and integrated into a trainable system, which includes the personalized model and a normal-hearing reference model, and the resulting trained HA was evaluated using a Matrix test comparing intelligibility scores for unprocessed and HA-processed noisy speech. The results revealed a significant benefit of the HA model over the unprocessed condition in the range of +1 to +27%, providing behavioral confirmation of the efficacy of the HA model. This study closes the gap between objective and perceptual evidence for this new generation of DNN-based HA algorithms, paving the way for their integration into next-generation DNN-accelerated chips for hearables and hearing aids.

Explore related subjects

eess.AS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chuan Wen, Brent Nissens, Nele De Poortere, Morgan Thienpont, Matthias Inghels, Attila Fráter, Guy Torfs, Sarah Verhulst. 2026-09-23. Subjective Evaluation of DNN AND Auditory-Model-Based Hearing-Loss Compensation. https://arxiv.org/abs/2609.28033

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Deep Filter Estimation from Inter-Frame Correlations for Monaural Speech Dereverberation

Speech dereverberation with a distant microphone is challenging because reverberation is correlated with the target speech, and models trained on simulated data often generalize poorly to real recordings. We propose IF-CorrNet, a correlation-to-filter architecture for monaural dereverberation. Instead of feeding raw complex STFT coefficients to the network, IF-CorrNet computes inter-frame correlations among neighboring frames at each time-frequency bin and estimates multi-frame deep filters from these features with a dual-path Transformer backbone. This design makes inter-frame dependencies explicit at the network input while retaining a multi-frame filtering output, a pairing motivated by the normal equation of linear multi-frame filtering. On the REVERB Challenge corpus, IF-CorrNet achieves the best CD, LLR, SNRfw, and PESQ among the compared dereverberation baselines on SimData, and the highest SRMR among the compared systems on RealData. The ablation shows higher RealData SRMR with correlation inputs for both filtering and masking, with filtering adding a further gain.

eess.AS↗
arXiv2026

Recovering the Zipfian Distribution in Unsupervised Term Discovery

Unsupervised term discovery involves segmenting unlabelled speech into word- or syllable-like units and clustering these into a lexicon of candidate types. True lexicons follow a Zipfian distribution, yet the dominant centre-based clustering approach -- K-means -- produces a more uniform distribution due to an inductive bias toward spherical clusters. In this paper we revisit graph-based clustering as a bottom-up alternative, where segment embeddings are connected by pairwise similarity and partitioned using the Leiden algorithm. We show that graph clustering substantially outperforms centre-based approaches (K-means, GMM, BIRCH) in both word- and syllable-level lexicon discovery across three languages, producing more Zipf-like distributions. Another bottom-up approach, agglomerative clustering with average linkage, also performs well, although it is computationally less efficient and allows for less control over the resulting distribution. Our work calls into question the dominance of centre-based clustering for term discovery, and promotes graph clustering as an attractive alternative.

eess.AS↗
arXiv2026

CHILDES-Aligned: A Curated Children's Speech Dataset via Multi-Model Timestamp Ensembling

CHILDES is a large-scale child speech corpus containing long-form recordings of naturalistic child-adult interactions, making it a valuable resource for studying child speech and language development. However, utterance-level timestamps provided in this corpus are often noisy, incomplete, or misaligned with the audio. As a result, utterances cannot always be reliably localized within long recordings, which limits the direct use of these data for training and evaluating speech models. In this work, we propose BEACON (Boundary Estimation via Alignment CONsensus), an ensemble timestamp-curation framework that refines utterance-level timestamps by aggregating knowledge from multiple off-the-shelf ASR models. Specifically, each model's word-level timestamp predictions are first aligned to provided human transcripts, and the final utterance time boundaries are determined by a consensus voting strategy. The framework is corpus-agnostic and applies to any long-form recording paired with a trusted transcript whose timestamps are unreliable or missing, offering a general recipe for timestamp curation. Leveraging this pipeline, we curate and release a 413-hour general-purpose child-speech dataset with corrected utterance-level timestamps, together with a 283-hour quality-controlled subset for ASR training. Fine-tuning on this subset yields up to an average 19.5% relative WER reduction on four out-of-domain child-speech benchmarks.

eess.AS↗