Odyssey 2012 - The Speaker and Language Recognition Workshop

June 25-28, 2012

Mean Shift Algorithm for Exponential Families with Applications to Speaker Clustering

Themos Stafylakis (1,2), Vassilis Katsouros (3), Patrick Kenny (1,2), Pierre Dumouchel (1,2)

(1) École de Technologie Supérieure (ÉTS), Quebec, Canada
(2) Centre de Recherche Informatique de Montréal (CRIM), Quebec, Canada
(3) Institute for Language and Speech Processing (ILSP), Athens, Greece

This work extends the mean shift algorithm from the observation space to the manifolds of parametric models that are formed by exponential families. We show how the Kullback-Leibler divergence and its dual define the corresponding affine connection and propose a method for incorporating the uncertainty in estimating the parameters. Experiments are carried out for the problem of speaker clustering, using both single Gaussians and i-vectors.

Full Paper

Bibliographic reference.  Stafylakis, Themos / Katsouros, Vassilis / Kenny, Patrick / Dumouchel, Pierre (2012): "Mean shift algorithm for exponential families with applications to speaker clustering", In Odyssey-2012, 324-329.