Return
Distributed Multiple Resolvable Group Targets Tracking Based on Hypergraph Matching
DOI:10.1109/JSEN.2023.3260866.png)
Abstract
En 中文
This article proposes a solution of distributed multiple resolvable group targets tracking (DMRGTT) by exploring the labeled multi-Bernoulli (LMB) filter and distributed fusion rules including generalized covariance intersection (GCI) and weighted arithmetic average (WAA). Due to the proximity of targets' positions within the same group and the label mismatching problem for the fusion between LMB densities, only utilizing the similarity or distance between targets from different sensors cannot return a satisfactory solution of label matching (LM) results. To cope with this problem, the hypergraph matching (HM) theory is adopted to assist in finding the matched labels. Specifically, the hyperedge-to-hyperedge (H2H) matching matrix is first constructed and a vertex-to-vertex (V2V) matrix is returned. Then, the V2V matrix is further combined with the traditional distance matrix to construct a joint cost matrix. Next, substitute the joint cost matrix into the Hungarian algorithm and the LM results are obtained. Lastly, pairwise GCI-LMB and WAA-LMB fusion processes are performed based on the obtained LM results. Experiment results reveal the effectiveness and robustness of the proposed fusion approaches.
Keywords:
Target tracking
Sensors
Matrices
Radio frequency
Arithmetic
Weight measurement
Loss measurement
Generalized covariance intersection (GCI)
hypergraph matching (HM)
labeled multi-Bernoulli (LMB)
resolvable group targets (RGTs)
weighted arithmetic average (WAA)
Journal
IF:
4.5
Papers:
2.2W
Citations:
7.3W
Organization
Cited Papers
Effects of the model PAH phenanthrene on immune function and oxidative stress in the haemolymph of the temperate scallop Pecten maximus
Chemosphere
IF0
Structure modeling and estimation of multiple resolvable group targets via graph theory and multi-Bernoulli filter
AUTOMATICA
IF5.9

