Distributed Fusion with Multi-Bernoulli Filter based on Generalized Covariance Intersection

I. INTRODUCTION

• Unknown correlations make distributed multi-sensor multi-object tracking challenging, and computing common information for the optimal solution can be intractable in real-world applications.G-CI is presented as a suboptimal alternative that generalizes Covariance Intersection beyond Gaussian posteriors to non-Gaussian multi-object distributions.Source: §I · p. 1
• MB filters directly propagate multi-object distributions and can be more efficient and accurate for particle implementations or when individual target-existence probabilities are needed.They also avoid a separate clustering step for state estimation; unlabeled filters remain useful when target identities are not important or labels are uncertain.Source: §I · pp. 1–2
• The paper proposes GCI-MB, deriving a tractable closed form through two approximations and implementing fusion with SMC and KDE-based conversion of local particle sets to GMMs.The KDE step addresses the fact that sensor nodes need not have the same particle support or particle count.Source: §I · p. 2

C. Multi-Bernoulli Distribution

• An MB random set is the union of M independent Bernoulli random sets and is parameterized by each component’s existence probability and state density.The section gives the MB multi-object density in terms of these parameters.Source: C. Multi-Bernoulli Distribution · p. 2

D. δ-Generalized Labeled Multi Bernoulli Distribution

• The paper calls the unlabeled δ-GLMB distribution a generalized multi-Bernoulli (GMB) distribution.The δ-GLMB is defined for labeled random finite sets, with weights and component densities over state-label pairs.Source: D. δ-Generalized Labeled Multi… · p. 3

E. Distributed Data Fusion

• Because local posteriors can be correlated and computing their common information is not straightforward, G-CI fuses them as a geometric mean, also termed an exponential mixture.The two local posteriors are combined using relative weights whose sum is one.Source: E. Distributed Data Fusion · p. 3

III. DISTRIBUTED FUSION WITH MB FILTERS

• Two MB posteriors are fused through a GMB approximation, followed by an MB approximation matching the fused density’s first moment.The resulting MB density can be fed back to sensor nodes for another local filtering iteration.Source: §III · p. 3

A. G-CI Fusion

• For well-separated Bernoulli components, high-confidence HPD regions motivate approximating the powered sum by a sum of powers.The derivation introduces HPD regions and considers component separation at confidence λ close to one.Source: A. G-CI Fusion · p. 4
• An MB filter’s post-update merging step combines Bernoulli components with means that are too close, supporting the practical separation assumption.The authors use this as a reason to assume fused posteriors are well-separated at confidence λ very close to one.Source: A. G-CI Fusion · p. 4
• The approximation relies on one product term dominating the MB-density sum for a state in its corresponding HPD region.The paper’s numerical example illustrates this dominance for hypotheses of dimensions n = 1 and n = 2.Source: A. G-CI Fusion · p. 5, Figure 1 · p. 5
• Non-Gaussian multi-target tracking results verify the validity and rationality of approximation (19).The approximation is applied where the multi-target posterior is not necessarily Gaussian.Source: A. G-CI Fusion · pp. 5–6

B. The GMB Fused Distribution

• A fusion map represents a hypothesis that selected tracks from the two sensors correspond to the same targets, with one-to-one matching.For a subset of sensor 1’s track indices, the map assigns matching indices in sensor 2.Source: B. The GMB Fused Distribution · p. 6, Figure 2 · p. 6
• Fusion-map hypotheses enumerate alternative correspondences between track sets from the two sensors.For two sensors with two track indices each, the paper gives six fusion maps as an example.Source: B. The GMB Fused Distribution · p. 6, Figure 3 · p. 6
• The G-CI-fused density of two MB distributions is approximated by a GMB distribution, the unlabeled version of a GLMB distribution.The derivation rewrites the numerator using fusion maps and computes the normalizing denominator.Source: B. The GMB Fused Distribution · p. 6

C. MB Approximation

