In this paper, a novel multi-sensor clustering algorithm, based on the density peaks clustering (DPC) algorithm, is proposed to address the multi-sensor data fusion (MSDF) problem. The MSDF problem is raised in the multi-sensor target detection (MSTD) context and corresponds to clustering observations of multiple sensors, without prior information on clutter. During the clustering process, the data points from the same sensor cannot be grouped into the same cluster, which is called the cannot link (CL) constraint; the size of each cluster should be within a certain range; and overlapping clusters (if any) must be divided into multiple clusters to satisfy the CL constraint. The simulation results confirm the validity and reliability of the proposed algorithm.
In this paper, we propose a low complexity distributed approach to address the multitarget detection/tracking problem in the presence of noisy and missing data. The proposed approach consists of two components: a distributed flooding scheme for measurements exchanging among sensors and a sampling-based clustering approach for target detection/tracking from the aggregated measurements. The main advantage of the proposed approach over the prevailing Markov-Bayes-based distributed filters is that it does not require any priori information and all the information required is the measurement set from multiple sensors. A comparison of the proposed approach with the available distributed clustering approaches and the cutting edge distributed multi-Bernoulli filters that are modeled with appropriate parameters confirms the effectiveness and the reliability of the proposed approach.