Journal on Communications ›› 2023, Vol. 44 ›› Issue (8): 89-98.doi: 10.11959/j.issn.1000-436x.2023142

• Papers • Previous Articles    

Speaker verification method based on cross-domain attentive feature fusion

Zhen YANG1,2, Tianlang WANG1, Haiyan GUO1, Tingting WANG1   

  1. 1 College of Communication &Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
    2 National Local Joint Engineering Research Center for Communications and Network Technology, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
  • Revised:2023-07-27 Online:2023-08-01 Published:2023-08-01
  • Supported by:
    The National Natural Science Foundation of China(62071242)

Abstract:

Aiming at the problem that the lack of structure information among speech signal sample in the front-end acoustic features of speaker verification system, a speaker verification method based on cross-domain attentive feature fusion was proposed.Firstly, a feature extraction method based on the graph signal processing (GSP) was proposed to extract the structural information of speech signals, each sample point in a speech signal frame was regarded as a graph node to construct the speech graph signal and the graph frequency information of the speech signal was extracted through the graph Fourier transform and filter banks.Then, an attentive feature fusion network with the residual neural network and the squeeze-and- excitation block was proposed to fuse the features in the traditional time-frequency domain and those in the graph frequency domain to promote the speaker verification system performance.Finally, the experiment was carried out on the VoxCeleb, SITW, and CN-Celeb datasets.The experimental results show that the proposed method performs better than the baseline ECAPA-TDNN model in terms of equal error rate (EER) and minimum detection cost function (min-DCF).

Key words: speaker verification, graph signal processing, attentive feature fusion

CLC Number: 

No Suggested Reading articles found!