Lee, H.-S.H.-S.LeeTso, Y.Y.TsoChang, Y.-F.Y.-F.ChangWang, H.-M.H.-M.WangSHYH-KANG JENG2020-06-112020-06-11201415206149https://scholars.lib.ntu.edu.tw/handle/123456789/499914https://www.scopus.com/inward/record.uri?eid=2-s2.0-84905238194&doi=10.1109%2fICASSP.2014.6853880&partnerID=40&md5=9597cbd9e4751716d9a340af97c87a68In this paper, we study the use of two kinds of kernel-based discriminative models, namely support vector machine (SVM) and deep neural network (DNN), for speaker verification. We treat the verification task as a binary classification problem, in which a pair of two utterances, each represented by an i-vector, is assumed to belong to either the 'within-speaker' group or the 'between-speaker' group. To solve the problem, we employ various binary operations to retain the basic relationship between any pair of i-vectors to form a single vector for training the discriminative models. This study also investigates the correlation of achievable performances with the number of training pairs and the various combinations of basic binary operations, using the SVM and DNN binary classifiers. The experiments are conducted on the male portion of the core task in the NIST 2005 Speaker Recognition Evaluation (SRE), and the results are competitive or even better, in terms of normalized decision cost function (minDCF) and equal error rate (EER), while compared to other non-probabilistic based models, such as the conventional speaker SVMs and the LDA-based cosine distance scoring. © 2014 IEEE.DNN; i-vector; speaker verification; SVM[SDGs]SDG10Classification (of information); Signal processing; Support vector machines; Vectors; Achievable performance; Binary classification problems; Cosine distance scoring; DNN; I vectors; Speaker recognition evaluations; Speaker verification; SVM; Speech recognitionconference paper10.1109/ICASSP.2014.68538802-s2.0-84905238194