Speaker identification using fuzzy i-vector tree

The speaker diarization task pertains to the automated differentiation of speakers within an audio recording, while lacking any prior information regarding the speakers. The introduction of the self-attention mechanism in End-to-End Neural Speaker Diarization (EEND) has elegantly resolved the issue of overlapping speakers. The Transformer model equipped with self-attention mechanism has shown great potential in collecting global information, yielding remarkable outcomes in various tasks. However, the individual speaker characteristics are predominantly reflected in the contextual information, which conventional self-attention would not adequately address. In this study, we propose a hierarchical encoders model to augment the encoders’ acquisition of speaker information in two distinct ways: (1) Constraining the perceptual field of the self-attentive mechanism with left-right windows or Gaussian weights to highlight contextual information; (2) Utilizing a pre-trained time-delay neural network based speaker embedding extractor to alleviate the shortcomings of speaker feature extraction ability. We evaluate the proposed methods on a simulated dataset of two speakers and a real conversation dataset. The model with the most favorable outcomes among the proposed enhancements achieves a diarization error rate of 7.74% on the simulated dataset and 21.92% on MagicData-RAMC after adaptation. These results compellingly demonstrate the efficacy of the proposed methods.

show abstract

Influence of tree-based multi-layer node information on scoring accuracy and speed of speaker verification

Wenjun,

Jianmin

2023

IFS

View full text Add to dashboard Cite

In the speaker verification task based on Gaussian Mixture Model-Universal Background Model (GMM-UBM), by constructing the UBM as a tree structure, the kernel Gaussians suitable for different speakers can be quickly selected, which speeds up the modeling of speaker acoustic space by GMM. The tree-based kernel selection algorithm (TBKS) introduces a beam-width, which increases the candidate range of kernels and improves the kernel selection accuracy. In this paper, we improve the TBKS algorithm by introducing a recall rate to adjust the number of nodes recalled in each layer of the tree structure. This adjustment refines the quantity and resolution of Gaussian distributions in various subspaces within the acoustic space, compensating for the loss caused by discarding some significant Gaussians erroneously. Speaker verification experiments are carried out based on the Aishell2 dataset. The results reveal that the modified TBKS algorithm reduces EER by 7.5% relatively and increses computational reduction factor to 42.93, enhancing both recognition accuracy and speed. In addition, the test speech is spliced into different lengths and common environmental noise is added to verify the universality of the improved algorithm.

show abstract

Speaker identification using fuzzy i-vector tree

Cited by 3 publications

References 26 publications

Generating Game Indefinite Decision Tree in the Banking Sector Using Different Types of Algorithms

Generating Game Indefinite Decision Tree in the Banking Sector Using Different Types of Algorithms

Speaker diarization with variants of self-attention and joint speaker embedding extractor

Influence of tree-based multi-layer node information on scoring accuracy and speed of speaker verification

Contact Info

Product

Resources

About