Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/43462
Title: Sparse kernel machines with empirical kernel maps for PLDA speaker verification
Authors: Rao, W
Mak, MW 
Keywords: Empirical kernel maps
I-vectors
NIST SRE
Probabilistic linear discriminant analysis
Relevance vector machines
Issue Date: 2016
Publisher: Academic Press
Source: Computer speech and language, 2016, v. 38, p. 104-121 How to cite?
Journal: Computer speech and language 
Abstract: Previous studies have demonstrated the benefits of PLDA-SVM scoring with empirical kernel maps for i-vector/PLDA speaker verification. The method not only performs significantly better than the conventional PLDA scoring and utilizes the multiple enrollment utterances of target speakers effectively, but also opens up opportunity for adopting sparse kernel machines in PLDA-based speaker verification systems. This paper proposes taking the advantages of empirical kernel maps by incorporating them into a more advanced kernel machine called relevance vector machines (RVMs). The paper reports extensive analyses on the behaviors of RVMs and provides insight into the properties of RVMs and their applications in i-vector/PLDA speaker verification. Results on NIST 2012 SRE demonstrate that PLDA-RVM outperforms the conventional PLDA and that it achieves a comparable performance as PLDA-SVM. Results also show that PLDA-RVM is much sparser than PLDA-SVM.
URI: http://hdl.handle.net/10397/43462
ISSN: 0885-2308
DOI: 10.1016/j.csl.2016.01.001
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

25
Last Week
0
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.