Clutter Edges Detection Algorithms for Structured Clutter Covariance Matrices

TL;DR

This paper introduces adaptive clutter edge detection algorithms leveraging known covariance matrix structures and rank information, significantly improving detection and localization performance in radar data analysis.

Contribution

It proposes novel adaptive architectures based on generalized likelihood ratio tests that exploit covariance matrix structures and rank estimation for enhanced clutter edge detection.

Findings

Superior detection performance demonstrated on synthetic data

Enhanced localization accuracy shown with real data

Outperforms competitors lacking a priori information

Abstract

This letter deals with the problem of clutter edge detection and localization in training data. To this end, the problem is formulated as a binary hypothesis test assuming that the ranks of the clutter covariance matrix are known, and adaptive architectures are designed based on the generalized likelihood ratio test to decide whether the training data within a sliding window contains a homogeneous set or two heterogeneous subsets. In the design stage, we utilize four different covariance matrix structures (i.e., Hermitian, persymmetric, symmetric, and centrosymmetric) to exploit the a priori information. Then, for the case of unknown ranks, the architectures are extended by devising a preliminary estimation stage resorting to the model order selection rules. Numerical examples based on both synthetic and real data highlight that the proposed solutions possess superior detection and localization performance with respect to the competitors that do not use any a priori information.