The reviewed record of science sign in
Pith

arxiv: 1810.10884 · v2 · pith:67A4PNGY · submitted 2018-10-25 · eess.AS · cs.AI· cs.SD

Short utterance compensation in speaker verification via cosine-based teacher-student learning of speaker embeddings

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:67A4PNGYrecord.jsonopen to challenge →

classification eess.AS cs.AIcs.SD
keywords speakerproposedshortcompensationdurationembeddingslayerslearning
0
0 comments X
read the original abstract

The short duration of an input utterance is one of the most critical threats that degrade the performance of speaker verification systems. This study aimed to develop an integrated text-independent speaker verification system that inputs utterances with short duration of 2 seconds or less. We propose an approach using a teacher-student learning framework for this goal, applied to short utterance compensation for the first time in our knowledge. The core concept of the proposed system is to conduct the compensation throughout the network that extracts the speaker embedding, mainly in phonetic-level, rather than compensating via a separate system after extracting the speaker embedding. In the proposed architecture, phonetic-level features where each feature represents a segment of 130 ms are extracted using convolutional layers. A layer of gated recurrent units extracts an utterance-level feature using phonetic-level features. The proposed approach also adopts a new objective function for teacher-student learning that considers both Kullback-Leibler divergence of output layers and cosine distance of speaker embeddings layers. Experiments were conducted using deep neural networks that take raw waveforms as input, and output speaker embeddings on VoxCeleb1 dataset. The proposed model could compensate approximately 65 \% of the performance degradation due to the shortened duration.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.