Intrinsic Variation Robust Speaker Verification based on Sparse Representation

Intrinsic variation is one of the major factors that aggravate performance of speaker verification system dramatically. In this paper, we focus on alleviating influence caused by intrinsic variation using sparse representation. Because the over-complete dictionary increases the flexibility and the ability to adapt to variable data in signal representation, we expect redundancy of the dictionary could benefit addressing the implicit properties of intrinsic variation within each speaker. Both exemplar dictionary and learned dictionary are evaluated on an intrinsic variation corpus and compared with GMM-UBM, Joint Factor Analysis (JFA) and i-vector systems. In our system, we choose the K-SVD algorithm, generalization of K-means algorithm to learn dictionary with Singular Value Decomposition (SVD). The experiment results show that the two sparse representation systems achieve higher accuracy than GMM-UBM, JFA and i-vector systems consistently, especially outperform GMM-UBM respectively by 37.17% and 41.55%. We also find that the K-SVD based sparse representation system has almost the best performance, which achieve an average Error Equal Rate (EER) of 14.23%.