# SAR Image Target Recognition Based on Monogenic Signal and Sparse Representation

Authors: XiuXia Ji; Yinan Sun
Journal: Wireless Communications and Mobile Computing
 (2021)

---

## Abstract

It is necessary to recognize the target in the situation of military battlefield monitoring and civilian real-time monitoring. Sparse representation-based SAR image target recognition method uses training samples or feature information to construct an overcomplete dictionary, which will inevitably affect the recognition speed. In this paper, a method based on monogenic signal and sparse representation is presented for SAR image target recognition. In this method, the extended maximum average correlation height filter is used to train the samples and generate the templates. The monogenic features of the templates are extracted to construct subdictionaries, and the subdictionaries are combined to construct a cascade dictionary. Sparse representation coefficients of the testing samples over the cascade dictionary are calculated by the orthogonal matching tracking algorithm, and recognition is realized according to the energy of the sparse coefficients and voting recognition. The experimental results suggest that the new approach has good results in terms of recognition accuracy and recognition time.


---

## Body

## 1. Introduction

As a new kind of reconnaissance remote sensing device, SAR is widely used in aerial and space reconnaissance, monitoring, and intelligent tracking of moving aerial targets [1–3]. UAVs are widely used in military surveillance, smart home monitoring, and target tracking. UAV-borne SAR has become an important development direction of UAV remote sensing earth observation technology. In the situation of military battlefield monitoring and smart cities monitoring, it is necessary to classify and identify the target. SAR image target recognition mainly refers to radar detection of targets, processing of echo information, and determination of target attributes, categories, or types. The spectral property for SAR images is determined by the back-scattered signal that is simply the back reflected part of the microwaves scattered from the land cover. Since the back-scattered signal is very weak, it is very difficult to distinguish different types of targets in SAR images. At the same time, the inherent speckle noise will play a vital role in information extraction from SAR images. Being affected by the inherent speckle noise, SAR images are inferior in readability. In addition, the image features change tremendously as slight fluctuations of imaging parameters or the variation of surroundings which will affect the accuracy and speed of SAR image target recognition.SAR image target recognition mainly consists of three stages: image processing, feature extraction, and classifier design. The purpose of image processing is to remove speckle noise, segment SAR image, and make it easy to extract features and recognize the image target. Feature extraction directly affects the accuracy of SAR image target recognition. Features used for image classification usually include principal component analysis (PCA), generalized 2-dimensional principal component analysis (G2DPCA), independent component analysis (ICA), and wavelet. For two-dimensional images, monogenic signal perfectly reproduces the monogenic amplitude of the signal energy, monogenic phase of the signal structure information, and monogenic orientation of the signal geometry information, which has been widely used in the field of image processing [4–6].Similarly, there are many classifiers for SAR image recognition, such as support vector machine (SVM) [7], k-nearest neighbor (KNN) [8], and neural network (NN) [9]. In the above recognition algorithms, in order to ensure the recognition performance, KNN classifier theoretically requires an infinite number of training samples, which is obviously difficult to meet in practical application. SVM classifier transforms the linear inseparable problem into a linear divisible problem by using spatial projection. The huge amount of computation caused by training seriously affects the recognition speed of SAR image targets. NN classifier uses the training samples to learn the parameters and weights of training networks. When the categories and numbers of training samples are large, the corresponding computation is also very large, which will lead to the lack of convergence in the training process. Therefore, the research of SAR image target recognition algorithm urgently needs to inject new elements.In recent years, sparse representation of image signals has been widely concerned in the field of pattern recognition. Wright J first proposed a sparse representation-based classifier (SRC); it constructed an overcomplete dictionary with multiple kinds of training samples with label information and classified by using sparse representation coefficients of testing samples on the dictionary [10]. Now, sparse representation has been widely applied to face recognition [11–13], the direction of arrival estimation, tensor modeling and angle estimation [14–16], and SAR image target recognition [17, 18]. Extended maximum average correlation height (EMACH) filter is actually a kind of template filter; it is widely applied to the recognition of specific military targets because of its high matching ability and strong antinoise ability. EMACH combined with exponential wavelet fractal feature and G2DPCA feature is applied to target detection of SAR image, and EMACH combined with G2DPCA feature is used to complete SAR image target recognition.SAR image target recognition algorithm based on sparse representation is designed from two aspects. The one is using dictionary learning to complete recognition. There are two main methods; one is to train dictionaries directly to make them discriminant. That is to say, the dictionary should be designed according to the training sample and has certain adaptability. If the features of training samples are directly extracted to construct overcomplete dictionary, the dictionary dimension is high and the redundancy is large, which will affect the speed of testing samples recognition. The second is to study and optimize the dictionary in order to improve its recognition ability. For example, Literature [19] used discriminant KSVD dictionary learning method to complete SAR image target recognition. The other one is using sparse coefficient to complete recognition. Unlike training multicategory dictionaries, this approach only requires training a whole dictionary without paying attention to the category of each dictionary. The recognition algorithm based on this method usually needs to consider adding the recognition error to the cost function when learning the dictionary, so that the trained dictionary has good recognition ability.In this paper, SAR image target recognition is also studied from the point of dictionary design and sparse coefficient solving. EMACH filter is used to train samples and generate template samples; the monogenic features of all templates are extracted; three subdictionaries are generated according to the monogenic amplitude, the monogenic phase, and the monogenic orientation; the sparse coefficients of the testing samples’ monogenic feature in each level dictionary are solved; and the category of samples to be tested is determined by the image reconstruction error.The main contributions of this paper are summarized as follows:(1)
The proposed SAR image target recognition method uses sparse representation to identify SAR image target, which eliminates the need for additional suppression of speckle noise, reduces the steps of SAR image processing and saves time(2)
The proposed SAR image target recognition method uses three subdictionaries to construct an overcomplete cascade dictionary, and it obviously improves the recognition speed in the precondition of ensuring the recognition accuracyThe remainder of this paper is organized as follows. Section2 gives a brief survey of the related works about SAR image target recognition method based on sparse representation. Section 3 describes the motivation and design of the proposed SAR image recognition method which is the major contribution of this paper. Experimental results and discussion are shown in Section 4. Finally, the concluding remarks are given in Section 5.


