Loading [a11y]/accessibility-menu.js
Greedy Reduction Algorithms for Mixtures of Exponential Family | IEEE Journals & Magazine | IEEE Xplore

Greedy Reduction Algorithms for Mixtures of Exponential Family


Abstract:

In this letter, we propose a general framework for greedy reduction of mixture densities of exponential family. The performances of the generalized algorithms are illustr...Show More

Abstract:

In this letter, we propose a general framework for greedy reduction of mixture densities of exponential family. The performances of the generalized algorithms are illustrated both on an artificial example where randomly generated mixture densities are reduced and on a target tracking scenario where the reduction is carried out in the recursion of a Gaussian inverse Wishart probability hypothesis density (PHD) filter.
Published in: IEEE Signal Processing Letters ( Volume: 22, Issue: 6, June 2015)
Page(s): 676 - 680
Date of Publication: 04 November 2014

ISSN Information:

Funding Agency:


Contact IEEE to Subscribe

References

References is not available for this document.