.png){kind=icon}
返回
A Computationally Efficient Approach for Distributed Sensor Localization and Multitarget Tracking
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2019.2954888.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the context of distributed target tracking based on a mobile peer-to-peer sensor network, the relative locations between the sensors are critical for their internode information exchange and fusion. For accurate coordinate calibration between the neighboring sensors, namely sensor localization, we propose a computationally efficient approach that minimizes the mismatch error between position estimates of the common targets yielded at neighbor sensors. This mismatch error is given by a Wasserstein-like distance that is a mean square error between two sets of position estimates which are associated efficiently via Hungarian assignment. Simulations have demonstrated that our approach, on the testbed of an arithmetic average fusion based probability hypothesis density filter, performs similar to the cutting-edge approach based on loopy belief propagation, but computes much faster and has much lower communication cost.
Keyword:
Nickel
Target tracking
Surveillance
Calibration
Computational modeling
Belief propagation
Clutter
Distributed fusion
target tracking
sensor registration
sensor localization
arithmetic average fusion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Age Differences in Blame Attributions: The Role of Relationship Outcome Ambiguity and Personal Identification指责归因的年龄差异：关系结果模糊性和个人认同的作用
OAAI
OAAI分享收藏
Distributed joint sensor registration and target tracking via sensor network.png)
INFORMATION FUSION
INFORMATION FUSIONIF15.5
PREAI
分享收藏Distributed Bernoulli Filtering for Target Detection and Tracking Based on Arithmetic Average Fusion
PREAI
分享收藏
查看更多内容