## 2. SAR Image Recognition Based on Sparse Representation

When sparse representation is originally used in face recognition, an overcomplete dictionary is mainly constructed by the training samples; the testing sample is expressed as a linear combination of atoms in the overcomplete dictionary. The face image can be accurately recovered according to the sparse representation coefficients, and the recognition of the target is realized according to the distance metric between the reconstructed image and the testing sample image.There are similarities and differences between SAR image target recognition and face recognition. They are same in constructing the overcomplete dictionary with the training samples. If the testing sample can be represented linearly by the atoms of the overcomplete dictionary, and the coefficient of the corresponding target category in all the sparse representation coefficients is large, then the representation of the testing sample in the dictionary is sparse, and the recognition discrimination is completed according to the energy characteristics of the sparse representation coefficient. SAR image target recognition method based on sparse representation omits the reconstruction process in face recognition method. The framework of the specific recognition method is shown in Figure1.Figure 1
The framework of SAR image target recognition based on sparse representation.In SAR image target recognition, it is assumed that there are k class samples; column vector setDi=vi,1,vi,2,⋯,vi,ni∈Rm×ni of matrix is composed of ni training samples of class i target. Any kind of testing sample y∈Rm can be expressed as a linear combination of the training samples.
(1)y=αi,1vi,1+αi,2vi,2+⋯+αi,nivi,ni,where αi,j∈Rj=1,2,⋯,ni is the coefficient of linear representation of the testing sample in the dictionary.If the classi of the testing sample y is unknown, all k class n training sample sets are formed into matrix D, that is,
(2)D=D1,D2,⋯Dk=ν1,1,ν1,2,⋯νk,nk.The linear representation of test sampley under all training samples is as follows.
(3)y=α1,1v1,1+α1,2v1,2+⋯+αk,nkvk,nk,(4)y=Dx^,where x^=0,⋯,0,⋯αi,1,αi,2,⋯αi,ni,⋯,0,⋯,0T∈Rn is a coefficient vector.In an ideal case, only the same type of training sample factor as the testing sample may be nonzero in thex^; the corresponding coefficient for the other class samples shall be 0. Since the sparse coefficient x^ contains the information of the target category, the recognition of the target can be realized by the solution of the formula y=Dx^.In the SAR image target recognition method based on sparse representation, the structure of overcomplete dictionary is very critical. The dictionary must be of low dimension, and the atoms of the dictionary should correspond to the properties of the SAR image. At the same time, sparse representation coefficients of different classes of targets over the dictionary must be distinguishable.Considering the above points, if the overcomplete dictionary is composed of SAR image pixels, that is, the overcomplete dictionary is constructed directly by stretching the central region of the image into a column vector. Because of the high dimension of the dictionary, it will directly affect the speed of solving the subsequent sparse representation coefficients. The overcomplete dictionary can be constructed by using the representation vector which can describe the characteristics of SAR image target. Thus, it can reduce the dimension of dictionary atoms and improve the speed of sparse solution. In [20], G2DPCA features are used to construct the overcomplete dictionary, which reduces the dimension of extracted features, improves the recognition performance, and has good robustness to the change of target azimuth.


## 3. The Proposed SAR Image Target Recognition Method

