A Poisson multi-Bernoulli mixture filter for coexisting point and extended targets

• URL: http://arxiv.org/abs/2011.04464v2
• Date: Tue, 18 May 2021 06:28:22 GMT
• Title: A Poisson multi-Bernoulli mixture filter for coexisting point and extended targets
• Authors: \'Angel F. Garc\'ia-Fern\'andez, Jason L. Williams, Lennart Svensson, Yuxuan Xia
• Abstract summary: 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.
• Score: 5.949779668853555
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper proposes a Poisson multi-Bernoulli mixture (PMBM) filter for coexisting point and extended targets, i.e., for scenarios where there may be simultaneous point and extended targets. The PMBM filter provides a recursion to compute the multi-target filtering posterior based on probabilistic information on data associations, and single-target predictions and updates. In this paper, we first derive the PMBM filter update for a generalised measurement model, which can include measurements originated from point and extended targets. Second, we propose a single-target space that accommodates both point and extended targets and derive the filtering recursion that propagates Gaussian densities for point targets and gamma Gaussian inverse Wishart densities for 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. The resulting filters are analysed via numerical simulations.

Related papers

• 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)
• AcroFOD: An Adaptive Method for Cross-domain Few-shot Object Detection [59.10314662986463]
  Cross-domain few-shot object detection aims to adapt object detectors in the target domain with a few annotated target data. The proposed method achieves state-of-the-art performance on multiple benchmarks.
  arXiv  Detail & Related papers  (2022-09-22T10:23:40Z)
• SIXO: Smoothing Inference with Twisted Objectives [8.049531918823758]
  We introduce SIXO, a method that learns targets that approximate the smoothing distributions. We then use SMC with these learned targets to define a variational objective for model and proposal learning.
  arXiv  Detail & Related papers  (2022-06-13T07:46:35Z)
• Multiple target tracking with interaction using an MCMC MRF Particle Filter [0.0]
  This paper presents and discusses an implementation of a multiple target tracking method. The referenced approach uses a Markov Chain Monte Carlo (MCMC) sampling step to evaluate the filter and constructs an efficient proposal density to generate new samples. It is shown that the implemented approach of modeling target interactions using MRF successfully corrects many of the tracking errors made by the independent, interaction unaware, particle filters.
  arXiv  Detail & Related papers  (2021-11-25T17:32:50Z)
• Variational Marginal Particle Filters [38.94802937100392]
  Variational inference for state space models (SSMs) is known to be hard in general. Recent works focus on deriving variational objectives for SSMs from unbiased sequential Monte Carlo estimators. We propose the variational marginal particle filter (VMPF)
  arXiv  Detail & Related papers  (2021-09-30T13:55:16Z)
• Extended Object Tracking Using Sets Of Trajectories with a PHD Filter [6.0813324895213885]
  PHD filtering is a common and effective multiple object tracking algorithm used in scenarios where the number of objects and their states are unknown. This paper presents a Gamma Gaussian inverse Wishart mixture PHD filter that can directly estimate sets of trajectories of extended targets.
  arXiv  Detail & Related papers  (2021-09-02T15:32:12Z)
• Training Compact CNNs for Image Classification using Dynamic-coded Filter Fusion [139.71852076031962]
  We present a novel filter pruning method, dubbed dynamic-coded filter fusion (DCFF) We derive compact CNNs in a computation-economical and regularization-free manner for efficient image classification. Our DCFF derives a compact VGGNet-16 with only 72.77M FLOPs and 1.06M parameters while reaching top-1 accuracy of 93.47%.
  arXiv  Detail & Related papers  (2021-07-14T18:07:38Z)
• Unsharp Mask Guided Filtering [53.14430987860308]
  The goal of this paper is guided image filtering, which emphasizes the importance of structure transfer during filtering. We propose a new and simplified formulation of the guided filter inspired by unsharp masking. Our formulation enjoys a filtering prior to a low-pass filter and enables explicit structure transfer by estimating a single coefficient.
  arXiv  Detail & Related papers  (2021-06-02T19:15:34Z)
• Online Multi-Object Tracking and Segmentation with GMPHD Filter and Mask-based Affinity Fusion [79.87371506464454]
  We propose a fully online multi-object tracking and segmentation (MOTS) method that uses instance segmentation results as an input. The proposed method is based on the Gaussian mixture probability hypothesis density (GMPHD) filter, a hierarchical data association (HDA), and a mask-based affinity fusion (MAF) model. In the experiments on the two popular MOTS datasets, the key modules show some improvements.
  arXiv  Detail & Related papers  (2020-08-31T21:06:22Z)
• Dependency Aware Filter Pruning [74.69495455411987]
  Pruning a proportion of unimportant filters is an efficient way to mitigate the inference cost. Previous work prunes filters according to their weight norms or the corresponding batch-norm scaling factors. We propose a novel mechanism to dynamically control the sparsity-inducing regularization so as to achieve the desired sparsity.
  arXiv  Detail & Related papers  (2020-05-06T07:41:22Z)
• Trajectory Poisson multi-Bernoulli filters [5.545791216381868]
  This paper presents two trajectory Poisson multi-Bernoulli (TPMB) filters for multi-target tracking. One to estimate the set of alive trajectories at each time step and another to estimate the set of all trajectories, which includes alive and dead trajectories, at each time step.
  arXiv  Detail & Related papers  (2020-03-28T11:04:45Z)

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.