Density estimation using mixtures of mixtures of Gaussians

10Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

Abstract

In this paper we present a new density estimation algorithm using mixtures of mixtures of Gaussians. The new algorithm overcomes the limitations of the popular Expectation Maximization algorithm. The paper first introduces a new model selection criterion called the Penalty-less Information Criterion, which is based on the Jensen-Shannon divergence. Mean-shift is used to automatically initialize the means and covariances of the Expectation Maximization in order to obtain better structure inference. Finally, a locally linear search is performed using the Penalty-less Information Criterion in order to infer the underlying density of the data. The validity of the algorithm is verified using real color images. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Abd-Almageed, W., & Davis, L. S. (2006). Density estimation using mixtures of mixtures of Gaussians. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3954 LNCS, pp. 410–422). Springer Verlag. https://doi.org/10.1007/11744085_32

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