Improving Text-independent Speaker Verification With Auxiliary Speakers Using Graph

Abstract

The paper presents a novel approach to refining similarity scores between input utterances for robust speaker verification. Given the embeddings from a pair of input utterances, a graph model is designed to incorporate additional information from a group of embeddings representing the so-called auxiliary speakers. The relations between the input utterances and the auxiliary speakers are represented by the edges and vertices in the graph. The similarity scores are refined by iteratively updating the values of the graph's vertices using an algorithm similar to the random walk algorithm on graphs. Through this updating process, the information of auxiliary speakers is involved in determining the relation between input utterances and hence contributing to the verification process. We propose to create a set of artificial embeddings through the model training process. Utilizing the generated embeddings as auxiliary speakers, no extra data are required for the graph model in the verification

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyli2021improving

Related papers

• Graph Attention Networks For Speaker Verification (2020)9.23
• Rethinking Session Variability: Leveraging Session Embeddings For Session Robustness In Speaker Verification (2023)5.24
• Graph-based Label Propagation For Semi-supervised Speaker Identification (2021)8.09
• Adapting End-to-end Neural Speaker Verification To New Languages And Recording Conditions With Adversarial Training (2018)9.59
• Spatial-temporal Graph Based Multi-channel Speaker Verification With Ad-hoc Microphone Arrays (2023)0.00
• Data Augmentation Enhanced Speaker Enrollment For Text-dependent Speaker Verification (2020)0.00
• Unified Hypersphere Embedding For Speaker Recognition (2018)0.00
• Triplet Based Embedding Distance And Similarity Learning For Text-independent Speaker Verification (2019)5.24