A study on the relation between the frame pruning and the robust speaker identification with multivariate t-distribution

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we performed the robust speaker identification based on the frame pruning and multivariate t-distribution respectively, and then studied on a theoretical basis for the frame pruning using the other methods. Based on the results from two methods, we showed that the robust algorithms based on the weight of frames become the theoretical basis of the frame pruning method by considering the correspondence between the weight of frame pruning and the conditional expectation of t-distribution. Both methods showed good performance when coping with the outliers occurring in a given time period, while the frame pruning method removing less reliable frames is recommended as one of good methods and, also, the multivariate t-distributions are generally used instead of Gaussian mixture models (GMM) as a robust approach for the speaker identification. In experiments, we found that the robust speaker identification has higher performance than the typical GMM algorithm. Moreover, we showed that the trend of frame likelihood using the frame pruning is similar to one of robust algorithms. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Lee, Y., Lee, J., & Hahn, H. (2005). A study on the relation between the frame pruning and the robust speaker identification with multivariate t-distribution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3767 LNCS, pp. 799–808). Springer Verlag. https://doi.org/10.1007/11581772_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free