Robust Automatic Target Recognition via HRRP Sequence Based on Scatterer Matching

Abstract

High resolution range profile (HRRP) plays an important role in wideband radar automatic target recognition (ATR). In order to alleviate the sensitivity to clutter and target aspect, employing a sequence of HRRP is a promising approach to enhance the ATR performance. In this paper, a novel HRRP sequence-matching method based on singular value decomposition (SVD) is proposed. First, the HRRP sequence is decoupled into the angle space and the range space via SVD, which correspond to the span of the left and the right singular vectors, respectively. Second, atomic norm minimization (ANM) is utilized to estimate dominant scatterers in the range space and the Hausdorff distance is employed to measure the scatter similarity between the test and training data. Next, the angle space similarity between the test and training data is evaluated based on the left singular vector correlations. Finally, the range space matching result and the angle space correlation are fused with the singular values as weights. Simulation and outfield experimental results demonstrate that the proposed matching metric is a robust similarity measure for HRRP sequence recognition.

1. Introduction

High resolution range profile (HRRP)-based automatic target recognition (ATR) has drawn much attention for wideband radars [1,2,3,4,5,6]. As the one-dimensional high-resolution ‘image’ of a target, HRRP can effectively reflect energy and structure information of multiple scatterers for a distributed target along the slant range direction with respect to a certain radar line-of-sight (RLOS). Furthermore, compared with the two-dimensional high-resolution synthetic aperture radar (SAR) or inverse synthetic aperture radar (ISAR) imaging [7,8,9], HRRP-based ATR has a lower requirement on the RLOS change, lower system complexity and higher computational efficiency. Effective HRRP features and feature extraction approaches have been researched in the literature [10,11,12,13,14]. Although the structure features have excellent performances in HRRP-based ATR, they still mainly face two problems of background interference and aspect sensitivity.

The background noise will inevitably affect the performance for ATR [12,13,14]. Specifically, the training data is usually cooperatively collected in an ideal environment, while the test data is collected non-cooperatively with sheltering of interference, which requires the feature extraction to be robust for ATR in both high signal-to-noise ratio (SNR) and low SNR scenarios. To improve the robustness, structure features including the high-order spectrums and dominant scatterers are explored [15,16,17,18,19]. Compared to the high-order spectrum features with high dimensions, the scatterers are much easier for extraction with a lower computation requirement. In [19], the dominant scatterers are extracted over the Fourier dictionary with an orthogonal matching pursuit (OMP) algorithm based on a single HRRP, whose performance is affected by the off-grid problem. In this paper, atomic norm minimization [20,21,22,23] is introduced for dominant scatterer extraction, to deal with the off-grid issue that the traditional sparse recovery algorithms come with. The scatterers extracted by ANM is verified to be more precise and free of the on-grid constraints, which can improve the performance stability in the low SNR.

The other problem for ATR based on the HRRP structure features is the aspect sensitivity [2] caused by the change of the aspect angle defined as the angle between the head-on direction of the target and the RLOS. Many existing studies proposed some aspect-frames partition methods [1,24,25,26] to divide the HRRP sequence into the aspect sectors. However, these methods normally require the prior knowledge of target models and omit the aspect angle variations of HRRP sequence in a certain aspect sector, which may be impractical in various environments. Besides, hidden Markov model (HMM) is another widely discussed approach for ATR by HRRP sequence [27,28,29,30,31]. It is realized by training the multi-aspect HRRP sequences using the hidden Markov structure and estimating the state of the test HRRP sequence for recognition. But a large amount of training data is required for possible aspect angles. Recently, in [32], restricted Boltzmann machine was researched for sequential HRRP RATR, which is a supervised learning process and the training process is complicated with many hyper-parameters to tune. In this paper, we introduce the subspace decomposition to improve the robustness to the aspect sensitivity instead. As an effective approach for subspace decomposition, singular value decomposition (SVD) can realize signal denoising by separating the noised data into the signal subspace and the noise subspace [33,34,35,36,37]. The SVD operation projects the HRRP profile matrix onto orthogonal basis spaces decoupled in the range and angle domain [36], in which the range-space singular vectors are referred to constitute the “optimal” features in the range domain [38], while the angle-space singular vectors are not considered in many ATR applications. As the angle domain information is also important in HRRP sequence recognition, in this paper, we exploited the method to combine both the range-space and angle-space singular vectors together for better feature extraction. Moreover, in a short CPI, the migration through resolution cell (MTRC) effect and the high-order Doppler modulation of a target is small among the HRRP sequence, while the background interference more heavily fluctuates with aspect angle variation as it is composed of much weaker backscatterers. Therefore, the SVD process separates the signal subspace from the background interference by abandoning the singular vectors corresponding to smaller singular values, which also helps improve the noise robustness.

According to the above discussion, a novel SVD-based scatterer matching using atomic norm minimization (SSM-ANM) method is proposed to improve the HRRP-based ATR performance. Firstly, the HRRP sequence is generated with several HRRPs in a CPI with given fluctuating dominant scatterers due to the small change of the aspect angle. Then, the HRRP sequence is further decomposed via SVD, where the left and the right singular vectors correspond to the angle space and the range space, respectively. On one hand, ANM method is utilized to extract the locations and intensities of different dominant scatterers based on the right singular vectors (RSVs), where the Hausdorff distance [19,39] is introduced to get a matching result between the test data and the training data. On the other hand, the angle space correlation is calculated among the test and training data based on the left singular vectors (LSVs). Subsequently, the matching scores for the RSVs and the correlations for the LSVs are fused to form the ATR feature, with the singular values (SVs) used to weigh their corresponding matching results. By the proposed SSM-ANM method, the ATR robustness can be effectively improved in a low SNR scenario. Finally, some results of numerical and outfield experiments are provided to demonstrate the effectiveness of the SSM-ANM method.

The reminder of this paper is organized as follows. In Section 2, the distributed target model is established and the HRRP sequence model is given with relation to the aspect angles. In Section 3, SVD process of the HRRP sequence is firstly discussed. Then, the proposed SSM-ANM method is discussed in detail. In Section 4, some results of numerical experiments and real measured data are provided to demonstrate the effectiveness of the SSM-ANM method. In Section 5, some conclusions are drawn.