The above SAR image target recognition method based on sparse representation takes the feature information extracted by all categories of the training samples or the training samples as the atoms of the overcomplete dictionary. When the number of the training samples is too large, the dictionaries generated by these two methods are too large, which is bound to affect the speed of recognition. In this paper, a cascade dictionary is adopted, that is, subdictionaries are generated according to the monogenic feature of the training samples and the category of the sample to be determined by the reconstruction error. For simplicity, the system framework is divided into the following four stages: image processing, EMACH train, feature extraction, and target recognition. Explanation of each step is described below.


### 3.1. Image Processing

First of all, we extract the region containing the target in the image and generate a new target image based on the biggest scattering point of the target section as the sample image. Since sparse representation can effectively remove noise [21], there is no need for additional noise removal of SAR images in this paper. Take T7 tank image (138×138) with angle as a sample. Select the target region of 45×45 contained in the center of the image as the sample image (as shown in Figure 2).Figure 2
Image processing.It can be seen from the images before and after the processing that the sample image after processing aims at description on the target, the detail information of the target has been enhanced, and the influence of the surrounding clutters on the target is reduced.


### 3.2. EMACH Train

EMACH obtains a two-dimensional function by training the sample image, and then, the correlation response of the image is obtained after doing the correlation operation with the image to be detected of the same size, and the target is judged according to the intensity of the response.First input images of size45×45 extend the pixel to a one-dimensional vector xi with the length of 45×45 line by line from left to right and from top to bottom. Define h as the filter of EMACH. FFT2 () represents Fourier operation and assign β∈0,1, M=FFTm, Xi=FFTxi, and i=1,2,⋯,N.
(5)Cxβ=1N∑i=1Nxi−1−βm+xi−1−βm,(6)Sxβ=1N∑i=1NXi−1−βM+Xi−1−βM,where m is the mean value of xi. The symbol of “+” represents matrix transposition.
(7)Jh=h+Cxβhh+I+Sxβh.When the value of formula (7) is maximum, h is the EMACH filter.In this paper, the sample image in MSTAR database is processed. The templates are obtained using EMACH, and all the images within the range of 12° azimuth are selected to train a template, and 30 templates are trained for each type of image, for a total of 150 templates. Figure3 shows all EMACH template images.Figure 3
Template images.
(a)
Template images of BRDM2
(b)
Template images of 2S1
(c)
Template images of T72
(d)
Template images of SLICY
(e)
Template images of ZSU234


### 3.3. Feature Extraction

The traditional Gabor filter uses an adjustable filter to filter amplitude and phase in different directions and scale. Riesz transform is introduced in the analysis of monogenic signal. The expression of the Riesz transform kernel in the spatial domain is defined as(8)ηz=ηx,ηy=x2πz3,y2πz3.Supposew=u,v, u,v represent two coordinates in the frequency domain, the frequency domain response of Log-Gabor filter is
(9)gLGw=exp−logw/γ022logσ/γ02,where γ0 is the central frequency and σ is the scale of Log-Gabor filter. Log-Gabor filters of different scales can be obtained by modify σ.The band communication number generated by the filter of 2D imagef can be expressed as
(10)h=f∗F−1gLGw,where ∗ is the convolution operator and F−1 represents the inverse Fourier transform.
(11)hx=h∗ηx,(12)hy=h∗ηy,where h is the real part of monogenic transformation and hx and hy are the two imaginary parts.For a given imagef, the monogenic amplitude A, the monogenic phase ϕ, and the monogenic orientation θ can be calculated by the following formula:
(13)A=h2+hx2+hy2,(14)ϕ=arctanhx2+hy2h,(15)θ=arctanhyhx.Obtain the monogenic feature of theind template image with s scale of log-Gabor filter; it can be described as
(16)Ai,1,ϕi,1,θi,1,Ai,2,ϕi,2,θi,2,⋯,Ai,S,ϕi,S,θi,S.Pull the monogenic feature into one-dimensional vector and normalize it:(17)Di=χAi,1,χAi,2,⋯,χAi,S,χϕi,1,χϕi,2,⋯,χϕi,S,χθi,1,χθi,2,⋯,χθi,S.Assuming the total number of the training samples isn, and the subdictionary Dk can be expressed as:
(18)D1=χA1,1,χA1,2,⋯,χA1,S,⋯,χAn,1,χAn,2,⋯,χAn,S,(19)D2=χϕ1,1,χϕ1,2,⋯,χϕ1,S,⋯,χϕn,1,χϕn,2,⋯,χϕn,S,(20)D3=χθ1,1,χθ1,2,⋯,χθ1,S,⋯,χθn,1,χθn,2,⋯,χθn,S.Each subdictionary can be treated as a binary classifier, cascading all subdictionaries into a cascading dictionary.


### 3.4. Target Recognition

