Speaker identification through spectral entropy analysis

Identifying a speaker in a noisy environment is still a challenging problem. In spite of the impressive efficacy of deep architectures, the solution obtained is an obscure mapping, a black box. For transparent classifiers, the standard feature are the Mel-Frequency Cepstral Coefficients (MFCC). In this paper we build entropy vectors out of the first sixteen critical bands according to Bark's scale as features. The classifier consists in finding the closest vector sequences of the query in the database, counting the hits as in a k-nn classifier. In one case we use the MFCC (the state of the art) and in the other case we use the described entropy vectors. For the text-independent, we used gaped vector sequences which are discussed below in the paper. For text-dependent speaker identification we obtained 80% true positives @10% false positives, while the MFCC have about 60% true positives at the same false positive rate. This is also about the same for the text-independent case. In general we obtained more area under the respective ROC curves.