EM-Based Algorithm for Unsupervised Clustering of Measurements from a Radar Sensor Network

This article deals with the problem of clustering data returned by a radar sensor network that monitors a region where multiple moving targets are present. The network is formed by nodes with limited functionalities that transmit the estimates of target positions (after a detection) to a fusion center without any association between measurements and targets. To solve the problem at hand, we resort to model-based learning algorithms and instead of applying the plain maximum likelihood approach, due to the related computational requirements, we exploit the latent variable model coupled with the expectation–maximization algorithm. The devised estimation procedure returns posterior probabilities that are used to cluster the huge amount of data collected by the fusion center. Remarkably, we also consider challenging scenarios with an unknown number of targets and estimate it by means of the model-order selection rules. The clustering performance of the proposed strategy is compared to that of conventional data-driven methods over synthetic data. The numerical examples point out that the herein proposed solutions can provide reliable clustering performance overcoming the considered competitors.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Aerospace and Electronic Systems
Published
2024-08-23
DOI
https://doi.org/10.1109/taes.2024.3448390
Citations
3
Primary Topic
Target Tracking and Data Fusion in Sensor Networks
Type
article
Field-Weighted Citation Impact
1.04

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

EM-Based Algorithm for Unsupervised Clustering of Measurements from a Radar Sensor Network

Gaetano Giunta, Nicomino Fiscante, Carmine Clemente, Danilo Orlando et al.
3 citations
IEEE Transactions on Aerospace and Electronic Systems
Target Tracking and Data Fusion in Sensor Networks
1.04
article

EM-Based Algorithm for Unsupervised Clustering of Measurements from a Radar Sensor Network

Gaetano Giunta, Nicomino Fiscante, Carmine Clemente, Danilo Orlando, Pia Addabbo, Chengpeng Hao, Linjie Yan
article en
3 citations

Abstract

This article deals with the problem of clustering data returned by a radar sensor network that monitors a region where multiple moving targets are present. The network is formed by nodes with limited functionalities that transmit the estimates of target positions (after a detection) to a fusion center without any association between measurements and targets. To solve the problem at hand, we resort to model-based learning algorithms and instead of applying the plain maximum likelihood approach, due to the related computational requirements, we exploit the latent variable model coupled with the expectation–maximization algorithm. The devised estimation procedure returns posterior probabilities that are used to cluster the huge amount of data collected by the fusion center. Remarkably, we also consider challenging scenarios with an unknown number of targets and estimate it by means of the model-order selection rules. The clustering performance of the proposed strategy is compared to that of conventional data-driven methods over synthetic data. The numerical examples point out that the herein proposed solutions can provide reliable clustering performance overcoming the considered competitors.

IEEE Transactions on Aerospace and Electronic SystemsVol. 61(1)
University of Pisa (IT), Roma Tre University (IT), University of Strathclyde (GB), Chinese Academy of Sciences (CN), Institute of Acoustics (CN), Giustino Fortunato University (IT)
National Natural Science Foundation of China
Openalex Percentile: Top 19%
Target Tracking and Data Fusion in Sensor Networks
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.