• The MB approximation is needed because sequential sensor fusion and feedback require the fused posterior to have the same form as local posteriors.The network may have more than two sensors, so fusion is applied sequentially.Source: C. MB Approximation · p. 7
• The proposed MB approximation matches exactly the first-order statistical moment of the fused GMB posterior.This gives the fused posterior an MB representation for subsequent use.Source: C. MB Approximation · p. 7
• Pairwise fusion can be applied Ns−1 times for Ns sensors, and the ordering of those fusions is irrelevant.The paper identifies similar sequential approaches for CPHD and LMB filters.Source: C. MB Approximation · p. 7
• The number of GMB hypotheses grows exponentially with target count, so ranked-assignment truncation or parallel filtering by target groups can reduce computation.The passage presents these as options for reducing computational burden.Source: C. MB Approximation · p. 7

D. Summary

• GCI-MB uses two approximations so that fusing two MB densities produces an MB-form posterior that can be fused again with another sensor.The resulting MB density also facilitates feedback to improve fusion performance.Source: D. Summary · p. 8
• Each sensor runs a local MB filter, exchanges posteriors with neighboring nodes, and sequentially fuses the received posteriors.The fused MB posterior is then fed back to local nodes to further improve fusion performance.Source: D. Summary · p. 8
• In the example network, node 4 exchanges posteriors with nodes 3, 4, 5, and 8, performs three sequential fusions, then feeds the result back to those nodes.The network-wide scheme is described as local filtering, information exchange, posterior fusion, and feedback.Source: D. Summary · p. 8

IV. IMPLEMENTATION OF GCI-MB FUSION ALGORITHM

• Direct fusion is obstructed because each sensor node’s particle filter can have a different particle support.The particle counts are not guaranteed to be the same either.Source: §IV · p. 8
• The conventional SMC implementation of the MB filter is used to compute fusion of local information.The implementation must compute the MB parameters given in equations (41) and (42).Source: §IV · p. 8
• The implementation uses KDE to create continuous approximations of local posteriors, then samples them to perform G-CI fusion with different particle supports.The paper refers readers to prior work for the SMC implementation of the MB filter itself.Source: §IV · p. 8

A. SMC Implementation of GCI-MB

• KDE represents each local posterior density as a sum of kernels shifted to particle points, allowing fusion across nodes with different particle sets.The paper uses this continuous approximation because local particle supports need not coincide.Source: A. SMC Implementation of GCI-MB · p. 8
• Transforming particles using the inverse square root of their empirical covariance diagonalizes the covariance and reduces kernel selection to independent one-dimensional problems.The kernel covariance is specified using the bandwidths for each state dimension.Source: A. SMC Implementation of GCI-MB · pp. 8–9
• The bandwidth uses a rule of thumb chosen for simplicity and low computational complexity relative to least-squares cross-validation.The bandwidth parameters are one-dimensional Gaussian-kernel parameters.Source: A. SMC Implementation of GCI-MB · p. 9
• The union of input particle sets supplies a convenient particle set for representing the importance-sampling density’s target distribution.The passage identifies mixture importance sampling as the proposal density.Source: A. SMC Implementation of GCI-MB · p. 9
• Importance weights are computed on the proposal particles and resampled to obtain equally weighted samples representing p(ℓ,θ).The implementation also uses the proposal density to estimate Z(ℓ,θ).Source: A. SMC Implementation of GCI-MB · p. 9, 2) Estimation of Z(ℓ,θ) ω · p. 9

• P_U is the union of the input particle sets in (51).Source: 2) Estimation of Z(ℓ,θ) ω · p. 9
• The passage refers to using quantities from (55) to achieve computational feasibility, but does not specify the full operation.Source: 2) Estimation of Z(ℓ,θ) ω · p. 9

B. Pseudo-code

• The algorithm constructs particle approximations for local posteriors, computes fusion-hypothesis weights, and outputs fused MB parameters and particles.For each hypothesis it forms an importance-sampling set from the union of supports, evaluates KDEs and weights, and resamples.Source: B. Pseudo-code · p. 9

