KIT | KIT-Bibliothek | Impressum | Datenschutz

Progressive Gaussian Mixture Reduction

Huber, Marco F. 1; Hanebeck, Uwe D. 1
1 Universität Karlsruhe (TH)

Abstract:
For estimation and fusion tasks it is inevitable to approximate a Gaussian mixture by one with fewer components to keep the complexity bounded. Appropriate approximations can be typically generated by exploiting the redundancy in the shape description of the original mixture. In contrast to the common approach of successively merging pairs of components to maintain a desired complexity, the novel Gaussian mixture reduction algorithm introduced in this paper avoids to directly reduce the original Gaussian mixture. Instead, an approximate mixture is generated from scratch by employing homotopy continuation. This allows starting the approximation with a single Gaussian, which is constantly adapted to the progressively incorporated true Gaussian mixture. Whenever a user-defined bound on the deviation of the approximation cannot be maintained during the continuation, further components are added to the approximation. This facilitates significantly reducing the number of components even for complex Gaussian mixtures.


Volltext §
DOI: 10.5445/IR/1000034859
Scopus
Zitationen: 46
Cover der Publikation
Zugehörige Institution(en) am KIT Fakultät für Informatik – Institut für Anthropomatik (IFA)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2008
Sprache Englisch
Identifikator ISBN: 978-3-8007-3092-6
urn:nbn:de:swb:90-348593
KITopen-ID: 1000034859
Erschienen in Proceedings of the 11th International Conference on Information Fusion (Fusion 2008), Cologne, Germany, June 30 2008-July 3 2008
Verlag Institute of Electrical and Electronics Engineers (IEEE)
Seiten 1-8
Nachgewiesen in Scopus
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page