Kernel-Based Ensemble Gaussian Mixture Probability Hypothesis Density Filter

• URL: http://arxiv.org/abs/2505.00131v1
• Date: Wed, 30 Apr 2025 19:00:02 GMT
• Title: Kernel-Based Ensemble Gaussian Mixture Probability Hypothesis Density Filter
• Authors: Dalton Durant, Renato Zanetti,
• Abstract summary: The EnGM-PHD filter combines the Gaussian-mixture-based techniques of the GM-PHD filter with the particle-based techniques of the SMC-PHD filter.<n>The results indicate that the EnGM-PHD filter achieves better multi-target filtering performance than both the GM-PHD and SMC-PHD filters.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, a kernel-based Ensemble Gaussian Mixture Probability Hypothesis Density (EnGM-PHD) filter is presented for multi-target filtering applications. The EnGM-PHD filter combines the Gaussian-mixture-based techniques of the Gaussian Mixture Probability Hypothesis Density (GM-PHD) filter with the particle-based techniques of the Sequential Monte Carlo Probability Hypothesis Density (SMC-PHD) filter. It achieves this by obtaining particles from the posterior intensity function, propagating them through the system dynamics, and then using Kernel Density Estimation (KDE) techniques to approximate the Gaussian mixture of the prior intensity function. This approach guarantees convergence to the true intensity function in the limit of the number of components. Moreover, in the special case of a single target with no births, deaths, clutter, and perfect detection probability, the EnGM-PHD filter reduces to the standard Ensemble Gaussian Mixture Filter (EnGMF). In the presented experiment, the results indicate that the EnGM-PHD filter achieves better multi-target filtering performance than both the GM-PHD and SMC-PHD filters while using the same number of components or particles.

Related papers

• CryoGS: Gaussian Splatting for Cryo-EM Homogeneous Reconstruction [55.2480439325792]
  cryogenic electron microscopy (cryo-EM) facilitates the determination of macromolecular structures at near-atomic resolution.<n>The core computational task in single-particle cryo-EM is to reconstruct the 3D electrostatic potential of a molecule.<n>We introduce cryoGS, a GMM-based method that integrates Gaussian splatting with the physics of cryo-EM image formation.
  arXiv  Detail & Related papers  (2025-08-06T23:24:43Z)
• Distributed Poisson multi-Bernoulli filtering via generalised covariance intersection [4.416774178832304]
  This paper presents the distributed Poisson multi-Bernoulli (PMB) filter for distributed multi-object filtering.<n>We approximate the power of a PMB density as an unnormalised PMB density, which corresponds to an upper bound of the PMB density.<n>We show that the result is a Poisson multi-Bernoulli mixture (PMBM), which can be expressed in closed form.
  arXiv  Detail & Related papers  (2025-06-23T08:32:16Z)
• Adversarial Transform Particle Filters [11.330617592263744]
  The particle filter (PF) and the ensemble Kalman filter (EnKF) are widely used for approximate inference in state-space models.<n>We propose the Adversarial Transform Particle Filter (ATPF), a novel filtering framework that combines the strengths of the PF and the EnKF through adversarial learning.
  arXiv  Detail & Related papers  (2025-02-10T05:31:35Z)
• The Ensemble Epanechnikov Mixture Filter [0.0]
  We make use of the optimal Epanechnikov mixture kernel density estimate for the sequential filtering scenario through what we term the ensemble Epanechnikov mixture filter (EnEMF) We show on a static example that the EnEMF is robust to growth in dimension, and also that the EnEMF has a significant reduction in error per particle on the 40-variable Lorenz '96 system.
  arXiv  Detail & Related papers  (2024-08-20T19:50:59Z)
• Adaptive Fuzzy C-Means with Graph Embedding [84.47075244116782]
  Fuzzy clustering algorithms can be roughly categorized into two main groups: Fuzzy C-Means (FCM) based methods and mixture model based methods. We propose a novel FCM based clustering model that is capable of automatically learning an appropriate membership degree hyper- parameter value.
  arXiv  Detail & Related papers  (2024-05-22T08:15:50Z)
• Normalizing Flow-based Differentiable Particle Filters [16.164656853940464]
  We present a differentiable particle filtering framework that usesconditional normalizing flows to build its dynamic model, proposal distribution, and measurement model.<n>We derive the theoretical properties of the proposed filters and evaluate the proposed normalizing flow-based differentiable particle filters' performance through a series of numerical experiments.
  arXiv  Detail & Related papers  (2024-03-03T12:23:17Z)
• Closed-form Filtering for Non-linear Systems [83.91296397912218]
  We propose a new class of filters based on Gaussian PSD Models, which offer several advantages in terms of density approximation and computational efficiency. We show that filtering can be efficiently performed in closed form when transitions and observations are Gaussian PSD Models. Our proposed estimator enjoys strong theoretical guarantees, with estimation error that depends on the quality of the approximation and is adaptive to the regularity of the transition probabilities.
  arXiv  Detail & Related papers  (2024-02-15T08:51:49Z)
• Sampling with Mollified Interaction Energy Descent [57.00583139477843]
  We present a new optimization-based method for sampling called mollified interaction energy descent (MIED) MIED minimizes a new class of energies on probability measures called mollified interaction energies (MIEs) We show experimentally that for unconstrained sampling problems our algorithm performs on par with existing particle-based algorithms like SVGD.
  arXiv  Detail & Related papers  (2022-10-24T16:54:18Z)
• Computational Doob's h-transforms for Online Filtering of Discretely Observed Diffusions [65.74069050283998]
  We propose a computational framework to approximate Doob's $h$-transforms. The proposed approach can be orders of magnitude more efficient than state-of-the-art particle filters.
  arXiv  Detail & Related papers  (2022-06-07T15:03:05Z)
• Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
  We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior. Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm. Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
  arXiv  Detail & Related papers  (2020-11-18T16:40:45Z)
• A Poisson multi-Bernoulli mixture filter for coexisting point and extended targets [5.949779668853555]
  This paper proposes a Poisson multi-Bernoulli mixture (PMBM) filter for coexisting point and extended targets. As a computationally efficient approximation of the PMBM filter, we also develop a Poisson multi-Bernoulli (PMB) filter for coexisting point and extended targets.
  arXiv  Detail & Related papers  (2020-11-09T14:41:40Z)
• Innovative And Additive Outlier Robust Kalman Filtering With A Robust Particle Filter [68.8204255655161]
  We propose CE-BASS, a particle mixture Kalman filter which is robust to both innovative and additive outliers, and able to fully capture multi-modality in the distribution of the hidden state. Furthermore, the particle sampling approach re-samples past states, which enables CE-BASS to handle innovative outliers which are not immediately visible in the observations, such as trend changes.
  arXiv  Detail & Related papers  (2020-07-07T07:11:09Z)
• Multiplicative Gaussian Particle Filter [18.615555573235987]
  We propose a new sampling-based approach for approximate inference in filtering problems. Instead of approximating conditional distributions with a finite set of states, as done in particle filters, our approach approximates the distribution with a weighted sum of functions from a set of continuous functions.
  arXiv  Detail & Related papers  (2020-02-29T09:19:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.