V. PERFORMANCE ASSESSMENT

• The performance assessment uses OSPA to examine GCI-MB implemented with the SMC approach.Metropolis weights are selected for convenience; the paper notes this choice may affect fusion performance.Source: §V · p. 9
• The simulated targets follow a constant-velocity model, and the likelihood assumes non-overlapping target-illuminated regions and conditionally independent pixel observations.The observation model can use different signal and noise distributions for different applications.Source: §V · pp. 9–10
• The evaluation uses a two-dimensional image-observation model with a 50 × 50 grid of 1 m cells and 1 s between observations.The signal intensity is assumed to be the same deterministic value across sensors, while differing random sensor intensities are outside the paper's scope.Source: §V · p. 10

A. Scenario 1

• The scenario uses two parallel targets with 200 particles per hypothesized track in the SMC trials.Source: Figure 5 · p. 10, A. Scenario 1 · p. 10

1) Experiment 1:

• The efficient-estimation proportion is close to 1 at dE ≥4 m with SNR ≥6 dB, or at dE = 3 m with SNR ≥14 dB.Efficient estimates are defined by an OSPA error below a fixed threshold; the approximation is considered acceptable under these reported conditions.Source: 1) Experiment 1 · p. 11
• Under SMC implementation of MB filter, approximation error is generally acceptable when dE ≥3 m and very close to 0 for all investigated SNRs from 6 to 18 dB when dE ≥4 m.Larger SNR also makes approximation error small at dE = 3 m.Source: 1) Experiment 1 · p. 11
• The approximation is more sensitive to target separation than to SNR, and is acceptable when targets are separated or SNR is high despite proximity.Source: 1) Experiment 1 · p. 11
• Across dE ∈ {1, 2, 3, 4, 8, 12} m, GCI-MB fusion achieved lower average OSPA error than the local MB-TBD filter at each tested distance; SNR was fixed at 15 dB, and errors were averaged over 30 frames and 100 MC runs.Source: 2) Experiment 2 · p. 11

2) Experiment 2:

• In the two-target experiment, GCI-MB outperforms local MB-TBD at each tested separation, but both perform poorly at dE ≤2 m.The reported interpretation is that close targets violate the rigid-target assumption and degrade MB-TBD tracking and fusion.Source: 2) Experiment 2 · p. 12, Figure 8 · p. 12

B. Scenario 2

• Sensors 1 and 3 fuse their local posterior with sensor 2's posterior, while sensor 2 applies pairwise fusion twice with sensors 1 and 3.Source: B. Scenario 2 · p. 12, Figure 9 · p. 12
• The experiments compare local filtering and fusion in M1 with feedback fusion in M2, using MB-TBD local filters.Source: B. Scenario 2 · p. 12

1) Experiment 1:

• Local filters receiving GCI-MB feedback in M2 perform significantly better than in M1, and average OSPA errors improve with more sensors.The reported sensor-count comparison covers one, two, and three sensors in both modes.Source: Figure 10 · p. 12, 1) Experiment 1 · p. 13, Figure 11 · p. 13

2) Experiment 2:

• At stable tracking or fusion performance, GCI-MB has significantly lower OSPA error than GCI-PHD for sensor 2 in M1.The comparison uses a local PHD-TBD filter with 600 particles and an MB-TBD filter with 200 particles per hypothesized track.Source: Figure 12 · p. 13, 2) Experiment 2 · p. 13

VI. CONCLUSION

• The paper reports that GCI-MB's particle implementation demonstrates efficacy and robustness, but its hypothesis count grows exponentially with the number of targets.It identifies pruning irrelevant hypotheses early as a future direction to limit computational cost.Source: §VI · p. 13
• When targets are close, Bernoulli components may not be well separated, which can reduce the accuracy of the GCI-MB approximation.Source: §VI · p. 13