Key points are not available for this paper at this time.
This paper presents an efficient approach to calculate the difference between two probability density functions (pdfs), each of which is a mixture of Gaussians (MoG). Unlike Kullback-Leibler divergence (D KL ), the authors propose that the Cauchy-Schwarz (CS) pdf divergence measure (D CS ) can give an analytic, closed-form expression for MoG. This property of the D CS makes fast and efficient calculations possible, which is tremendously desired in real-world applications where the dimensionality of the data/features is very high. We show that D CS follows similar trends to D KL , but can be computed much faster, especially when the dimensionality is high. Moreover, the proposed method is shown to significantly outperform D KL in classifying real-world 2D and 3D objects, and static hand posture recognition based on distances alone.
Kampa et al. (Fri,) studied this question.