Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In this report, we build up on our previous work on speaker clustering, where the number of speakers and segmentation boundaries are unknown a priori. We employ an ergodic HMM with minimum duration topology for this purpose. Starting from a large number of clusters in the beginning, we merge a pair of clusters in every iteration. A new criterion for the merging of two clusters is proposed, which ensures an increase in likelihood of the data. The merging is done in such a way that, the total number of parameters needed to model all the clusters remain same. Thus, the system finally achieves maximum likelihood (which was not the case in our last work) with the constant number of parameters. The merging process is repeated until there are no candidates available for merging. The efficiency and advantages of using only highly voiced frames was reported in our previous work, and we use the same features for this work. The system was evaluated on Hub-4 1996 evaluation set. Improvements over the previous work are reported and it is shown that, the system converges to right number of clusters in case of limited number of speakers.