Linjie Yan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Linjie Yan has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Danilo Orlando
Dipartimento di Ingegneria dell Informazione, Universit di Pisa, Pisa, Italy
18 shared publications - Chengpeng Hao
Institute of Acoustics, Chinese Academy of Sciences, Beijing, China
16 shared publications - Alfonso Farina
Selex-ES (retired), Rome, Italy
7 shared publications - Pia Addabbo
Universit degli Studi Giustino Fortunato Benevento, Italy
7 shared publications - Gaetano Giunta
Industrial, Electronic and Mechanical Engineering Department, University of Roma Tre, Rome, Italy
6 shared publications - Carmine Clemente
Department of Electrical and Electronic Engineering, University of Strathclyde, Glasgow, UK
4 shared publications
Latest Publications
- 16 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 9673-9689
Adaptive Detection Algorithms for Multiple Targets Combining Latent Variable Models and Sparsity
This paper considers the challenge of detecting multiple targets in a radar scenario, where several point-like targets with distinct angles of arrival (AoAs) coexist within the same range bin. Traditional methods often experience performance degradation due to assumptions of identical AoAs or reliance on prior knowledge of the targets. To address these limitations, we propose an approach that combines a suitable clustering algorithm with sparsity-based reconstruction techniques. The former classifies the range bins with targets while adaptively estimating the interference covariance matrices and target amplitudes using maximum a posteriori criteria. Concurrently, the sparse recovery methods, which exploit sparsity-promoting priors, estimate AoAs without requiring precise steering vector information, thus enhancing the algorithm f lexibility in unknown environments. Remarkably, the proposed detection architectures eliminate the need for prior knowledge of the number or (angular and range) location of targets, enabling robust detection in scenarios with homogeneous interference. Performance analysis confirms the effectiveness of the proposed architecture, demonstrating its ability to accurately cluster multiple target signals and provide (at least rough) estimates of the AoAs.
- 16 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 9673-9689
Adaptive Detection Algorithms for Multiple Targets Combining Latent Variable Models and Sparsity
This paper considers the challenge of detecting multiple targets in a radar scenario, where several point-like targets with distinct angles of arrival (AoAs) coexist within the same range bin. Traditional methods often experience performance degradation due to assumptions of identical AoAs or reliance on prior knowledge of the targets. To address these limitations, we propose an approach that combines a suitable clustering algorithm with sparsity-based reconstruction techniques. The former classifies the range bins with targets while adaptively estimating the interference covariance matrices and target amplitudes using maximum a posteriori criteria. Concurrently, the sparse recovery methods, which exploit sparsity-promoting priors, estimate AoAs without requiring precise steering vector information, thus enhancing the algorithm f lexibility in unknown environments. Remarkably, the proposed detection architectures eliminate the need for prior knowledge of the number or (angular and range) location of targets, enabling robust detection in scenarios with homogeneous interference. Performance analysis confirms the effectiveness of the proposed architecture, demonstrating its ability to accurately cluster multiple target signals and provide (at least rough) estimates of the AoAs.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62, 19636-19656
RIS-Aided Radar Detection Architectures With Application to Low-RCS Targets
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62, 19636-19656
RIS-Aided Radar Detection Architectures With Application to Low-RCS Targets
- Open Access
Joint ML-Bayesian Approach to Adaptive Radar Detection in the presence of Gaussian Interference
This paper addresses the adaptive radar target detection problem in the presence of Gaussian interference with unknown statistical properties. To this end, the problem is first formulated as a binary hypothesis test, and then we derive a detection architecture grounded on the hybrid of Maximum Likelihood (ML) and Maximum A Posterior (MAP) approach. Specifically, we resort to the hidden discrete latent variables in conjunction with the Expectation-Maximization (EM) algorithms which cyclically updates the estimates of the unknowns. In this framework, the estimates of the a posteriori probabilities under each hypothesis are representative of the inherent nature of data and used to decide for the presence of a potential target. In addition, we prove that the developed detection scheme ensures the desired Constant False Alarm Rate property with respect to the unknown interference covariance matrix. Numerical examples obtained through synthetic and real recorded data corroborate the effectiveness of the proposed architecture and show that the MAP-based approach ensures evident improvement with respect to the conventional generalized likelihood ratio test at least for the considered scenarios and parameter setting.
Open AccessJoint ML-Bayesian Approach to Adaptive Radar Detection in the presence of Gaussian Interference
This paper addresses the adaptive radar target detection problem in the presence of Gaussian interference with unknown statistical properties. To this end, the problem is first formulated as a binary hypothesis test, and then we derive a detection architecture grounded on the hybrid of Maximum Likelihood (ML) and Maximum A Posterior (MAP) approach. Specifically, we resort to the hidden discrete latent variables in conjunction with the Expectation-Maximization (EM) algorithms which cyclically updates the estimates of the unknowns. In this framework, the estimates of the a posteriori probabilities under each hypothesis are representative of the inherent nature of data and used to decide for the presence of a potential target. In addition, we prove that the developed detection scheme ensures the desired Constant False Alarm Rate property with respect to the unknown interference covariance matrix. Numerical examples obtained through synthetic and real recorded data corroborate the effectiveness of the proposed architecture and show that the MAP-based approach ensures evident improvement with respect to the conventional generalized likelihood ratio test at least for the considered scenarios and parameter setting.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Letters
- Vol. 9 (3) , 1-4
Applications for the EM-Based Classifier in Radar Sensor Network
In this letter, we focus on the application and analysis of the new model-based clustering architectures developed in our recent paper, where the analysis is limited to synthetic simulation results, to data collected by a real radar sensor. Specifically, a more comprehensive analysis of the proposed schemes is carried out in challenging real operating scenarios where the real measurements of multiple moving targets are not perfectly matched with the design assumptions due to real-world effects. Moreover, a new initialization procedure is introduced that accounts for multiple target velocities and the radar sampling time interval required by the specific application. Such a procedure is capable of providing the expectation-maximization (EM) procedure with reliable initial parameter values. The performance assessment confirms the effectiveness of these EM-based clustering algorithms not only on synthetic data, as observed in our companion paper, but also over real-recorded data and in comparison with suitable competitors.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Letters
- Vol. 9 (3) , 1-4
Applications for the EM-Based Classifier in Radar Sensor Network
In this letter, we focus on the application and analysis of the new model-based clustering architectures developed in our recent paper, where the analysis is limited to synthetic simulation results, to data collected by a real radar sensor. Specifically, a more comprehensive analysis of the proposed schemes is carried out in challenging real operating scenarios where the real measurements of multiple moving targets are not perfectly matched with the design assumptions due to real-world effects. Moreover, a new initialization procedure is introduced that accounts for multiple target velocities and the radar sampling time interval required by the specific application. Such a procedure is capable of providing the expectation-maximization (EM) procedure with reliable initial parameter values. The performance assessment confirms the effectiveness of these EM-based clustering algorithms not only on synthetic data, as observed in our companion paper, but also over real-recorded data and in comparison with suitable competitors.
- 7 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (2) , 3701-3713
Joint ML-Bayesian Approach to Adaptive Radar Detection in the Presence of Gaussian Interference
This paper addresses the adaptive radar target detection problem in the presence of Gaussian interference with unknown statistical properties. To this end, the problem is first formulated as a binary hypothesis test, and then we derive a detection architecture grounded on the hybrid of Maximum Likelihood (ML) and Maximum A Posterior (MAP) approach. Specifically, we resort to the hidden discrete latent variables in conjunction with the Expectation-Maximization (EM) algorithms which cyclically updates the estimates of the unknowns. In this framework, the estimates of the a posteriori probabilities under each hypothesis are representative of the inherent nature of data and used to decide for the presence of a potential target. In addition, we prove that the developed detection scheme ensures the desired Constant False Alarm Rate property with respect to the unknown interference covariance matrix. Numerical examples obtained through synthetic and real recorded data corroborate the effectiveness of the proposed architecture and show that the MAP-based approach ensures evident improvement with respect to the conventional generalized likelihood ratio test at least for the considered scenarios and parameter setting.
- 7 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (2) , 3701-3713
Joint ML-Bayesian Approach to Adaptive Radar Detection in the Presence of Gaussian Interference
This paper addresses the adaptive radar target detection problem in the presence of Gaussian interference with unknown statistical properties. To this end, the problem is first formulated as a binary hypothesis test, and then we derive a detection architecture grounded on the hybrid of Maximum Likelihood (ML) and Maximum A Posterior (MAP) approach. Specifically, we resort to the hidden discrete latent variables in conjunction with the Expectation-Maximization (EM) algorithms which cyclically updates the estimates of the unknowns. In this framework, the estimates of the a posteriori probabilities under each hypothesis are representative of the inherent nature of data and used to decide for the presence of a potential target. In addition, we prove that the developed detection scheme ensures the desired Constant False Alarm Rate property with respect to the unknown interference covariance matrix. Numerical examples obtained through synthetic and real recorded data corroborate the effectiveness of the proposed architecture and show that the MAP-based approach ensures evident improvement with respect to the conventional generalized likelihood ratio test at least for the considered scenarios and parameter setting.
- 23 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (1) , 787-801
EM-Based Algorithm for Unsupervised Clustering of Measurements from a Radar Sensor Network
This paper 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.
- 23 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (1) , 787-801
EM-Based Algorithm for Unsupervised Clustering of Measurements from a Radar Sensor Network
This paper 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.
- Open Access
EM-based Algorithm for Unsupervised Clustering of Measurements from a Radar Sensor Network
This paper 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.
Open AccessEM-based Algorithm for Unsupervised Clustering of Measurements from a Radar Sensor Network
This paper 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.
- 16 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Letters
- Vol. 7 (7) , 1-4
Robust Target Localization for Multistatic Passive Radar Networks
Passive multistatic radar networks localize a non-cooperative target exploiting the bistatic measurements associated with signals emitted by several transmitters of opportunity and acquired by multiple receivers. However, in realistic scenarios, it might happen that one or more receivers are damaged and/or under malicious attacks with a consequent degradation of the system performance. This paper proposes a procedure to reveal sensors that return anomalous measurements due to an attack or a failure. Specifically, we first detect such measurements by solving a binary hypothesis test, then we cancel them and estimate the final delays as well as the target position. The performance of the overall architecture is assessed using both synthetic data and real-recorded data.
- 16 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Letters
- Vol. 7 (7) , 1-4
Robust Target Localization for Multistatic Passive Radar Networks
Passive multistatic radar networks localize a non-cooperative target exploiting the bistatic measurements associated with signals emitted by several transmitters of opportunity and acquired by multiple receivers. However, in realistic scenarios, it might happen that one or more receivers are damaged and/or under malicious attacks with a consequent degradation of the system performance. This paper proposes a procedure to reveal sensors that return anomalous measurements due to an attack or a failure. Specifically, we first detect such measurements by solving a binary hypothesis test, then we cancel them and estimate the final delays as well as the target position. The performance of the overall architecture is assessed using both synthetic data and real-recorded data.
- 2 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 1010-1022
Innovative Cognitive Approaches for Joint Radar Clutter Classification and Multiple Target Detection in Heterogeneous Environments
The joint adaptive detection of multiple point-like targets in scenarios characterized by different clutter types is still an open problem in the radar community. In this paper, we provide a solution to this problem by devising detection architectures capable of classifying the range bins according to their clutter properties and detecting possible multiple targets whose positions and number are unknown. Remarkably, the information provided by the proposed architectures makes the system aware of the surrounding environment and can be exploited to enhance the entire detection and estimation performance of the system. At the design stage, we assume three different signal models and apply the latent variable model in conjunction with estimation procedures based on the expectation-maximization algorithm. In addition, for some models, the maximization step cannot be computed in closed-form (at least to the best of authors' knowledge) and, hence, suitable approximations are pursued, whereas, in other cases, the maximization is exact. The performance of the proposed architectures is assessed over synthetic data and shows that they can be effective in heterogeneous scenarios providing an initial snapshot of the radar operating scenario.
- 2 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 1010-1022
Innovative Cognitive Approaches for Joint Radar Clutter Classification and Multiple Target Detection in Heterogeneous Environments
The joint adaptive detection of multiple point-like targets in scenarios characterized by different clutter types is still an open problem in the radar community. In this paper, we provide a solution to this problem by devising detection architectures capable of classifying the range bins according to their clutter properties and detecting possible multiple targets whose positions and number are unknown. Remarkably, the information provided by the proposed architectures makes the system aware of the surrounding environment and can be exploited to enhance the entire detection and estimation performance of the system. At the design stage, we assume three different signal models and apply the latent variable model in conjunction with estimation procedures based on the expectation-maximization algorithm. In addition, for some models, the maximization step cannot be computed in closed-form (at least to the best of authors' knowledge) and, hence, suitable approximations are pursued, whereas, in other cases, the maximization is exact. The performance of the proposed architectures is assessed over synthetic data and shows that they can be effective in heterogeneous scenarios providing an initial snapshot of the radar operating scenario.