Supervector Compression Strategies To Speed Up I-vector System Development

Abstract

The front-end factor analysis (FEFA), an extension of principal component analysis (PPCA) tailored to be used with Gaussian mixture models (GMMs), is currently the prevalent approach to extract compact utterance-level features (i-vectors) for automatic speaker verification (ASV) systems. Little research has been conducted comparing FEFA to the conventional PPCA applied to maximum a posteriori (MAP) adapted GMM supervectors. We study several alternative methods, including PPCA, factor analysis (FA), and two supervised approaches, supervised PPCA (SPPCA) and the recently proposed probabilistic partial least squares (PPLS), to compress MAP-adapted GMM supervectors. The resulting i-vectors are used in ASV tasks with a probabilistic linear discriminant analysis (PLDA) back-end. We experiment on two different datasets, on the telephone condition of NIST SRE 2010 and on the recent VoxCeleb corpus collected from YouTube videos containing celebrity interviews recorded in various acoustical and

Stats

• citations4
• S2 citations—
• github stars0
• HF likes0
• heat score5.24
• arxiv keyvestman2018supervector

Related papers

• Investigation Of Using VAE For I-vector Speaker Verification (2017)0.00
• Factorization Of Discriminatively Trained I-vector Extractor For Speaker Recognition (2019)0.00
• I-vector Transformation Using Conditional Generative Adversarial Networks For Short Utterance Speaker Verification (2018)8.35
• Unleashing The Unused Potential Of I-vectors Enabled By GPU Acceleration (2019)2.26
• Quality Measures For Speaker Verification With Short Utterances (2019)0.00
• Fast Variational Bayes For Heavy-tailed PLDA Applied To I-vectors And X-vectors (2018)8.35
• Discriminatively Re-trained I-vector Extractor For Speaker Recognition (2018)5.84
• Sub-vector Extraction And Cascade Post-processing For Speaker Verification Using MLLR Super-vectors (2016)0.00