Phoneme-aware and Channel-wise Attentive Learning for Text DependentSpeaker Verification
Not on the map. Why?
Abstract (arXiv)
This paper proposes a multi-task learning network with phoneme-aware and channel-wise attentive learning strategies for text-dependent Speaker Verification (SV). In the proposed structure, the frame-level multi-task learning along with the segment-level adversarial learning is adopted for speaker embedding extraction. The phoneme-aware attentive pooling is exploited on frame-level features in the main network for speaker classifier, with the corresponding posterior probability for the phoneme distribution in the auxiliary subnet. Further, the introduction of Squeeze and Excitation (SE-block) performs dynamic channel-wise feature recalibration, which improves the representational ability. The proposed method exploits speaker idiosyncrasies associated with pass-phrases, and is further improved by the phoneme-aware attentive pooling and SE-block from temporal and channel-wise aspects, respectively. The experiments conducted on RSR2015 Part 1 database confirm that the proposed system achieves outstanding results for textdependent SV.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 32 references that are in the map. First posted on arXiv 25 Jun 2021.
Builds on
9 of 32 references.
References · 9
- 2017Attention Is All You Needcited by 59,932
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Squeeze-and-Excitation Networkscited by 4,763
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2018Attentive Statistics Pooling for Deep Speaker Embeddingcited by 108
- 2017Attention-Based Models for Text-Dependent Speaker Verificationcited by 17
- 2018Speaker Embedding Extraction with Phonetic Informationcited by 9
- 2017Phonetic Temporal Neural Model for Language Identificationcited by 2
- 2018Spoken Pass-Phrase Verification in the i-vector Spacecited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1.
2 papers.