Text dependent speaker verification using binary classifiers

This paper describes how a speaker verification task can be advantageously decomposed into a series of binary classification problems, i.e. each problem discriminating between two classes only. Each binary classifier is specific to one speaker, one anti-speaker and one word. Decision trees dealing classifiers. The set of classifiers is then pruned to eliminate the less relevant ones. Diverse pruning methods are experimented, and it is shown that when the speaker verification decision is performed with an a priori threshold, some of them give better results than a reference HMM system.


Published in:
Proceedings of the 1998 IEEE International Conference on Acoustics, Speech, and Signal Processing --- ICASSP'98, I, 129-132
Presented at:
IEEE - Proceedings of the 1998 IEEE International Conference on Acoustics, Speech, and Signal Processing --- ICASSP'98
Year:
1998
Publisher:
IEEE
Keywords:
Note:
IDIAP-RR 97-08
Laboratories:




 Record created 2006-03-10, last modified 2018-03-17

n/a:
Download fulltextPDF
External links:
Download fulltextURL
Download fulltextRelated documents
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)