Levels of Details for Gaussian Mixture Models
Lists
Only you see this
Abstract
Mixtures of Gaussians are a crucial statistical modeling tool at the heart of many challenging applications in computer vision and machine learning. In this paper, we first describe a novel and efficient algorithm for simplifying Gaussian mixture models using a generalization of the celebrated k-means quantization algorithm tailored to relative entropy. Our method is shown to compare experimentally favourably well with the state-of-the-art both in terms of time and quality performances. Second, we propose a practical enhanced approach providing a hierarchical representation of the simplified GMM while automatically computing the optimal number of Gaussians in the simplified mixture. Application to clustering-based image segmentation is reported.
BibTeX
@inproceedings{garcia2009levels,
author = {Vincent Garcia and Frank Nielsen and Richard Nock},
title = {{Levels of Details for Gaussian Mixture Models}},
booktitle = {ACCV},
year = {2009},
doi = {10.1007/978-3-642-12304-7\_48},
}Loading related content...