1
Neural Network-Based Multi-Target Detection
within Correlated Heavy-Tailed Clutter
S. Feintuch, H. Permuter, Senior Member, IEEE, I. Bilik, Senior Member, IEEE, and J. Tabrikian, Fellow, IEEE
Abstract—This work addresses the problem of range-Doppler
multiple target detection in a radar system in the presence of
slow-time correlated and heavy-tailed distributed clutter. Conven-
tional target detection algorithms assume Gaussian-distributed
clutter, but their performance is significantly degraded in the
presence of correlated heavy-tailed distributed clutter. Derivation
of optimal detection algorithms with heavy-tailed distributed
clutter is analytically intractable. Furthermore, the clutter dis-
tribution is frequently unknown. This work proposes a deep
learning-based approach for multiple target detection in the
range-Doppler domain. The proposed approach is based on a
unified NN model to process the time-domain radar signal for a
variety of signal-to-clutter-plus-noise ratios (SCNRs) and clutter
distributions, simplifying the detector architecture and the neural
network training procedure. The performance of the proposed
approach is evaluated in various experiments using recorded
radar echoes, and via simulations, it is shown that the proposed
method outperforms the conventional cell-averaging constant
false-alarm rate (CA-CFAR), the trimmed-mean CFAR (TM-
CFAR), and the adaptive normalized matched-filter (ANMF)
detectors in terms of probability of detection in the majority
of tested SCNRs and clutter scenarios.
Index Terms—Radar Target Detection, Correlated Heavy-
Tailed Clutter, Neural Networks, Deep Learning, CA-CFAR, TM-
CFAR, ANMF, Range-Doppler, LFM, Multiple Target Detection,
Machine Learning.
I. INTRODUCTION
Target detection in range-Doppler map is one of the major
radar tasks [1], [2]. Conventionally, the decision on target
presence is made by comparing the energy within the cell-
under-test with a threshold, which is calculated according to
the energy at neighboring cells [3]. The presence of spiky
clutter in the cells used for the detection threshold calculation
increases the threshold level, and thus, compromises the target
detection performance [3].
Considering the detector input as a one-dimensional com-
plex signal that contains slow-time samples of received radar
echoes in each range bin, the task of radar target detec-
tion within correlated heavy-tailed clutter is conventionally
formulated as a binary hypotheses decision task. Under this
formulation, the hypotheses H0and H1represent cases where
there is no target and the target is present within the cell-under-
test (CUT), respectively [3]–[22]. In [4]–[10] the problem of
radar target detection was formulated as a binary hypothesis
testing, where the optimum detectors were derived under
certain conditions. The design for a regularized covariance
Stefan Feintuch, Haim H. Permuter, Igal Bilik, and Joseph Tabrikian
are with the School of Electrical and Computer Engineering, Ben Gurion
University of the Negev, Beer Sheva, Israel. (e-mails: stefanfe@post.bgu.ac.il,
haimp@bgu.ac.il, bilik@bgu.ac.il, joseph@bgu.ac.il). This work was partially
supported by the Israel Science Foundation under Grants 2666/19 and
1895/21.
matrix estimation in the adaptive normalized matched-filter
(ANMF) was introduced in [11] to maximize the asymptotic
probability of detection, while retaining a constant false-
alarm rate (CFAR). The properties of CFAR detectors in
the presence of correlated heavy-tailed clutter were studied
in [18]. The problem of range-migrating target detection within
heavy-tailed clutter was addressed in [16], in which a fast-
converging amplitude estimation algorithm for target detection
was proposed. An orthogonal-projection-based approach to
suppress the sea clutter at each range cell in combination
with cell-averaging CFAR (CA-CFAR), was proposed in [22].
The authors in [21] addressed the target detection within
heavy-tailed clutter using massive multiple-input multiple-
output (mMIMO) radar. Therein, a detector was proposed for
the asymptotic regime with increasing number of antennas,
and its robustness to the unknown clutter distribution was
demonstrated.
However, these model-based approaches were designed con-
sidering a specific measurement model, and their performance
may degrade in the case of model mismatch. Alternatively,
data-driven machine learning (ML) approaches have been
proposed in [12]–[15], [19], [20], [23]. In these approaches,
target detection is performed using features extracted from the
data. Thus, they enable detectors’ robustness to environmental
and clutter statstics’ variations. K-nearest neighbors (KNN)
based approaches using various feature space transforms of the
raw one-dimensional complex signal were proposed in [12]–
[15], [19] to address the binary hypothesis decision task. In
particular, the authors in [12], [14] proposed to obtain a KNN-
based decision rule from simulated data, and evaluated the
proposed methods using the IPIX database [24] of recorded
radar echoes that contain correlated heavy-tailed sea clutter.
Authors in [23] used support vector machine to switch between
conventional CFAR methods and perform target detection
in an environment containing clutter edges and/or multiple
interfering targets under white Gaussian noise. The work
in [20] extended the work in [21] to angle dimension and
proposed a reinforcement learning (RL) based approach to
design the beamforming matrix in a cognitive radar (CR)
setup.
The binary hypothesis-based approaches in [4]–[22] as-
sume under the H1hypothesis a) the presence of a single-
target within each CUT and b) the availability of target-free
secondary data, which is used for clutter covariance matrix
estimation. However, practical scenarios may include multiple
targets with similar azimuth, range, and Doppler. Therefore,
the performances of these methods degrade in such scenarios.
In addition, the methods in [4]–[10], [12]–[19], [22], [23] use
the data after range matched-filter processing, which linearly
arXiv:2210.12042v2 [eess.SP] 8 Apr 2023