Fixed-point iterations for several dissimilarity measure barycenters in the Gaussian case
Not on the map. Why?
Abstract (arXiv)
In target tracking and sensor fusion contexts it is not unusual to deal with a large number of Gaussian densities that encode the available information (multiple hypotheses), as in applications where many sensors, affected by clutter or multimodal noise, take measurements on the same scene. In such cases reduction procedures must be implemented, with the purpose of limiting the computational load. In some situations it is required to fuse all available information into a single hypothesis, and this is usually done by computing the barycenter of the set. However, such computation strongly depends on the chosen dissimilarity measure, and most often it must be performed making use of numerical methods, since in very few cases the barycenter can be computed analytically. Some issues, like the constraint on the covariance, that must be symmetric and positive definite, make it hard the numerical computation of the barycenter of a set of Gaussians. In this work, Fixed-Point Iterations (FPI) are presented for the computation of barycenters according to several dissimilarity measures, making up a useful toolbox for fusion/reduction of Gaussian sets in applications where specific dissimilarity measures are required.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 15 references that are in the map. First posted on arXiv 10 May 2022.
Builds on
3 of 15 references.
References · 3
- 2017Optimal transport for Gaussian mixture modelscited by 45
- 2018Stochastic Wasserstein Barycenterscited by 25
- 2021Consistency issues in Gaussian Mixture Models reduction algorithmscited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.