Harmonic Mean Density Fusion in Distributed Tracking: Performance and Comparison
Nikhil Sharma, Ratnasingham Tharmarasa, Thiagalingam Kirubarajan

TL;DR
This paper introduces harmonic mean density (HMD) fusion for distributed sensor tracking, addressing correlation issues and outperforming existing methods in convergence speed and consistency in multi-sensor scenarios.
Contribution
The paper proposes HMD fusion as a novel approach that minimizes Pearson divergence, offering an easy implementation and improved performance over covariance intersection methods.
Findings
HMD fusion converges faster than existing algorithms.
HMD provides consistent estimates as shown by NEES plots.
HMD is similar to inverse covariance intersection in behavior.
Abstract
A distributed sensor fusion architecture is preferred in a real target-tracking scenario as compared to a centralized scheme since it provides many practical advantages in terms of computation load, communication bandwidth, fault-tolerance, and scalability. In multi-sensor target-tracking literature, such systems are better known by the pseudonym - track fusion, since processed tracks are fused instead of raw measurements. A fundamental problem, however, in such systems is the presence of unknown correlations between the tracks, which renders a standard Kalman filter (naive fusion) useless. A widely accepted solution is covariance intersection (CI) which provides near-optimal estimates but at the cost of a conservative covariance. Thus, the estimates are pessimistic, which might result in a delayed error convergence. Also, fusion of Gaussian mixture densities is an active area of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTarget Tracking and Data Fusion in Sensor Networks