Notations: To simplify the presentation, we define the following notations used in this paper. We use bold lower case letters to represent a signal vector, e.g., $\mathbf{a}\in {\mathbf{C}}^N$, and use bold upper case letters to represent a signal matrix, e.g., $\mathbf{A}\in {\mathbf{C}}^{M\times N}$. $\mathbf{a}\ast \mathbf{b}$ is the convolution of $\mathbf{a}$ and $\mathbf{b}$. $\langle \mathbf{a},\mathbf{b}\rangle$ denotes the inner product. The real inner product is defined as ${\langle \mathbf{a},\mathbf{b}\rangle }_{\Re }=\mathrm{Re}\left(\langle \mathbf{a},\mathbf{b}\rangle \right)$. ${\Vert \mathbf{a}\Vert }_{\mathcal{A}}$ is the atomic norm of $\mathbf{a}$ under the atom set $\mathcal{A}$. $\left|a\right|$ is absolute value of a scaler a. $pinv(\cdot )$ denotes the pseudo-inverse.

2. HRRP Sequence Model for Recognition

Take the airborne radar for ground target recognition as an example. The geometry model is illustrated in Figure 1 for a single-channel airborne wideband radar. It is known that the echoes from large objects at high frequencies can be modeled as a sum of independent scatterers, and the geometric theory of diffraction (GTD) is widely utilized to describe the scatterer model, by which the system frequency response of the target [40] can be written as

$$H\left(f,\theta \right)={\displaystyle \sum _{k=1}^K{A}_k\left(\theta \right)\exp \left(j{\varphi }_k\left(\theta \right)\right){\left(j\frac{f}{f_0}\right)}^{{\alpha }_k}\exp \left[-j\frac{4\pi }{c}{R}_k\left(\theta \right)f\right]}$$

(1)

where $\theta$ is the aspect angle defined as the target-sensor orientation projected on XOY plane, $A_k\left(\theta \right)$ and ${\varphi }_k\left(\theta \right)$ correspond to the amplitude and phase with given $\theta$. $R_k\left(\theta \right)$ represents the radial range of $k\mathrm{th}$ scatterer to the radar, K denotes the number of scatterers, $f_0$ is the center frequency and ${\alpha }_k$ is the type parameter corresponding to the $k\mathrm{th}$ scatterers. In applications, the scatterers are supposed to be ideal point scatterers with ${\alpha }_k=0$ [40]. Then the expression of (1) can be further simplified as

$$H\left(f,\theta \right)={\displaystyle \sum _{k=1}^K{A}_k\left(\theta \right)\exp \left[j{\varphi }_k\left(\theta \right)\right]\exp \left[-j\frac{4\pi }{c}{R}_k\left(\theta \right)f\right]}$$

(2)

The corresponding response in time domain is denoted by

$$h\left(t,\theta \right)={\displaystyle \sum _{k=1}^K{A}_k\left(\theta \right)\exp \left[j{\varphi }_k\left(\theta \right)\right]\delta \left(t-{\tau }_k\left(\theta \right)\right)}$$

(3)

where ${\tau }_k\left(\theta \right)=2R_k\left(\theta \right)/c$ indicates the time delay of the $k\mathrm{th}$ scatterer’s return.

The transmitted signal of the wideband linear frequency modulated (LFM) waveform can be written as

$$s\left(t\right)=A\mathrm{rect}\left(\frac{t}{T_p}\right)\exp \left(2\pi f_{0}t+j\pi \mu t^2\right)$$

(4)

where A is the amplitude of signal, $T_p$ is the pulse width, and $\mathrm{rect}(\cdot )$ is the rectangular function. $\mu =2B/T_p$ corresponds to the chirp rate, in which B is the bandwidth. The amplitude spectrum of $s(t)$ is represented by