In early research, ensembles were shown empirically and theoretically to possess better accuracy than any single component classifier [22]. Since each classifier can only classify the samples of corresponding category, it can be considered a weak classifier. However, a plurality of weak classifiers are cascaded to form a strong classifier with strong recognition capability, and the cascade classifier designed by the hierarchical structure can make most of the samples of the previous categories be recognized directly in the previous classifiers, and only a small part of samples of the latter categories or the missed samples will pass all the subclassifiers, and the recognition time can be obviously reduced.As stated earlier, the objective of this paper is to develop a cascade classifier that will improve SAR image target recognition accuracy and reduce recognition time. For this purpose, we trained three subdictionaries and then combined them into a cascade dictionary. Because the final classifier uses the cascade structure, the recognition performance of each subclassifier is very important. In this paper, the subclassifiers are designed based on the monogenic features, each monogenic feature generates a subdictionary, the sparse coefficient of the testing sample under each subdictionary is obtained, the testing sample is reconstructed by the coefficient, and the sample category is determined by the reconstruction error. The selection of reconstruction error has a great influence on the recognition performance of subclassifiers. In general, a larger reconstruction error threshold results in a shorter recognition time, but a higher recognition error rate is also generated. The reconstruction error threshold selected in this paper is large. In this way, although there are some samples missed recognition, the last voting mechanism guarantees the correct recognition of this part of samples.The system framework of the proposed SAR image target recognition method based on monogenic signal and sparse representation is shown in Figure4.Figure 4
The system framework of cascade structure classifier.The main steps of the SAR image target recognition method based on monogenic signal and cascade dictionary are described below.Step 1.
Process the training samples.Step 2.
Train the samples with the EMACH filter and generate the template samples.Step 3.
Extract the monogenic features of the template samples, and generate subdictionariesDii=1,2,3 according to the monogenic amplitude, the monogenic phase, and the monogenic orientation features.Step 4.
For any testing sampley∈Rm, the monogenic feature is extracted as X=A,φ,θ. Repeat the following steps until the condition is met.
(i)
For signalXii=1,2,3, use the improved orthogonal matching pursuit algorithm to solve underdetermined linear equations Xi=Diα, and find out the most sparse coefficient α(21)minαα1s.t.y−Diα2<ε.(ii)
Since all the atoms in the dictionary have labels, the sum of coefficients of thek class can be calculated:(22)rky=sumαk,i,i=1,2,⋯,nk.(iii)
Determine the category of testing sample according to the sum of coefficients(23)identityy=argmaxkrky.(iv)
If the category is the same as the previous category, directly output categoryk and skip to Step 5; otherwise, i=i+1; if i>3, skip to Step 5; otherwise, Step 4 is repeatedStep 5.
If the testing sample falls into different categories under the three subdictionaries, the category is determined by the voting recognition according to the reconstruction error.(24)identityy=argminkXi−Diαk.


## 3.1. Image Processing

First of all, we extract the region containing the target in the image and generate a new target image based on the biggest scattering point of the target section as the sample image. Since sparse representation can effectively remove noise [21], there is no need for additional noise removal of SAR images in this paper. Take T7 tank image (138×138) with angle as a sample. Select the target region of 45×45 contained in the center of the image as the sample image (as shown in Figure 2).Figure 2
Image processing.It can be seen from the images before and after the processing that the sample image after processing aims at description on the target, the detail information of the target has been enhanced, and the influence of the surrounding clutters on the target is reduced.


## 3.2. EMACH Train

EMACH obtains a two-dimensional function by training the sample image, and then, the correlation response of the image is obtained after doing the correlation operation with the image to be detected of the same size, and the target is judged according to the intensity of the response.First input images of size45×45 extend the pixel to a one-dimensional vector xi with the length of 45×45 line by line from left to right and from top to bottom. Define h as the filter of EMACH. FFT2 () represents Fourier operation and assign β∈0,1, M=FFTm, Xi=FFTxi, and i=1,2,⋯,N.
(5)Cxβ=1N∑i=1Nxi−1−βm+xi−1−βm,(6)Sxβ=1N∑i=1NXi−1−βM+Xi−1−βM,where m is the mean value of xi. The symbol of “+” represents matrix transposition.
(7)Jh=h+Cxβhh+I+Sxβh.When the value of formula (7) is maximum, h is the EMACH filter.In this paper, the sample image in MSTAR database is processed. The templates are obtained using EMACH, and all the images within the range of 12° azimuth are selected to train a template, and 30 templates are trained for each type of image, for a total of 150 templates. Figure3 shows all EMACH template images.Figure 3
Template images.
(a)
Template images of BRDM2
(b)
Template images of 2S1
(c)
Template images of T72
(d)
Template images of SLICY
(e)
Template images of ZSU234


## 3.3. Feature Extraction

