.png){kind=icon}
.png){kind=icon}
Return
Cardinality-Consensus-Based PHD Filtering for Distributed Multitarget Tracking
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2018.2878064.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a distributed probability hypothesis density (PHD) filter for multitarget tracking in decentralized sensor networks with severely constrained communication. The proposed cardinality consensus (CC) scheme uses communication only to estimate the number of targets (or, the cardinality of the target set) in a distributed way. The CC scheme allows for different implementations-e.g., using Gaussian mixtures or particles-of the local PHD filters. Although the CC scheme requires only a small amount of communication and of fusion computation, our simulation results demonstrate large performance gains compared with noncooperative local PHD filters.
Keywords:
Distributed multitarget tracking
cardinality consensus
probability hypothesis density filter
PHD filter
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
View more organizations