.png){kind=icon}
.png){kind=icon}
Return
An efficient approximate implementation for labeled random finite set filtering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2018.04.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose an approximate implementation for labeled random finite set filtering with low computational cost. In contrast to the earlier implementations of the generalized labeled multi-Bernoulli (GLMB) filter and the labeled multi-Bernoulli (LMB) filter, the proposed approach adopts a sampler based on marginaling the joint association probability that can generate the components of the GLMB density from marginal probabilities with high parallel level. Additionally, this marginal probability approximation results in an efficient implementation of the LMB filter, which calculates the parameter set of the filtering LMB density from the marginal probabilities. Furthermore, we exploit a simplified belief propagation algorithm to obtain approximate marginal probabilities with linear complexity in the number of measurements and objects. Simulations show that the proposed implementation can handle both linear and non-linear scenarios and is more efficient against the existing implementations. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Labeled random finite sets
GLMB filter
LMB filter
Multi-object tracking
Belief propagation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.