The traditional Gabor filter uses an adjustable filter to filter amplitude and phase in different directions and scale. Riesz transform is introduced in the analysis of monogenic signal. The expression of the Riesz transform kernel in the spatial domain is defined as(8)ηz=ηx,ηy=x2πz3,y2πz3.Supposew=u,v, u,v represent two coordinates in the frequency domain, the frequency domain response of Log-Gabor filter is
(9)gLGw=exp−logw/γ022logσ/γ02,where γ0 is the central frequency and σ is the scale of Log-Gabor filter. Log-Gabor filters of different scales can be obtained by modify σ.The band communication number generated by the filter of 2D imagef can be expressed as
(10)h=f∗F−1gLGw,where ∗ is the convolution operator and F−1 represents the inverse Fourier transform.
(11)hx=h∗ηx,(12)hy=h∗ηy,where h is the real part of monogenic transformation and hx and hy are the two imaginary parts.For a given imagef, the monogenic amplitude A, the monogenic phase ϕ, and the monogenic orientation θ can be calculated by the following formula:
(13)A=h2+hx2+hy2,(14)ϕ=arctanhx2+hy2h,(15)θ=arctanhyhx.Obtain the monogenic feature of theind template image with s scale of log-Gabor filter; it can be described as
(16)Ai,1,ϕi,1,θi,1,Ai,2,ϕi,2,θi,2,⋯,Ai,S,ϕi,S,θi,S.Pull the monogenic feature into one-dimensional vector and normalize it:(17)Di=χAi,1,χAi,2,⋯,χAi,S,χϕi,1,χϕi,2,⋯,χϕi,S,χθi,1,χθi,2,⋯,χθi,S.Assuming the total number of the training samples isn, and the subdictionary Dk can be expressed as:
(18)D1=χA1,1,χA1,2,⋯,χA1,S,⋯,χAn,1,χAn,2,⋯,χAn,S,(19)D2=χϕ1,1,χϕ1,2,⋯,χϕ1,S,⋯,χϕn,1,χϕn,2,⋯,χϕn,S,(20)D3=χθ1,1,χθ1,2,⋯,χθ1,S,⋯,χθn,1,χθn,2,⋯,χθn,S.Each subdictionary can be treated as a binary classifier, cascading all subdictionaries into a cascading dictionary.


## 3.4. Target Recognition

In early research, ensembles were shown empirically and theoretically to possess better accuracy than any single component classifier [22]. Since each classifier can only classify the samples of corresponding category, it can be considered a weak classifier. However, a plurality of weak classifiers are cascaded to form a strong classifier with strong recognition capability, and the cascade classifier designed by the hierarchical structure can make most of the samples of the previous categories be recognized directly in the previous classifiers, and only a small part of samples of the latter categories or the missed samples will pass all the subclassifiers, and the recognition time can be obviously reduced.As stated earlier, the objective of this paper is to develop a cascade classifier that will improve SAR image target recognition accuracy and reduce recognition time. For this purpose, we trained three subdictionaries and then combined them into a cascade dictionary. Because the final classifier uses the cascade structure, the recognition performance of each subclassifier is very important. In this paper, the subclassifiers are designed based on the monogenic features, each monogenic feature generates a subdictionary, the sparse coefficient of the testing sample under each subdictionary is obtained, the testing sample is reconstructed by the coefficient, and the sample category is determined by the reconstruction error. The selection of reconstruction error has a great influence on the recognition performance of subclassifiers. In general, a larger reconstruction error threshold results in a shorter recognition time, but a higher recognition error rate is also generated. The reconstruction error threshold selected in this paper is large. In this way, although there are some samples missed recognition, the last voting mechanism guarantees the correct recognition of this part of samples.The system framework of the proposed SAR image target recognition method based on monogenic signal and sparse representation is shown in Figure4.Figure 4
The system framework of cascade structure classifier.The main steps of the SAR image target recognition method based on monogenic signal and cascade dictionary are described below.Step 1.
Process the training samples.Step 2.
Train the samples with the EMACH filter and generate the template samples.Step 3.
Extract the monogenic features of the template samples, and generate subdictionariesDii=1,2,3 according to the monogenic amplitude, the monogenic phase, and the monogenic orientation features.Step 4.
For any testing sampley∈Rm, the monogenic feature is extracted as X=A,φ,θ. Repeat the following steps until the condition is met.
(i)
For signalXii=1,2,3, use the improved orthogonal matching pursuit algorithm to solve underdetermined linear equations Xi=Diα, and find out the most sparse coefficient α(21)minαα1s.t.y−Diα2<ε.(ii)
Since all the atoms in the dictionary have labels, the sum of coefficients of thek class can be calculated:(22)rky=sumαk,i,i=1,2,⋯,nk.(iii)
Determine the category of testing sample according to the sum of coefficients(23)identityy=argmaxkrky.(iv)
If the category is the same as the previous category, directly output categoryk and skip to Step 5; otherwise, i=i+1; if i>3, skip to Step 5; otherwise, Step 4 is repeatedStep 5.
If the testing sample falls into different categories under the three subdictionaries, the category is determined by the voting recognition according to the reconstruction error.(24)identityy=argminkXi−Diαk.


