Please use this identifier to cite or link to this item:
|Title:||Using discrete probabilities with bhattacharyya measure for SVM-Based speaker verification|
support vector machine (SVM)
|Citation:||Lee, K.A., You, C.H., Li, H., Kinnunen, T., Sim, K.C. (2011). Using discrete probabilities with bhattacharyya measure for SVM-Based speaker verification. IEEE Transactions on Audio, Speech and Language Processing 19 (4) : 861-870. ScholarBank@NUS Repository. https://doi.org/10.1109/TASL.2010.2064308|
|Abstract:||Support vector machines (SVMs), and kernel classifiers in general, rely on the kernel functions to measure the pairwise similarity between inputs. This paper advocates the use of discrete representation of speech signals in terms of the probabilities of discrete events as feature for speaker verification and proposes the use of Bhattacharyya coefficient as the similarity measure for this type of inputs to SVM. We analyze the effectiveness of the Bhattacharyya measure from the perspective of feature normalization and distribution warping in the SVM feature space. Experiments conducted on the NIST 2006 speaker verification task indicate that the Bhattacharyya measure outperforms the Fisher kernel, term frequency log-likelihood ratio (TFLLR) scaling, and rank normalization reported earlier in literature. Moreover, the Bhattacharyya measure is computed using a data-independent square-root operation instead of data-driven normalization, which simplifies the implementation. The effectiveness of the Bhattacharyya measure becomes more apparent when channel compensation is applied at the model and score levels. The performance of the proposed method is close to that of the popular GMM supervector with a small margin. © 2010 IEEE.|
|Source Title:||IEEE Transactions on Audio, Speech and Language Processing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 17, 2019
WEB OF SCIENCETM
checked on Jan 9, 2019
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.