New EM derived from Kullback-Leibler divergence

Authors:
Longin Jan Latecki;Marc Sobel;Rolf Lakaemper
Affiliations:
Temple University, Philadelphia, PA;Temple University, Philadelphia, PA;Temple University, Philadelphia, PA
Venue:
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Year:
2006

Citing 3
Cited 4

Techniques for Assessing Polygonal Approximations of Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
A view of the EM algorithm that justifies incremental, sparse, and other variants

Learning in graphical models
SMEM Algorithm for Mixture Models

Neural Computation

Detection and recognition of contour parts based on shape similarity

Pattern Recognition
Contour Grouping Based on Contour-Skeleton Duality

International Journal of Computer Vision
Using virtual scans for improved mapping and evaluation

Autonomous Robots
On clonal selection

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we use nonparametric density estimation to improve parametric density estimation in the EM framework. While the classical EM algorithm estimates model parameters empirically using the data points themselves, we estimate them using nonparametric density estimates.There exist many possible applications that require optimal adjustment of model components. We present experimental results in two domains. One is polygonal approximation of laser range data, which is an active research topic in robot navigation. The other is grouping of edge pixels to contour boundaries, which still belongs to unsolved problems in computer vision.