## 4. Experimental Results and Analysis

In this section, we describe and discuss the experimental results obtained on the study sites introduced in Section3. We carried out several experiments with the aim to supply a complete analysis of the performance of the proposed SAR image target recognition method. We investigate different aspects: (i) we perform an experiment to evaluate the recognition accuracy of the proposed recognition method and (ii) we perform an in-depth comparative analysis of the performance of the proposed method with respect to the other recognition methods.


### 4.1. Data Set Used for Experiments

The experimental data used herein is from the SAR ground still data of the SAR ground target high resolution provided by the Working Group of the United States DARPA/AFRL MSTAR. As a result of the SAR imaging, even if the target is same, the azimuth difference can cause the difference of the characteristic information, and the difference of the azimuth angle can cause the difference between the postimaging targets, because the training samples are required to contain all the imaging data at different angles. The SAR image data in the MSTAR database is comprehensive; the azimuth coverage of each target is from 0° to 360°. The experiment selects a subset of MSTAR database, including five types of SAR images: BRDM2, 2S1, T72, SLICY, and ZSU234. The imaging resolution of the image is0.3m×0.3m, and the azimuth range is from 0° to 360°. In the experiments, the imaging data at 17° are selected as the training samples, and the imaging data when the angle is 15° are used as the testing samples. Since some of the SAR images are noise polluted seriously from certain angle, the amount of images sample for every single target can be used is different. The amount of training samples and testing samples used in this experiment is shown in Table 1.Table 1
Experimental sample data set.
Target type
Training sample
Testing sample
BRDM2
298
274
2S1
299
274
T72
232
196
SLICY
299
288
ZSU234
299
274In order to compare efficiency of proposed method, we establish two characteristics as a comparison basis:(i) Recognition accuracy: proportion of the testing samples correctly recognized by the algorithm.(ii) Recognition time: the time it takes an algorithm to complete a given task.The experiment was conducted with Matlab-2012b 64bit, installed on windows 10 professional 64bit with an Intel Core i7 Processor (8MCache, up to 3.90 GHz), and 16 GB of RAM.


### 4.2. Recognition Performance Analysis

The monogenic features of each kind of sample images are extracted and drawn into column vectors to form three subdictionariesDii=1,2,3, concatenate the subdictionaries, and form a cascade classifier shown in Figure 4. For the testing samples, the region with 45×45 size of the target in the center of the image is also selected to realize the segmentation, and the recognition accuracy of each class of testing samples with the proposed method in this paper is shown in Table 2.Table 2
The recognition accuracy of the proposed method.
BRDM2
2S1
T72
SLICY
ZSU234
Total number of samples
274
274
196
288
274
Correct sample number of primary recognition
252
218
165
278
250
Primary recognition accuracy (%)
91.97
79.56
84.18
96.53
91.24
Correct sample number of voting recognition
11
42
20
5
10
Voting recognition accuracy (%)
4.01
15.33
10.20
1.73
3.65
Recognition accuracy (%)
95.98
94.89
94.38
98.26
94.89The correct sample of primary recognition refers to the samples that do not need to participate in the final voting mechanism recognition, and the correct sample of voting recognition refers to the samples that need to participate in the final voting mechanism recognition, that is, the samples that are missed in cascade recognition. Suppose the total number of samples isN, correct sample number of primary recognition is n1, and correct sample number of voting recognition is n2.
(25)Primaryrecognitionaccuracy=n1N×100%,(26)Votingrecognitionaccuracy=n2N×100%,(27)Recognitionaccuracy=n1+n2N×100%.As can be seen from Table2, in the design of the classifier, because the reconstruction error threshold is large, about 10% of the samples are missed in the first recognition. However, because of the existence of voting mechanism, this part of the missed samples has been correctly recognized at the time of the final vote.Additionally, in order to further assess the effectiveness of the proposed recognition method, this paper compared it with the other four methods including the traditional classifiers, such as the SVM recognition method (method 1), the KNN recognition method (method 2), the method with the dictionary directly generated by image pixels (method 3), and the method with the dictionary generated by G2DPCA features in [20] (method 4).In method 1, SVM is a small sample learning classification method, which has strong generalization ability. Nonlinear processing can be easily realized by introducing kernel function mapping. Suppose monogenic feature isx=x1,x2,⋯xM, where M is the number of categories of the samples. For the tagged training sets xi,yi,i=1,2,⋯,M, yi∈1,−1, SVM is to solve the following optimization problems.
(28)minw,b,η12wTw+C∑i=1KηisubjecttoyiwTfxi+b≥1−ηiηi≥0,where C is the penalty factor of the error term.Usually, RBF kernel function is used to map the training vector to high dimensional space.(29)Kxk,xg=φxkTφxg=exp−γxk−xg2>0,where γ is a nuclear factor. In this paper, the kernel function selected is ku,v=exp−γu−v, γ=5.In method 2, KNN is a simple and effective technique for objects classification according to the closest training examples in the feature space. KNN rates the neighbor of a test sequence among the training sample and uses the class labels of the nearest neighbor to predict the test vector class.For the tagged training setsxi,yi, yi∈1,−1, the Euclidean distance is often used as the distance metric to measure the similarity between two vectors.
(30)d2xi,xj=xi−xj2=∑k=1dxik−xjk2.Parameterk represents the number of neighbors in a set of training observations which are nearest to the given observation in validation or testing data set. Variation of this parameter will affect the accuracy of each binary classifier inside an expert. In this paper, parameter k=5.In method 3, the dictionary is constructed directly with the image pixels. In method 4, the dictionary is constructed directly with the G2DPCA feature.Experimental results, for each data set, are represented separately for all methods in Figure5; the graphical representations of average recognition accuracy and the recognition time are shown in Figures 6 and 7.Figure 5
Recognition accuracy of different recognition methods.Figure 6
Recognition accuracy of different recognition methods.Figure 7
Recognition time of different recognition methods.As can be seen from Figures5 to 7, on the premise of the same feature extraction, the recognition accuracy of the SVM classifier is the lowest, and recognition time is the longest. The other two classifiers include the cascade dictionary classifier designed in this paper and the classifier designed to construct the dictionary with the monogenic features of the samples. Their recognition rates are obviously higher than that designed by the dictionary directly generated with the image pixels. The recognition accuracy of the proposed method, method 3, and method 4 are all higher than that of SVM and KNN methods.A recognition method can not be considered superior to other methods if it requires a great deal of time to yield relatively small improvements. It can be seen from Figures6 and 7 that by comparing the results of method 4 with that of the proposed method, the recognition accuracy is slightly lower than that of the method 4. However, the average recognition time of method 4 is 19.14 seconds, while that of the proposed method is only 10.75 seconds, the recognition speed is obviously improved. The main reason is that about 86% of the samples are correctly identified at the first recognition and do not need to pass the rest of the dictionaries. In method 4, all the testing samples need to do transvection with all the atoms in the overcomplete dictionary, which obviously slows down the recognition speed.


