Combining methods to improve speaker verification decision

This paper describes how the combination of speaker verification algorithms with a priori decision thresholds can improve the overall robustness of a real application. The evaluation is performed in the context of a field application where each client is verified from a seven-digit personal identification number (PIN code). This paper demonstrates that it is possible to increase the global performance of the system by combining the results of several algorithms.

[1]  Belur V. Dasarathy,et al.  Decision fusion , 1994 .

[2]  Aaron E. Rosenberg,et al.  Connected word talker verification using whole word hidden Markov models , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[3]  Ivan Magrin-Chagnolleau,et al.  Second-order statistical measures for text-independent speaker identification , 1995, Speech Commun..

[4]  Patrick Haffner,et al.  A new probabilistic framework for connectionist time alignment , 1994, ICSLP.

[5]  Sadaoki Furui,et al.  An Overview of Speaker Recognition Technology , 1996 .

[6]  Richard T. Antony,et al.  Principles of Data Fusion Automation , 1995 .

[7]  S. Chiba,et al.  Dynamic programming algorithm optimization for spoken word recognition , 1978 .

[8]  John Oglesby.  What's in a number? Moving beyond the equal error rate , 1995, Speech Commun..

[9]  Gérard Chollet,et al.  Secured vocal access to telephone servers , 1996, Proceedings of IVTTA '96. Workshop on Interactive Voice Technology for Telecommunications Applications.