Skip to Main Content
A mathematical formulation of an automatic speaker verification scheme as a two class pattern recognition problem is presented. Expressions for the expected values and the variance of the design-set and the test set error rates are derived. The bound on the performance of an automatic speaker identification system as a cascade of independent verification systems is derived. The implications of these results in the design of an automatic speaker recognition system are discussed.