## 4.1. Data Set Used for Experiments

The experimental data used herein is from the SAR ground still data of the SAR ground target high resolution provided by the Working Group of the United States DARPA/AFRL MSTAR. As a result of the SAR imaging, even if the target is same, the azimuth difference can cause the difference of the characteristic information, and the difference of the azimuth angle can cause the difference between the postimaging targets, because the training samples are required to contain all the imaging data at different angles. The SAR image data in the MSTAR database is comprehensive; the azimuth coverage of each target is from 0° to 360°. The experiment selects a subset of MSTAR database, including five types of SAR images: BRDM2, 2S1, T72, SLICY, and ZSU234. The imaging resolution of the image is0.3m×0.3m, and the azimuth range is from 0° to 360°. In the experiments, the imaging data at 17° are selected as the training samples, and the imaging data when the angle is 15° are used as the testing samples. Since some of the SAR images are noise polluted seriously from certain angle, the amount of images sample for every single target can be used is different. The amount of training samples and testing samples used in this experiment is shown in Table 1.Table 1
Experimental sample data set.
Target type
Training sample
Testing sample
BRDM2
298
274
2S1
299
274
T72
232
196
SLICY
299
288
ZSU234
299
274In order to compare efficiency of proposed method, we establish two characteristics as a comparison basis:(i) Recognition accuracy: proportion of the testing samples correctly recognized by the algorithm.(ii) Recognition time: the time it takes an algorithm to complete a given task.The experiment was conducted with Matlab-2012b 64bit, installed on windows 10 professional 64bit with an Intel Core i7 Processor (8MCache, up to 3.90 GHz), and 16 GB of RAM.


## 4.2. Recognition Performance Analysis