$$\left|S\left(f\right)\right|=\{\begin{array}{ll}A\sqrt{\frac{T_p}{B}},& \left|f-f_0\right|\le B/2\\ 0,& \left|f-f_0\right|>B/2\end{array}$$

(5)

The received signal $s_r\left(t,\theta \right)$ can be regarded as the convolution of the transmitted signal $s(t)$ and the target system response $h\left(t,\theta \right)$, i.e.,

$$s_r\left(t,\theta \right)=s\left(t\right)\times h\left(t,\theta \right)$$

(6)

After matched filtering the output signal $s_o\left(t,\theta \right)$ can be represented as

$$s_o\left(t,\theta \right)=s\left(t\right)\times h\left(t,\theta \right)\times s\left(-t\right)$$

(7)

in which the transmitted waveform is also chosen as the matched filter. Thus, its spectrum $S_o\left(f,\theta \right)$ is derived as

$$\begin{array}{l}{S}_o\left(f,\theta \right)={\left|S\left(f\right)\right|}^{2}H\left(f,\theta \right)\\ =\frac{A^2{T}_p}{B}{\displaystyle \sum _{k=1}^K{A}_k\left(\theta \right)\exp \left[j{\varphi }_k\left(\theta \right)\right]\exp \left[-j\frac{4\pi }{c}{R}_k\left(\theta \right)f\right]},\left|f-f_0\right|<B/2\end{array}$$

(8)

By the inverse Fourier transform of $S_o\left(f,\theta \right)$, the target echo $s_o\left(t,\theta \right)$ is further expressed as

$$\begin{array}{ll}{s}_o\left(t,\theta \right)& ={\displaystyle {\int }_w{\left|S\left(f\right)\right|}^{2}H\left(f,\theta \right)\exp \left(2\pi ft\right)df}\\ & =C_0{\displaystyle \sum _{k=1}^K{A}_k\left(\theta \right)\exp \left[j{\varphi }_k\left(\theta \right)\right]\mathrm{sinc}\left[\pi B\left(t-{\tau }_k\left(\theta \right)\right)\right]\exp \left[j2\pi f_0\left(t-{\tau }_k\left(\theta \right)\right)\right]}\end{array}$$

(9)

where $C_0=A^2{T}_P$. According to (9), as the combination of echoes of different scatterers, the HRRPs vary versus the aspect angle $\theta$. During the CPI, several pulses of echoes are received and constitute the HRRP sequence, where the discrete form and frequency response after digital down-conversion can be written as

$$s_o\left(n,m\right)=C_0{\displaystyle \sum _{k=1}^K{A}_k\left({\theta }_n\right)\exp \left[j{\varphi }_k\left({\theta }_n\right)\right]\mathrm{sinc}\left[\pi B\left(m\Delta t-{\tau }_k\left({\theta }_n\right)\right)\right]\exp \left(-j2\pi f_0{\tau }_k\left({\theta }_n\right)\right)}$$

(10)

$$z_o\left(n,l\right)=\frac{C_0}{B}{\displaystyle \sum _{k=1}^K{A}_k\left({\theta }_n\right)\exp \left[-j\frac{4\pi }{c}{R}_k\left({\theta }_n\right)l\Delta f+j{\varphi }_k\left({\theta }_n\right)\right]}$$

(11)

in which $m,l$ represent the mth time sampling and lth frequency response respectively, where $m\in \left\{1,\cdots ,M\right\}$ and $l\in \left\{1,\cdots ,L\right\}$. $\Delta t$ and $\Delta f$ denote the time and frequency interval respectively. $n$ represents the pulse number in the CPI, and ${\theta }_n$ is the aspect angle corresponding to the nth pulse.

To combine the HRRP sequence in the CPI for recognition, the MTRC caused by the relative motion between target and radar needs to be compensated first. For the ground target whose motion can be omitted in the CPI as it is far smaller than the motion of the airborne radar, the MTRC is compensated directly by the velocity information of the cooperative airborne platform. For the air target, the techniques for range alignment and phase compensation are widely researched [41,42], which will not be discussed here. After motion compensation, fluctuations still remain for the scatterers caused by the aspect angle variation, which can be appropriately applied for recognition in our following discussion in Section 3.

3. The Proposed HRRP Sequence Matching Method

In this part, a novel method of SVD-based scatterer matching using atomic norm minimization (SSM-ANM) is demonstrated for feature extraction and recognition. Firstly, SVD process for the HRRP sequence is explored in Section 3.1, verifying the effectiveness in noise reduction. Secondly, the whole process for SSM-ANM is illuminated in detail in Section 3.2. Then the implementation of the key procedures in SSM-ANM is introduced in Section 3.3. Lastly, some remarks on the proposed SSM-ANM method are concluded.

3.1. Singular Value Decomposition of the HRRP Sequence

Assume that the MTRC effect caused by the relative motion between the platform and target has been compensated as discussed in Section 2. Moreover, the HRRP part corresponding to the target needs to be determined in advance [43]. Then, the received HRRP sequence of the target area in the CPI can be denoted by

$$\mathbf{X}=\mathbf{S}+\mathbf{N}$$

(12)

where $\mathbf{X}={[x]}_{n,m}$, $\mathbf{S}={[s]}_{n,m}$ and $\mathbf{N}={[n]}_{n,m}$, which represent the received signal, target echoes, and background noise respectively in each pulse index n and range cell index m, where $1\le m\le M, 1\le n\le N$, as shown in Figure 2. N is the pulse number of a CPI and M is the range cell number of the target area, normally $M>N$.

The singular value decomposition (SVD) of $\mathbf{X}$ is given by

$$\mathbf{X}=\mathbf{U}\mathbf{\Lambda }{\mathbf{V}}^{\mathbf{T}}$$

(13)

where the columns of $\mathbf{U}\in {\text{ℂ}}^{N\times N}$ and $\mathbf{V}\in {\text{ℂ}}^{M\times M}$ correspond to the LSVs and RSVs of $\mathbf{X}$ respectively. $\mathbf{\Lambda }\in {\text{ℝ}}^{N\times M}$ is a diagonal matrix containing the N SVs of $\mathbf{X}$ in descending order that ${\lambda }_1\ge {\lambda }_2\ge \dots \ge {\lambda }_N\ge 0$. Assume that the background noise in each range cell obeys a complex Gaussian distribution with the mean of 0 and variance of ${\sigma }_n^2$ with independent identically distribution (i.i.d).

Next, consider the singular vectors as follows. According to (13), the RSVs in V span the orthogonal basis space in the range domain, while the LSVs in U span the basis space in the angle domain [38]. Given the Eckhart and Young theorem [44], the top singular vectors with the largest SVs can well approximate the signal, called the signal subspace, while the tail vectors with smallest SVs span the noise subspace. By reconstructing the signal with the top singular vectors, background interference can be reduced as it corresponds to the tail singular vectors. The energy threshold is set as $\eta$, defined by $\eta ={\displaystyle {\sum }_{i=1}^{Q_S}{\lambda }_i}/{\displaystyle {\sum }_{i=1}^N{\lambda }_i}$. Thus $Q_S$, the number of SVs to be chosen, can be determined by $\eta$.

In the work of the state-of-the-art for recognition, the RSVs in V are utilized for ATR while the LSVs are ignored [36,37,38]. However, the information in U is also useful in our HRRP sequence based recognition. Thus, we exploit the SVD-based feature extraction method by jointly using RSVs and LSVs, called the SSM-ANM method which will be discussed in detail in the following part.

3.2. The Process of the SSM-ANM Method for Recognition

The training data is denoted by ${\left\{{\mathbf{X}}_{N\times M_{d,g}}\right\}}^{d,g}$, where ${\mathbf{X}}_{N\times M_{d,g}}$ is the target HRRP sequence in a CPI, in which N is the pulse number and $M_{d,g}$ is the range cell number. $d\in \left\{1,\cdots ,D\right\}$ and $g\in \left\{1,\cdots ,G\right\}$ represent the posture number and the type number of the targets respectively. The test data is denoted by ${\mathbf{Y}}_{N\times M}$, and the recognition task aims to find its right type.

The LSVs, RSVs and SVs for the training data are represented by ${\left\{{\mathit{u}}_1,{\mathit{u}}_2,\cdots ,{\mathit{u}}_N\right\}}^{d,g}, {\left\{{\mathit{v}}_1,{\mathit{v}}_2,\cdots ,{\mathit{v}}_{M_{d,g}}\right\}}^{d,g}$ and ${\left\{{\lambda }_1,{\lambda }_2,\cdots ,{\lambda }_N\right\}}^{d,g}$, while the LSVs, RSVs and SVs for the test data are $\left\{{\mathit{u}}_1^0,{\mathit{u}}_2^0,\cdots ,{\mathit{u}}_N^0\right\}, \left\{{\mathit{v}}_1^0,{\mathit{v}}_2^0,\cdots ,{\mathit{v}}_M^0\right\}$ and $\left\{{\lambda }_1^0,{\lambda }_2^0,\cdots ,{\lambda }_N^0\right\}$. As the signal can be well approximated by the singular vectors corresponding to the largest SVs, here we use $s,t$ to represent the number of the dominant SVs for the training and test data, respectively, which can be determined by the energy threshold $\eta$.

For all target types $g=1,\cdots ,G$ and postures $d=1,\cdots ,D$, loop and calculate the corresponding matching scores. The type $g_0$ with the largest score is the recognition result. The whole algorithmic recap for the ground target recognition based on SSM-ANM algorithm is demonstrated in

Table 1. Algorithmic recap of the SSM-ANM method.

Algorithmic Recap of the SSM-ANM Method

Input: The training data ${\left\{{\mathbf{X}}_{N\times M_{d,g}}^{d.g}\right\}}_{d=1,g=1}^{D_g G}$ with G types of targets and $D_g$ aspect-frames for $g\mathrm{th}$ target. The test data ${\mathbf{Y}}_{N\times M}$. Get the SVD result for ${\mathbf{Y}}_{N\times M}$, denoted by ${\mathbf{Y}}_{N\times M}={\mathbf{U}}^0{\mathbf{\Lambda }}^0{\mathbf{V}}^0$. Choose the t dominant singular values and singular vectors, represented as $\left\{{\lambda }_1^0,{\lambda }_2^0,\cdots ,{\lambda }_t^0\right\}$, $\left\{{\mathit{u}}_1^0,\cdots ,{\mathit{u}}_t^0\right\}$ and $\left\{{\mathit{v}}_1^0,\cdots ,{\mathit{v}}_t^0\right\}$. Extract the location and intensity information of the dominant scatterers for ${\mathit{v}}_i^0\left(i=1,\cdots ,t\right)$. Calculate the matching score $o^{d.g}$ for each training data ${\mathbf{X}}_{N\times M_{d,g}}^{d.g}$. For g = 1 to G   For d = 1 to $D_g$ Get the SVD result for ${\mathbf{X}}_{N\times M_{d,g}}^{d.g}$, denoted by ${\mathbf{X}}_{N\times M_{d,g}}^{d.g}={\mathbf{U}}^{d,g}{\mathbf{\Lambda }}^{d,g}{\mathbf{V}}^{d,g}$. Choose the s dominant singular values and singular vectors, represented as $\left\{{\lambda }_1^{d,g},{\lambda }_2^{d,g},\cdots ,{\lambda }_s^{d,g}\right\}$, $\left\{{\mathit{u}}_1^{d,g},\cdots ,{\mathit{u}}_s^{d,g}\right\}$ and $\left\{{\mathit{v}}_1^{d,g},\cdots ,{\mathit{v}}_s^{d,g}\right\}$. Extract the location and intensity information of the dominant scatterers by ANM for ${\mathit{v}}_j^{d,g}\left(j=1,\cdots ,s\right)$, as represented by $\text{ℙ}$. Calculate the ds-HD for ${\mathit{v}}_i^0$ and ${\mathit{v}}_j^{d,g}$ for each $i=1,\cdots ,t$ and $j=1,\cdots ,s$, and form the matching matrix ${\mathbf{M}}_{s\times t}^{d,g}$. Calculate the correlation for ${\mathit{u}}_i^0$ and ${\mathit{u}}_j^{d,g}$ for each $i=1,\cdots ,t$ and $j=1,\cdots ,s$, and denoted by a correlation matrix ${\mathbf{Z}}_{s\times t}^{d.g}$. Get the matching score $o^{d.g}$ according to the following definition (15)   End End Find the largest score $o^{d_0.g_0}$ corresponding to the type $g_0$ with aspect-frame $d_0$. Output: The recognition result $g_0$ for the test data ${\mathbf{Y}}_{N\times M}$.

.

In the SSM-ANM procedures above, for the training data ${\mathbf{X}}_{N\times M_{d,g}}^{d.g}$ and test data ${\mathbf{Y}}_{N\times M}$, their range space matching matrix is denoted by ${\mathbf{M}}_{s\times t}^{d,g}$, while their angle space correlation matrix is ${\mathbf{Z}}_{s\times t}^{d.g}$. ${\mathbf{\Lambda }}_{s\times s}^{d,g}$ and ${\mathbf{\Lambda }}_{t\times t}$ are diagonal matrices consisted by their dominant SVs respectively, which are pre-normalized by their traces. Then, the matching score $o^{d.g}$ is fused by the range space matching result and the angle space correlation as follows.

The matching matrix is defined by

$${\mathbf{R}}^{d,g}={\mathbf{\Lambda }}_{s\times s}^{d,g}\left({\mathbf{M}}_{s\times t}^{d,g}\cdot {\mathbf{Z}}_{s\times t}^{d.g}\right){\mathbf{\Lambda }}_{t\times t}$$

(14)

where $(\cdot )$ is the dot product for the matrix. Equation (14) can be seen as the fusion result of ${\mathbf{M}}_{s\times t}^{d,g}$,${\mathbf{Z}}_{s\times t}^{d.g}$, ${\mathbf{\Lambda }}_{s\times s}^{d,g}$ and ${\mathbf{\Lambda }}_{t\times t}$. Furthermore, the matching score $o^{d.g}$ is represented by

$$o^{d.g}=\max \left({\mathbf{R}}^{d.g}\right)$$

(15)

where $\max (\cdot )$ is the operation to get the largest entry of the matrix. $o^{d.g}$ is the output matching score with given type g and posture d. The flowchart of the SSM-ANM is illustrated in Figure 3.

3.3. Implemantation of the Key Procedures in SSM-ANM

In this section, the key procedures in SSM-ANM are illustrated in detail, including the scatterer extraction by ANM, definition of the range space matching matrix ${\mathbf{M}}_{s\times t}^{d,g}$ and the angle correlation matrix ${\mathbf{Z}}_{s\times t}^{d.g}$, which corresponding to Section 3.3.1, Section 3.3.2 and Section 3.3.3, respectively.

3.3.1. Dominant Scatterer Extraction by Atomic Norm Minimization

In this part, the dominant scatterer extraction by ANM is researched. In our former work [23], the dominant scatterers are extracted by single HRRP, which may be unsteady in lower SNR. As the dominant RSVs of the HRRP sequence contain the scatterer information in the range domain with less noise interference, here we utilize ANM to extract the scatterer features based on dominant RSVs instead of the single HRRP. Moreover, it will be demonstrated in Section 4 that the larger RSVs follows the scatterer model which contains the information for more steady scatterers, and the performance of the dominant RSVs is superior to single HRRP in scatterer extraction and recognition. According to [23], the frequency response for scatterers can be denoted by

$$z_1\left(l\right)={\displaystyle \sum _{k=1}^K{A}_k\exp \left[-j2\pi \frac{2R_k}{c}\Delta fl+j{\varphi }_k\right]}, l=0,\dots ,L-1$$

(16)

which indicates that the signal in frequency domain can be modeled as the sum of K sinusoid components corresponding to the K dominant scatterers. As the number K is usually far smaller than the sampling frequency numbers, it can be solved by the ANM [20].

Atoms of ANM are constructed by $a\left(f,\phi \right)\in \mathbf{C}$, $f\in \left[0,1\right]$ and $\phi \in \left[0,2\pi \right)$ as

$${\left[a\left(f,\phi \right)\right]}_l=\exp \left[j\left(2\pi fl+\phi \right)\right]$$

(17)

Then (16) can be represented by the atoms as

$$z_1\left(l\right)={\displaystyle \sum _{k=1}^K{A}_k{\left[a\left(f_k,{\varphi }_k\right)\right]}_l}$$

(18)

where

$$f_k=-2R_k\Delta f/c$$

(19)

The set of atoms is denoted by $\mathcal{A}=\left\{a\left(f,\varphi \right):f\in \left[0,1\right],\varphi \in \left[0,2\pi \right)\right\}$, and the atomic norm ${\Vert \cdot \Vert }_{\mathcal{A}}$ represents its unit ball with the convex hull of $\mathcal{A}$:

$$\begin{array}{ll}{\Vert x\Vert }_{\mathcal{A}}& =\inf \left\{t>0:x\in t\mathrm{conv}\left(\mathcal{A}\right)\right\}\\ & =\underset{\begin{array}{c}{c}_k\ge 0\\ {\varphi }_k\in \left[0,2\pi \right)\\ f_k\in \left[0,1\right]\end{array}}{\inf }\left\{{\displaystyle \sum _k{c}_k:x={\displaystyle \sum _k{c}_{k}a\left(f_k,{\varphi }_k\right)}}\right\}.\end{array}$$

(20)

The atomic norm minimization problem is

$$\begin{array}{l}\mathrm{minimize}{\Vert x\Vert }_{\mathcal{A}}\\ \mathrm{subject}\mathrm{to}{x}_j=x_j^{\#},j\in T\end{array}$$

(21)

where T represents the subset of entries we observe and $x_j^{\#}$ is the continuous signal. The frequency of $f_k$ can be localized by the dual optimal solution [20] introduced as follows. Define the inner product as $\langle q,x\rangle =x^{\ast }q$, and the real inner product as ${\langle q,x\rangle }_{\Re }=\mathrm{Re}\left(x^{\ast }q\right)$. Next, the dual norm of ${\Vert \cdot \Vert }_{\mathcal{A}}$ is defined as

$$\begin{array}{ll}{\Vert q\Vert }_{\mathcal{A}}^{\ast }& =\underset{{\Vert x\Vert }_{\mathcal{A}}\le 1}{\sup }{\langle q,x\rangle }_{\Re }\\ & =\underset{\varphi \in \left[0,2\pi \right),f\in \left[0,1\right]}{\sup }{\langle q,e^{i\varphi }a\left(f,0\right)\rangle }_{\Re }\\ & =\underset{f\in \left[0,1\right]}{\sup }\left|\langle q,a\left(f,0\right)\rangle \right|\end{array}$$

(22)

According to [20], the dual atomic norm is equal to the maximum modulus of the polynomial $Q\left(z\right)={\displaystyle {\sum }_{j\in J}{q}_j}{z}^{-j}$ on the unit circle. The dual problem of (21) can be solved by

$$\begin{array}{ll}\underset{q}{\mathrm{maximize}}& {\langle q_T,x_T^{\#}\rangle }_R\\ \mathrm{subject}\mathrm{to}& {\Vert q\Vert }_{\mathcal{A}}^{\ast }\le 1\\ & q_{T^c}=0\end{array}$$

(23)

Therefore, the estimation ${\widehat{f}}_k$ of frequency $f_k$ can be determined by $Q\left(f\right)=\langle q,a\left(f,0\right)\rangle :={\displaystyle \sum _{j\in J}{q}_j{e}^{-i2\pi jf}}$, which satisfies

$$\begin{array}{l}Q\left(f_k\right)=\mathrm{sign}\left(c_k\right),\forall f_k\in \Omega \\ \left|Q\left(f\right)\right|<1\hspace{1em}\forall f\notin \Omega \\ q_j=0\hspace{1em}\forall j\notin T\end{array}$$

(24)

With ${\widehat{f}}_k$, the scatterer location estimation ${\widehat{R}}_k$ can be calculated by (19). The corresponding complex amplitude ${A^{\prime }}_k$ can be solved from (16) by

$$\left[\begin{array}{cccc}\exp \left(-j2\pi {\widehat{f}}_1\right)& \exp \left(-j2\pi {\widehat{f}}_2\right)& \cdots & \exp \left(-j2\pi {\widehat{f}}_{K_1}\right)\\ \exp \left(-j2\pi \cdot 2{\widehat{f}}_1\right)& \exp \left(-j2\pi \cdot 2{\widehat{f}}_2\right)& \cdots & \exp \left(-j2\pi \cdot 2{\widehat{f}}_{K_1}\right)\\ ⋮& ⋮& \ddots & ⋮\\ \exp \left(-j2\pi \cdot L{\widehat{f}}_1\right)& \exp \left(-j2\pi \cdot L{\widehat{f}}_2\right)& \cdots & \exp \left(-j2\pi \cdot L{\widehat{f}}_{K_1}\right)\end{array}\right]\left[\begin{array}{c}{A^{\prime }}_1\\ {A^{\prime }}_2\\ ⋮\\ {A^{\prime }}_{K_1}\end{array}\right]=\left[\begin{array}{c}{z}_1\left(1\right)\\ z_1\left(2\right)\\ ⋮\\ z_1\left(L\right)\end{array}\right]$$

(25)

which equals to

$${\mathbf{A}}^{\mathbf{\prime }}=\mathrm{pinv}(\mathbf{\Phi })\mathbf{z}$$

(26)

where

$${\mathbf{A}}^{\mathbf{\prime }}=\left[\begin{array}{c}{A^{\prime }}_1\\ {A^{\prime }}_2\\ ⋮\\ {A^{\prime }}_{K_1}\end{array}\right],\mathbf{z}=\left[\begin{array}{c}{z}_0\left(1\right)\\ z_0\left(2\right)\\ ⋮\\ z_0\left(L\right)\end{array}\right],\mathbf{\Phi }=\left[\begin{array}{cccc}\exp \left(-j2\pi {\widehat{f}}_1\right)& \exp \left(-j2\pi {\widehat{f}}_2\right)& \cdots & \exp \left(-j2\pi {\widehat{f}}_{K_1}\right)\\ \exp \left(-j2\pi \cdot 2{\widehat{f}}_1\right)& \exp \left(-j2\pi \cdot 2{\widehat{f}}_2\right)& \cdots & \exp \left(-j2\pi \cdot 2{\widehat{f}}_{K_1}\right)\\ ⋮& ⋮& \ddots & ⋮\\ \exp \left(-j2\pi \cdot L{\widehat{f}}_1\right)& \exp \left(-j2\pi \cdot L{\widehat{f}}_2\right)& \cdots & \exp \left(-j2\pi \cdot L{\widehat{f}}_{K_1}\right)\end{array}\right]$$

(27)

where $\mathrm{pinv}(\cdot )$ denotes the pseudo-inverse, and $K_1$ represents the scatterer number, which may be larger or smaller than the real scatterer number K. The amplitude and phase estimation ${\widehat{A}}_k$, ${\widehat{\varphi }}_k$ can be obtained from ${A^{\prime }}_k$.

The output of ANM dominant scatterer extraction is a set denoted by the location and intensity of each scatterer $P_k$, expressed by the feature set as

$$\mathbb{P}=\left\{P_1,P_2,\cdots ,P_{K_1}\right\}=\left\{\left({\widehat{R}}_1,{\widehat{A}}_1\right),\left({\widehat{R}}_2,{\widehat{A}}_2\right),\cdots ,\left({\widehat{R}}_{K_1},{\widehat{A}}_{K_1}\right)\right\}$$

(28)

Compared to the scatterer extraction by OMP, ANM is a sparse recovery method without a prebuild discrete dictionary, which can get rid of the off-grid problem. Thus, the estimation precision can be increased by ANM, which will be verified in Section 4.1.

The output scatterer set ℙ will be used to compute the dominant-scatterers’ Hausdorff distance [19] between the training data and test data, which is introduced in detail in the Section 3.3.2.

3.3.2. Scatterer Matching for the Dominant RSVs by Dominant-Scatterers’ Hausdorff Distance

According to Section 3.3.2, the scatterer feature set of the test target extracted by ANM based on the sum of K sinusoid components model is denoted by $\left\{{\text{ℙ}}^0\right\}$. Similarly, the scatterer feature sets of the training data are denoted by ${\left\{\text{ℙ}\right\}}^{d,g}$ for g = 1, …, G and d = 1, …, D. As the Hausdorff measure is widely used for calculating the distance between two point sets, here, we utilize the Hausdorff distance proposed in [19], called dominant-scatterers’ Hausdorff distance(ds-HD) for the scatterer matching of the dominant RSVs. Given two point sets $\mathbb{A}=\{{\mathit{a}}_1,{\mathit{a}}_2,\cdots ,{\mathit{a}}_N\}$ and $\mathbb{B}=\{{\mathit{b}}_1,{\mathit{b}}_2,\cdots ,{\mathit{b}}_Q\}$, the ds-HD is expressed as

$$\begin{array}{l}{h}_{ds}\left(\mathbb{A},\mathbb{B}\right)=\frac{1}{P_1}{\displaystyle \sum _{{\mathit{a}}_{n_1}\in {\mathbb{A}}^{\prime }}\underset{{\mathit{b}}_{q_1}\in {\mathbb{B}}^{\prime }}{\min }}d\left({\mathit{a}}_{n_1},{\mathit{b}}_{q_1}\right)\\ h_{ds}\left(\mathbb{B},\mathbb{A}\right)=\frac{1}{P_2}{\displaystyle \sum _{{\mathit{b}}_{q_{1\in {\mathbb{B}}^{\prime }}}}\underset{{\mathit{a}}_{n_1}\in {\mathbb{A}}^{\prime }}{\min }}d\left({\mathit{b}}_{q_1},{\mathit{a}}_{n_1}\right)\end{array}$$

(29)

where ${\mathbb{A}}^{\prime }={\mathbb{A}}_1^{\prime }\cup \{{\mathit{a}}_{P_1}\}=\{{\mathit{a}}_1,{\mathit{a}}_2,\cdots ,{\mathit{a}}_{P_1-1}\}\cup \{{\mathit{a}}_{P_1}\}$, ${\mathbb{A}}^{\prime }\subset \mathbb{A}$, $P_1<N$, and ${\mathbb{B}}^{\prime }={\mathbb{B}}_1^{\prime }\cup \{{\mathit{b}}_{P_2}\}=\{{\mathit{b}}_1,{\mathit{b}}_2,\cdots ,{\mathit{b}}_{P_2-1}\}\cup \{{\mathit{b}}_{P_2}\}$, ${\mathbb{B}}^{\prime }\subset \mathbb{B}$, $P_2<Q$. Let $\mathbb{A}$ and $\mathbb{B}$ be the feature sets corresponding to one dominant RSV of the training data and the test data respectively. The $d\left(\cdot ,\cdot \right)$ is calculated from the Mahalanobis distance

$$d\left({\mathit{a}}_{n_1},{\mathit{b}}_{q_1}\right)=\sqrt{{\left({\mathit{a}}_{n_1}-{\mathit{b}}_{q_1}\right)}^T{\mathbf{\Sigma }}^{-1}\left({\mathit{a}}_{n_1}-{\mathit{b}}_{q_1}\right)}$$

(30)

where $\mathbf{\Sigma }$ is a diagonal matrix with diagonal entries consisted by the measurement error variance for each feature of the scatterers, which can be estimated by the training data. Then, the ds-HD represents the mean distance from one point set to another. According to (28), two features extracted by ANM are chosen, one is the location index of the scatterer and the other is its intensity. Finally, the ds-HD used here is utilized to evaluate the distance between the training and test data as

$$H(\mathbb{A},\mathbb{B})=\max \left(h_{ds}\left(\mathbb{A},\mathbb{B}\right),h_{ds}\left(\mathbb{B},\mathbb{A}\right)\right)$$

(31)

To convert the ds-HD to the matching result of the two-point set, we introduce the matching degree index(MDI) $\mathrm{MDI}(\mathbb{A},\mathbb{B})$ as the reciprocal of $H(\mathbb{A},\mathbb{B})$ as

$$\mathrm{MDI}(\mathbb{A},\mathbb{B})=1/H(\mathbb{A},\mathbb{B})$$

(32)

Then, the MDI for the dominant RSVs of $\left\{{\mathit{v}}_1^0,\cdots ,{\mathit{v}}_t^0\right\}$ and $\left\{{\mathit{v}}_1^{d,g},\cdots ,{\mathit{v}}_s^{d,g}\right\}$ can be calculated according to the above calculation (29)–(32), denoted by the range profile matching matrix $\mathbf{M}={\left[m_{i,j}\right]}_{s\times t}$, where $m_{i,j}$ represents the MDI of the vector ${\mathit{v}}_i^0$ and ${\mathit{v}}_j^{d,g}$.

3.3.3. Angle Space Correlation by the LSVs

Moreover, the basis space for each RSV can be spanned in the angle domain by the corresponding LSV. Therefore, the dominant LSVs are exploited to obtain the angle space correlation between the training and test data. For better demonstration, take $s=t=3$ as example. As illustrated in Figure 4, the angle space $\left\{{\mathit{v}}_1^0,{\mathit{v}}_2^0,{\mathit{v}}_3^0\right\}$ that the $\left\{{\mathit{u}}_1^0,{\mathit{u}}_2^0,{\mathit{u}}_3^0\right\}$ spans do not coincide with the space $\left\{{\mathit{v}}_1^{d,g},{\mathit{v}}_2^{d,g},{\mathit{v}}_3^{d,g}\right\}$ that $\left\{{\mathit{u}}_1^{d,g},{\mathit{u}}_2^{d,g},{\mathit{u}}_3^{d,g}\right\}$ spans. The larger angle between them, the bigger difference their signal spaces have, which should be included in the recognition process. Therefore, we define the angle space correlation matrix as

$$\begin{array}{l}\mathbf{Z}={\left[z_{i,j}\right]}_{s\times t}\\ z_{i,j}=\mathrm{corr}({\mathit{u}}_i^0,{\mathit{u}}_j^{d,g})\end{array}$$

(33)

where $\mathrm{corr}(·)$ is the correlation operation. Considering that ${\mathit{v}}_1^0,{\mathit{v}}_2^0,{\mathit{v}}_3^0$ have different energy according to their SVs ${\lambda }_1^0,{\lambda }_2^0,{\lambda }_3^0$, they should be given with different weight to decide the recognition result, as used in [38]. Similarly, the weight for ${\mathit{v}}_1^{d,g},{\mathit{v}}_2^{d,g},{\mathit{v}}_3^{d,g}$ should be determined according to ${\lambda }_1^{d,g},{\lambda }_2^{d,g},{\lambda }_3^{d,g}$.

3.4. Some Remarks on the Proposed SSM-ANM Method

Remark 1. 

In the SSM-ANM method, the number of the dominant singular vectors for the training data can be different from that for the test data, which is more flexible than the traditional pattern recognition methods. Moreover, the number is determined according to the environment noise and the aspect angle variation during the CPI. With higher SNR and smaller aspect angle variation, the fewer number of singular vectors contains the signal subspace, making the SSM-ANM method adaptive to various cases.

Remark 2. 

In the Section 3.3.1, we firstly extract the scatterers on dominant RSVs by ANM and then calculate the ds-HD between the training and test data. Compared with the template matching method which calculates the RSVs’ correlation between the training and test data directly, the scatterer extraction procedure abandons the noise-only range cells and, thus, improves the performance stability in lower SNR without information loss as the structure information is mostly determined by the dominant scatterers.

Remark 3. 

The paper mainly focuses on the feature extraction stage of ATR, thus, only the scatterer matching by ds-HD is used as the classifier to compare the performances of the SSM-ANM method with the state-of-the-art literature in feature extraction. In our future work, more classifiers will be tested such as support vector machine (SVM), random forest (RF) or others for possible better classification performance.

4. Numerical and Outfield Experiments

In this section, the results of both numerical simulations and outfield experiments are given to evaluate the performance of the proposed SSM-ANM recognition accordance with different scenarios.

4.1. Effectiveness of ANM in Dominant Scatterer Extraction

To validate the effectiveness of the SVD-based dominant scatterer extraction using ANM, a simple scenario is designed as Figure 1. The airborne radar is flying towards the target with radial range $R_0=10$ km and aspect angle $\theta =$ 30°, in which the target is consisted by six dominant scatterers from A to F. The relative radial range of the six scatterers as well as their intensities are listed in

Table 2. Relative radial range and intensity for the scatterers.

Scatterer Number	A	B	C	D	E	F
Radial range/m	3.28	2.05	0.41	−0.82	−2.05	−3.27
Intensity	0.3	0.3	1	1	0.2	0.2

, where C and D have the largest and stable intensity and the other smaller ones have fluctuate intensity following Rayleigh distribution. The signal is modeled as (8)–(11), and the system parameters are listed as

Table 3. Simulation system parameters.

Parameter	Value
Carrier frequency $f_0$	X-band
Waveform	Chirp
Bandwidth B	1 GHz
Pulse repetition frequency	50 Hz
Pulse width $T_p$	2 ms
CPI	10 pulses

.

During the flight, the aspect angle varies with the relative positions between target and radar. HRRPs are synthesized and the MTRC between them is compensated with SNR = 30 dB. Figure 5 shows the HRRP sequence in the CPI, where the six dominant scatterers are noted. As the scatterers A, B, E and F have fluctuate intensity, their profiles vary seriously. After SVD, the SVs are plotted in Figure 6a, where most energy falls on the first three largest ones, and the smaller SVs only contain the noise. Figure 6b–d give the RSVs corresponding to the 1st, 2nd, 3rd largest SVs. It can be seen that the 1st RSV is consisted by the most stable components of the HRRP sequence, thus the scatterer C and D have more energy in it. The 2nd singular value contains more fluctuate components where scatterer F, E, B and A are more prominent than C and D. As to the 3rd singular value, C and D are even weaker than the others, nearly submerged by the noise.

The scatterer extraction results on the largest RSV by ANM, OMP and BP are illustrated in Figure 7, where ANM is more accurate on the estimations of scatterer location and intensity than OMP and BP.

The simulations above verify that, after SVD, the noise is reduced in the dominant RSVs, which increases the accuracy of scatterer extraction. Moreover, the most stable components of HRRPs are focused on the RSVs corresponding to the largest SVs. Moreover, ANM shows superiority in dominant scatterer extraction than OMP and BP, which is free of the off-grid problem.

4.2. Performance of the SSM-ANM Method for Recognition

4.2.1. The Effectiveness of the LSVs for Target Recognition

In the following discussion, we evaluate the effectiveness of the LSVs in feature extraction and recognition. For the comparison convenience, we define the matching matrix and matching score calculated without the angle space correlation matrix by the LSVs as

$${\mathbf{R}}_r^{d,g}={\mathbf{\Lambda }}_{s\times s}^{d,g}{\mathbf{M}}_{s\times t}^{d,g}{\mathbf{\Lambda }}_{t\times t}$$

(34)

$$O_r^{d,g}=\max ({\mathbf{R}}_r^{d,g})$$

(35)

HRRP sequences are generated corresponding to four types of military vehicles with SNR = 20 dB. The professional software 3DS MAX and FEKO are used to generate the scatterer model as well as the echoes of four types of military vehicles. Furthermore, the system parameters of the following simulations are listed in Table 3, which also act as the system parameters for the outfield experiments in Section 4.2.3. Then, the training HRRP sequences for the four types are synthesized in aspect angle centers 0, 1°, 2°, …, 180°, with angle variation of 1° in each CPI. Thus, we have 181 training samples for each target. The test HRRP sequences are generated with random aspect angle centers in 0–180°, with angle variation of 0.5°, 1° and 2°.

Two hundred Monte Carlo simulations are carried out to calculate the matching score between the training and test HRRP sequences as defined in (15) and (35). In

Table 4. Matching scores comparison of the five targets by $O_r^{d,g}$ and $O^{d,g}$.

Training HRRPs	Test HRRPs
		Type A	Type B	Type C	Type D
	Type A	1.00/1.00	0.58/0.24	0.17/0.04	0.43/0.05
	Type B	0.59/0.47	1.00/1.00	0.41/0.18	0.75/0.30
	Type C	0.16/0.13	0.53/0.27	1.00/1.00	0.52/0.19
	Type D	0.35/0.10	0.81/0.14	0.29/0.04	1.00/1.00

, the average maximum matching score in each simulation for arbitrary two types are listed, where the matching score (35) is compared with the matching score (15) in bold font. The results indicate that by utilizing LSVs, the matching scores among different types are decreased, which effectively improves the robustness to the aspect-sensitivity in a degree.

4.2.2. Recognition Performance Comparisons

The recognition performance for the proposed SSM-ANM method is compared with the SVD-based scatterer matching by OMP (SSM-OMP), the HRRP-based scatterer matching by OMP (HSM-OMP) proposed in [18], as well as the method using the matching score $O_r^{d,g}$ in (35) without LSVs (denoted by RSM-ANM). We generate echoes of the four targets in the same way discussed in Section 4.2.1, with 200 times of Monte Carlo simulations carried out. We investigate the recognition performance in different SNRs. Figure 8 compares the recognition rates of the four types of targets for the four methods, with test data varying from 0 to 20 dB and training data of 20 dB. The result indicates the advantage of the SSM-ANM in HRRP-based feature extraction and recognition.

Next, we consider the performances of the four methods in extended CPI, where Figure 9 demonstrates the recognition results with CPI = 20. The SSM-ANM method still has good performances, as it can adaptively determine the number of dominant SVs when the CPI extends to more pulses and energy spreads to more SVs. But the computation complexity will increase and the data rate will decrease for recognition when the CPI is too large. In our system, CPI in the range of 10–20 pulses is a better choice for the ATR task.

The computational complexity of the four methods is listed in

Table 5. Computational complexity of different methods.

Methods	Computational Complexity
SSM-ANM	O(MN2) + O(M3) + O(N3)
SSM-OMP	O(MN2) + O(MK2) + O(N3)
HSM-OMP	O(MK2)
RSM-ANM	O(N2M) + O(M3)

. Although the SSM-ANM method has the largest computational complexity, some fast approaches for SVD and ANM are researched to reduce the complexity further [45,46,47].

4.2.3. Outfield Real Data Experiment

Outfield real data experiments are carried out with the same parameters in Table 3. The echoes for the four typical vehicles in different aspect angles are processed and their HRRPs are generated for recognition, as illustrated in Figure 10. CPI is set as ten pulses and 500 HRRP sequences in each aspect angle center are obtained, with five angle centers from 0° to 180° with step of 45° and about 1° angle variation. Every fifth HRRP sequence is used for training and the rest are used for testing. Thus, we have 100 sequences for training and 400 sequences for testing in each aspect angle center. The SNR for the training and test data is about 30 dB. The radical range is about 5 km. The recognition results are listed in

Table 6. Real data recognition result for the SSM-ANM method.

	Target 1	Target 2	Target 3	Target 4
Target 1	0.81	0.04	0.06	0.09
Target 2	0.01	0.87	0.05	0.07
Target 3	0.04	0.02	0.83	0.11
Target 4	0.13	0.01	0.01	0.85
Average recognition rate: 0.84

,

Table 7. Real data recognition result for the SSM-OMP method.

	Target 1	Target 2	Target 3	Target 4
Target 1	0.72	0.06	0.09	0.13
Target 2	0.03	0.81	0.05	0.11
Target 3	0.08	0.04	0.76	0.12
Target 4	0.16	0.03	0.07	0.74
Average recognition rate: 0.76

,

Table 8. Real data recognition result for the SSM-OMP method without LSVs.

	Target 1	Target 2	Target 3	Target 4
Target 1	0.76	0.04	0.07	0.13
Target 2	0.01	0.83	0.06	0.10
Target 3	0.06	0.05	0.75	0.14
Target 4	0.12	0.07	0.03	0.78
Average recognition rate: 0.78

and

Table 9. Real data recognition result for the HSM-OMP method.

	Target 1	Target 2	Target 3	Target 4
Target 1	0.68	0.08	0.11	0.13
Target 2	0.06	0.72	0.10	0.12
Target 3	0.08	0.07	0.70	0.15
Target 4	0.21	0.06	0.08	0.65
Average recognition rate: 0.69

, which verified the effectiveness of the SSM-ANM method in scatterer matching and recognition.

5. Conclusions

In this paper, we proposed a scatterer matching method of SSM-ANM by HRRP sequence to get the dominant scatterer features. Firstly, the HRRP sequence in a CPI is first decomposed by SVD. Then, the dominant RSVs are processed by ANM to extract the dominant scatterer information, while the corresponding LSVs are utilized to estimate the angle space correlation between the training and test data. Moreover, the singular vectors are allocated with different weights according to their corresponding singular values. The ds-HD is used to compute the scatterer distance and the matching degree between the training and test data. Finally, the results of both numerical experiments and real measured outfield experiments are provided, which demonstrate the effectiveness and robustness of the proposed SSM-ANM method.

In our future work, we will explore the situation that the target is occluded, where the performance of the SSM-ANM method will be affected, especially when the occlusion is severe. We will make further improvement to increase the robustness to occlusion by adapting the weight of the occluded scatterers in recognition. Besides, the open set recognition problem will be considered if the object is exclusive in the training data. Thus, a classifier with rejection capability needs to be exploited.