The monogenic features of each kind of sample images are extracted and drawn into column vectors to form three subdictionariesDii=1,2,3, concatenate the subdictionaries, and form a cascade classifier shown in Figure 4. For the testing samples, the region with 45×45 size of the target in the center of the image is also selected to realize the segmentation, and the recognition accuracy of each class of testing samples with the proposed method in this paper is shown in Table 2.Table 2
The recognition accuracy of the proposed method.
BRDM2
2S1
T72
SLICY
ZSU234
Total number of samples
274
274
196
288
274
Correct sample number of primary recognition
252
218
165
278
250
Primary recognition accuracy (%)
91.97
79.56
84.18
96.53
91.24
Correct sample number of voting recognition
11
42
20
5
10
Voting recognition accuracy (%)
4.01
15.33
10.20
1.73
3.65
Recognition accuracy (%)
95.98
94.89
94.38
98.26
94.89The correct sample of primary recognition refers to the samples that do not need to participate in the final voting mechanism recognition, and the correct sample of voting recognition refers to the samples that need to participate in the final voting mechanism recognition, that is, the samples that are missed in cascade recognition. Suppose the total number of samples isN, correct sample number of primary recognition is n1, and correct sample number of voting recognition is n2.
(25)Primaryrecognitionaccuracy=n1N×100%,(26)Votingrecognitionaccuracy=n2N×100%,(27)Recognitionaccuracy=n1+n2N×100%.As can be seen from Table2, in the design of the classifier, because the reconstruction error threshold is large, about 10% of the samples are missed in the first recognition. However, because of the existence of voting mechanism, this part of the missed samples has been correctly recognized at the time of the final vote.Additionally, in order to further assess the effectiveness of the proposed recognition method, this paper compared it with the other four methods including the traditional classifiers, such as the SVM recognition method (method 1), the KNN recognition method (method 2), the method with the dictionary directly generated by image pixels (method 3), and the method with the dictionary generated by G2DPCA features in [20] (method 4).In method 1, SVM is a small sample learning classification method, which has strong generalization ability. Nonlinear processing can be easily realized by introducing kernel function mapping. Suppose monogenic feature isx=x1,x2,⋯xM, where M is the number of categories of the samples. For the tagged training sets xi,yi,i=1,2,⋯,M, yi∈1,−1, SVM is to solve the following optimization problems.
(28)minw,b,η12wTw+C∑i=1KηisubjecttoyiwTfxi+b≥1−ηiηi≥0,where C is the penalty factor of the error term.Usually, RBF kernel function is used to map the training vector to high dimensional space.(29)Kxk,xg=φxkTφxg=exp−γxk−xg2>0,where γ is a nuclear factor. In this paper, the kernel function selected is ku,v=exp−γu−v, γ=5.In method 2, KNN is a simple and effective technique for objects classification according to the closest training examples in the feature space. KNN rates the neighbor of a test sequence among the training sample and uses the class labels of the nearest neighbor to predict the test vector class.For the tagged training setsxi,yi, yi∈1,−1, the Euclidean distance is often used as the distance metric to measure the similarity between two vectors.
(30)d2xi,xj=xi−xj2=∑k=1dxik−xjk2.Parameterk represents the number of neighbors in a set of training observations which are nearest to the given observation in validation or testing data set. Variation of this parameter will affect the accuracy of each binary classifier inside an expert. In this paper, parameter k=5.In method 3, the dictionary is constructed directly with the image pixels. In method 4, the dictionary is constructed directly with the G2DPCA feature.Experimental results, for each data set, are represented separately for all methods in Figure5; the graphical representations of average recognition accuracy and the recognition time are shown in Figures 6 and 7.Figure 5
Recognition accuracy of different recognition methods.Figure 6
Recognition accuracy of different recognition methods.Figure 7
Recognition time of different recognition methods.As can be seen from Figures5 to 7, on the premise of the same feature extraction, the recognition accuracy of the SVM classifier is the lowest, and recognition time is the longest. The other two classifiers include the cascade dictionary classifier designed in this paper and the classifier designed to construct the dictionary with the monogenic features of the samples. Their recognition rates are obviously higher than that designed by the dictionary directly generated with the image pixels. The recognition accuracy of the proposed method, method 3, and method 4 are all higher than that of SVM and KNN methods.A recognition method can not be considered superior to other methods if it requires a great deal of time to yield relatively small improvements. It can be seen from Figures6 and 7 that by comparing the results of method 4 with that of the proposed method, the recognition accuracy is slightly lower than that of the method 4. However, the average recognition time of method 4 is 19.14 seconds, while that of the proposed method is only 10.75 seconds, the recognition speed is obviously improved. The main reason is that about 86% of the samples are correctly identified at the first recognition and do not need to pass the rest of the dictionaries. In method 4, all the testing samples need to do transvection with all the atoms in the overcomplete dictionary, which obviously slows down the recognition speed.


## 5. Conclusion

In order to solve the problem of higher dimension and larger redundancy in constructing the dictionary with the training samples, this paper proposed a SAR image target recognition method based on monogenic signal and sparse representation. The main innovation points of this method is to train templates using EMACH filter, generate templates, construct cascade dictionary with the monogenic features of various templates, solve sparse representation coefficients of the testing samples with the proved orthogonal matching pursuit algorithm at each level of dictionary, and determine the category of the testing samples by the reconstruction error of the image. Through experimental results, we have demonstrated that the proposed SAR image target recognition method significantly improved the recognition speed in the precondition of ensuring the recognition rate. Comparison with the traditional dictionary directly generated by G2DPCA feature based on sparse representation indicated that the proposed SAR image recognition method was able to improve the overall accuracy by up to 0.65% and shorten recognition time by up to 43.83%.



---

*Source: 6630865-2021-01-18.xml*