# Block Sparse Bayesian Learning over Local Dictionary for Robust SAR Target Recognition

Authors: Chenyu Li; Guohua Liu
Journal: International Journal of Optics
 (2020)

---

## Abstract

This paper applied block sparse Bayesian learning (BSBL) to synthetic aperture radar (SAR) target recognition. The traditional sparse representation-based classification (SRC) operates on the global dictionary collaborated by different classes. Afterwards, the similarities between the test sample and various classes are evaluated by the reconstruction errors. This paper reconstructs the test sample based on local dictionaries formed by individual classes. Considering the azimuthal sensitivity of SAR images, the linear coefficients on the local dictionary are sparse ones with block structure. Therefore, to solve the sparse coefficients, the BSBL is employed. The proposed method can better exploit the representation capability of each class, thus benefiting the recognition performance. Based on the experimental results on the moving and stationary target acquisition and recognition (MSTAR) dataset, the effectiveness and robustness of the proposed method is confirmed.


---

## Body

## 1. Introduction

Synthetic aperture radar (SAR) has been used in Earth observations since it was first developed. Automatic target recognition (ATR) is a special application in SAR image interpretation, which aims to analyze the interested targets in images and determine their labels. Since the start in 1990s, SAR ATR methods have been studied widely using feature extraction and classification algorithms [1, 2]. Different types of features were applied to SAR ATR including geometrical, transformation, and electromagnetic features. Target contour, region, shadow, etc. are typical geometrical features, which describe the sizes or shape distributions [3–12]. Ding et al. developed a matching algorithm of binary target regions for SAR ATR [3], which was further improve by Cui et al. using the Euclidean distance transform [4]. The Zernike and Krawtchouk moments were employed to describe the target regions in [5, 6], respectively. Anagnostopoulos extracted the outline descriptors for SAR target recognition [7]. Papson validated the utility of target shadow for SAR ATR [8]. The transformation features were usually obtained in mathematical or signal processing ways. The mathematical tools include principal component analysis (PCA) [13], kernel PCA (KPCA) [14], and nonnegative matrix factorization (NMF) [15]. In addition, some newly proposed manifold learning methods were demonstrated effective for SAR ATR [16–19]. Image decomposition tools including wavelet [20], monogenic signal [21, 22], and empirical mode decomposition (EMD) [23, 24] were adopted in SAR ATR with good performance. The scattering center is the typical scattering feature with several applications in SAR ATR [25–31]. A Bayesian matching scheme of attributed scattering centers was developed in [26] for target recognition. Ding et al. used the attributed scattering centers as the basic features and proposed several classification schemes [27, 28]. Zhang proposed a noise-robust method using attributed scattering centers [29]. Furthermore, the attributed scattering centers were employed to partially reconstruct the target to enrich the available training samples [30, 31]. In addition to the use of single-type features, many multifeature SAR ATR methods were designed in the present works [32–36].The classification algorithms were mainly introduced from the pattern recognition fields. The famous classifiers including support vector machine (SVM) [37, 38], adaptive boosting (AdaBoost) [39], and sparse representation-based classification (SRC) [40–42], were successfully applied to SAR ATR. SVM was first used by Zhao and Principe for SAR target recognition [37]. After then, SVM has been the most popular classifier to classify different kinds of features for SAR ATR [3, 5, 38]. Sun et al. developed the AdaBoost for SAR target recognition, which enhanced the classification performance by boosting several simple classifiers [39]. Based on the compressive sensing theory, SRC was first validated in face recognition [43] and further used in SAR ATR in many related works [40–42]. With the progress in deep learning, many novel networks were developed for SAR target recognition [44–59], in which the convolutional neural network (CNN) is the mostly used. Network architectures including the all-convolutional neural networks (A-ConvNets) [46], enhanced squeeze and excitation network (ESENet) [47], gradually distilled CNN [48], cascade coupled CNN [49], and multistream CNN [50], were developed and applied. Other works enriched the effective training samples using transfer learning, data augmentation, and so forth, thus improving the classification ability of the networks [51–53]. However, the performance of deep learning models has close relation to the scale of the training set. With scarce training SAR images, the final performance will be significantly impaired.This paper proposes a novel classification scheme for SAR target recognition by improving traditional SRC. SRC performs linear representation of the test sample over the global dictionary established based on all the training samples. The reconstruction errors from different classes are analyzed to obtain the target label afterwards. In essence, the relative representation capabilities are compared in SRC but the absolute representation capability of each class is not exploited fully. Therefore, this paper represents the test sample over the local dictionaries from individual training classes. Therefore, the capability of each class can be fully investigated as for describing and representing the input sample. Considering the azimuthal sensitivity of SAR images [60, 61], the test sample is only related to those training samples, which share similar azimuths with it. When the atoms in the local dictionary are sorted according to the azimuths, the linear coefficients over the local dictionary are sparse ones with block structure; i.e., the nonzero elements accumulate in a small azimuth interval. Accordingly, the block sparse Bayesian learning (BSBL) [62] is employed to solve the sparse coefficients on the local dictionary, which could exploit the block structure with higher precision. Finally, the reconstruction errors of individual classes are analyzed to determine the target type. To investigate the performance of the proposed method, the moving and stationary target acquisition and recognition (MSTAR) dataset is employed for test and comparison. The results validate the superiority of the proposed method under the standard operating condition (SOC) and typical extended operating conditions (EOC).


## 2. SRC

SRC can be regarded as a modification of the linear representation problem with the idea of compressive sensing [40–43]. For the sample to be classified, it is represented over the global dictionary comprising of all the training samples while the linear coefficients are sparse with only a few nonzero ones. The global dictionary is denoted as A=A1,A2,…,AC∈Rd×N, in which Ai∈Rd×Ni is a local dictionary with Ni atoms of the ith class. For the test sample y, the reconstruction process is illustrated as follows:(1)x^=argminx0,s.t.y−Ax22≤ε,where x^ denotes the solved coefficient vector.With the solution ofx^, the target label of y is determined by calculating the reconstruction errors of different classes and comparing them as follows:(2)Labely=argminiy−Aδix^2,where δix^ extracts the coefficient vector of the ith class.In SRC, the representation errors actually embody the relative capabilities of reconstructing the test sample for different classes. However, the absolute representation capability of each class cannot be effectively exploited. In other words, how could individual classes best reconstruct the test sample should be further evaluated.


## 3. Block Sparse Bayesian Learning over Local Dictionary

### 3.1. Sparse Representation over Local Dictionary

Rather than the representation over the global dictionary, this paper represents the test sample on the local dictionary as follows:(3)y=Aixi+εik,i=1,…,C,where xi denotes the linear coefficient vector over the ith local dictionary and εi is the reconstruction error.Figure1 illustrates four SAR images of BMP2 target from the MSTAR dataset, which are measured at different azimuths. As shown, SAR images of the same target from notably different azimuths have obviously distinct appearances. Because SAR images are sensitive to the azimuth changing, only those training samples (atoms in the dictionary) with approaching azimuths to that of the test sample are useful in the linear reconstruction. By arranging the atoms in the local dictionary in the descending (or ascending) manner, the nonzero elements in xi tend to amass in a small azimuth interval. So, the resulting xi is a sparse vector with the block structure. To better reconstruct the test sample, BSBL is employed to estimate xi, which is demonstrated more suitable for the reconstruction of block sparse signals [62].Figure 1
SAR images of the same target from different azimuths: (a) 5°; (b) 20°; (c) 80°; (d) 300°.
(a)(b)(c)(d)Compared with the traditionally global dictionary-based SRC, the sparse representation over the local dictionary could further exploit the representation abilities of the training classes. The reconstruction error in (2) reflects the absolute representation capability of the ith class as for representing the test sample y. In addition, with the constraint of azimuthal sensitivity during the linear representation, the reconstruction errors from different targets can be used to make reliable decisions on the target label.


### 3.2. BSBL Framework

Assumingx as a block sparse signal, it contains the block structures as follows:(4)x=x1,...,xd1︸x1T,...,x1,...,xdg︸xgTT.The signalx in the previous equation has g blocks among which only a few ones are nonzero. Here, di denotes the length of the ith block. Usually, the samples in the same block are closely related. To describe the block structure as well as the intrablock correlation, the BSBL framework [62] employs the parameterized Gaussian distribution:(5)pxi;γ,iBi=Nxi;0,Bi.In the previous equation,γi and Bi are unknown deterministic parameters in which γi represents the confidence of the relevance of the ith block and Bi captures the intrablock correlation. Assuming that different blocks are mutually independent, then the signal model can be rewritten as the following equation:(6)pxi;γi,Bi=Nxi;0,Γ,where Γ is a block diagonal matrix in which the ith principal diagonal is γiBi.The observationy is modeled as the following equationfd7:(7)y=Φx+n,where Φ is a M×N sensing matrix and n denotes the noise term. The sensing matrix Φ is an underdetermined matrix and the noise is modeled as a zero-mean Gaussian distribution with and variance of β−1 with β being an unknown parameter. Therefore, the likelihood is given by(8)pxiγ;iβ=NΦx,β−1.The main body of the BSBL algorithm iterates between the estimation of the posteriorpxiy;{γ,iB}i,β=Nμ,Σ with Σ≜Γ−1+ΦTβΦ−1, μ≜ΣΦTβy and maximizing the likelihood C≜β−1I+ΦTΓΦ with Σ≜Γ−1+ΦTβΦ−1. The update rules for the parameters γi,Bi and β are derived using the Type II Maximum Likelihood method, which leads to the following cost function:(9)Lγ,iBi,β=logC+yTCy.Based on the estimations of the parametersγ,iBi and β, the MAP estimates the coefficient vector x as follows:(10)x^=ΣΦTβy.


### 3.3. Target Recognition

By solving the block sparse coefficients on local dictionaries, respectively, the reconstruction error of each training class is obtained as follows:(11)ri=y−Aix^i2,i=1,…,C,where x^i is the solved coefficient vector over the ith local dictionary by BSBL. Afterwards, the target label is determined to the minimum-error class as (2).Figure2 illustrates the main idea of the proposed method. During the implementation, PCA is performed as a feature extraction step for both training and test samples and the detailed steps summarized as follows:Step 1: Arrange the training samples of each class according to their azimuths in an ascending orderStep 2: Represent the test sample on the local dictionaries using BSBLStep 3: Reconstruct the test sample with different classes to obtain the residualsStep 4: Make the classification decision according to the minimum errorFigure 2
Procedure of SAR target recognition based on BSBL over local dictionaries.


## 3.1. Sparse Representation over Local Dictionary

Rather than the representation over the global dictionary, this paper represents the test sample on the local dictionary as follows:(3)y=Aixi+εik,i=1,…,C,where xi denotes the linear coefficient vector over the ith local dictionary and εi is the reconstruction error.Figure1 illustrates four SAR images of BMP2 target from the MSTAR dataset, which are measured at different azimuths. As shown, SAR images of the same target from notably different azimuths have obviously distinct appearances. Because SAR images are sensitive to the azimuth changing, only those training samples (atoms in the dictionary) with approaching azimuths to that of the test sample are useful in the linear reconstruction. By arranging the atoms in the local dictionary in the descending (or ascending) manner, the nonzero elements in xi tend to amass in a small azimuth interval. So, the resulting xi is a sparse vector with the block structure. To better reconstruct the test sample, BSBL is employed to estimate xi, which is demonstrated more suitable for the reconstruction of block sparse signals [62].Figure 1
SAR images of the same target from different azimuths: (a) 5°; (b) 20°; (c) 80°; (d) 300°.
(a)(b)(c)(d)Compared with the traditionally global dictionary-based SRC, the sparse representation over the local dictionary could further exploit the representation abilities of the training classes. The reconstruction error in (2) reflects the absolute representation capability of the ith class as for representing the test sample y. In addition, with the constraint of azimuthal sensitivity during the linear representation, the reconstruction errors from different targets can be used to make reliable decisions on the target label.


## 3.2. BSBL Framework

Assumingx as a block sparse signal, it contains the block structures as follows:(4)x=x1,...,xd1︸x1T,...,x1,...,xdg︸xgTT.The signalx in the previous equation has g blocks among which only a few ones are nonzero. Here, di denotes the length of the ith block. Usually, the samples in the same block are closely related. To describe the block structure as well as the intrablock correlation, the BSBL framework [62] employs the parameterized Gaussian distribution:(5)pxi;γ,iBi=Nxi;0,Bi.In the previous equation,γi and Bi are unknown deterministic parameters in which γi represents the confidence of the relevance of the ith block and Bi captures the intrablock correlation. Assuming that different blocks are mutually independent, then the signal model can be rewritten as the following equation:(6)pxi;γi,Bi=Nxi;0,Γ,where Γ is a block diagonal matrix in which the ith principal diagonal is γiBi.The observationy is modeled as the following equationfd7:(7)y=Φx+n,where Φ is a M×N sensing matrix and n denotes the noise term. The sensing matrix Φ is an underdetermined matrix and the noise is modeled as a zero-mean Gaussian distribution with and variance of β−1 with β being an unknown parameter. Therefore, the likelihood is given by(8)pxiγ;iβ=NΦx,β−1.The main body of the BSBL algorithm iterates between the estimation of the posteriorpxiy;{γ,iB}i,β=Nμ,Σ with Σ≜Γ−1+ΦTβΦ−1, μ≜ΣΦTβy and maximizing the likelihood C≜β−1I+ΦTΓΦ with Σ≜Γ−1+ΦTβΦ−1. The update rules for the parameters γi,Bi and β are derived using the Type II Maximum Likelihood method, which leads to the following cost function:(9)Lγ,iBi,β=logC+yTCy.Based on the estimations of the parametersγ,iBi and β, the MAP estimates the coefficient vector x as follows:(10)x^=ΣΦTβy.


## 3.3. Target Recognition

By solving the block sparse coefficients on local dictionaries, respectively, the reconstruction error of each training class is obtained as follows:(11)ri=y−Aix^i2,i=1,…,C,where x^i is the solved coefficient vector over the ith local dictionary by BSBL. Afterwards, the target label is determined to the minimum-error class as (2).Figure2 illustrates the main idea of the proposed method. During the implementation, PCA is performed as a feature extraction step for both training and test samples and the detailed steps summarized as follows:Step 1: Arrange the training samples of each class according to their azimuths in an ascending orderStep 2: Represent the test sample on the local dictionaries using BSBLStep 3: Reconstruct the test sample with different classes to obtain the residualsStep 4: Make the classification decision according to the minimum errorFigure 2
Procedure of SAR target recognition based on BSBL over local dictionaries.


## 4. Experiment

### 4.1. Preparation

With volumes of measured SAR images, MSTAR dataset has long been used on the examinations of target recognition algorithms. As shown, SAR images of the 10 targets in Figure3 are available in the dataset, collected by X-band radar with the resolution of 0.3 m (cross range) × 0.3 m (range). Samples for each target cover 0°∼360° aspect angles in both training and test sets. Accordingly, several experimental conditions could be set up to test the SAR ATR methods including SOC and EOCs.Figure 3
Optical images of MSTAR targets. (a) BMP2. (b) BTR70. (c) T72. (d) T62. (e) BRDM2. (f) BTR60. (g) ZSU23/4. (h) D7. (i) ZIL131. (j) 2SI.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)Several reference methods are chosen from the current works to be compared with the proposed method including SVM [37], AdaBoost [39], SRC [40], and A-ConvNet [46]. These methods aimed to improve the performance by updating the classification schemes. For SVM, AdaBoost, and SRC, they also performed on the PCA feature vectors, which are consistent with the proposed method for fair comparison. A-ConvNet was a CNN-based method, which was trained by the original image pixels. All these methods are performed by the authors on the same hardware platform with the proposed one.


### 4.2. Recognition Results

In the following experiments, the SOC is first set up for classification. Afterwards, three different EOCs are set up including configuration variances, depression angle variances, and noise corruption. Simultaneously, the four reference methods are tested and compared with the proposed one.


#### 4.2.1. Recognition under SOC

The conditions for the SOC experiment are set up as in Table1, which include the 10 classes of targets in Figure 3. Overall, the training and test samples are assumed to share high similarities. Specifically, the test samples of BMP2 and T72 include two different configurations from their training sets (denoted by the serial number). The classification results of this method in this case are obtained as in Figure 4, which is displayed as a confusion matrix. As shown, the correct recognition rates of different classes are higher than 97% recorded in the diagonal. As an overall evaluation, the average rate of the correct recognition (ARcr) reaches 98.76%. Table 2 compares ARcrs of the proposed method and the reference ones. It reflects that the result of A-ConvNet is slightly lower than the proposed method owing to the good classification of deep learning models. In comparison with SRC, the recognition performance is greatly enhanced by the proposed method, which validates the effectiveness of BSBL as a classification scheme. With the highest ARcr, the proposed method achieves the best effectiveness under SOC.Table 1
Training and test samples under SOC.
ClassTraining set (17°)Test set (15°)Configuration (SN)Number of samplesConfiguration (SN)Number of samplesBMP2956323395631959566196C21196BTR70—233—196T72132232132195812195S7191T62—299—273BDRM2—298—274BTR60—256—195ZSU23/4—299—274D7—299—274ZIL131—299—2742S1—299—274Figure 4
The confusion matrix of the proposed method on 10 classes of targets under SOC.Table 2
Performance of methods under SOC.
Method typeProposedSVMSRCAdaBoostA-ConvNetARcr(%)98.7696.0294.6695.4898.52


#### 4.2.2. Recognition under EOCs

Different from the SOC situations, EOCs are common to see in real applications because of the variations of target, background, sensors, etc. As reported in the current literatures, the MSTAR dataset can be employed to set up several different EOCs with regard to target configurations, depression angles, and noises. In the following, the proposed method is tested under the three typical EOCs, respectively.


## 4.1. Preparation

With volumes of measured SAR images, MSTAR dataset has long been used on the examinations of target recognition algorithms. As shown, SAR images of the 10 targets in Figure3 are available in the dataset, collected by X-band radar with the resolution of 0.3 m (cross range) × 0.3 m (range). Samples for each target cover 0°∼360° aspect angles in both training and test sets. Accordingly, several experimental conditions could be set up to test the SAR ATR methods including SOC and EOCs.Figure 3
Optical images of MSTAR targets. (a) BMP2. (b) BTR70. (c) T72. (d) T62. (e) BRDM2. (f) BTR60. (g) ZSU23/4. (h) D7. (i) ZIL131. (j) 2SI.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)Several reference methods are chosen from the current works to be compared with the proposed method including SVM [37], AdaBoost [39], SRC [40], and A-ConvNet [46]. These methods aimed to improve the performance by updating the classification schemes. For SVM, AdaBoost, and SRC, they also performed on the PCA feature vectors, which are consistent with the proposed method for fair comparison. A-ConvNet was a CNN-based method, which was trained by the original image pixels. All these methods are performed by the authors on the same hardware platform with the proposed one.


## 4.2. Recognition Results

In the following experiments, the SOC is first set up for classification. Afterwards, three different EOCs are set up including configuration variances, depression angle variances, and noise corruption. Simultaneously, the four reference methods are tested and compared with the proposed one.


### 4.2.1. Recognition under SOC

The conditions for the SOC experiment are set up as in Table1, which include the 10 classes of targets in Figure 3. Overall, the training and test samples are assumed to share high similarities. Specifically, the test samples of BMP2 and T72 include two different configurations from their training sets (denoted by the serial number). The classification results of this method in this case are obtained as in Figure 4, which is displayed as a confusion matrix. As shown, the correct recognition rates of different classes are higher than 97% recorded in the diagonal. As an overall evaluation, the average rate of the correct recognition (ARcr) reaches 98.76%. Table 2 compares ARcrs of the proposed method and the reference ones. It reflects that the result of A-ConvNet is slightly lower than the proposed method owing to the good classification of deep learning models. In comparison with SRC, the recognition performance is greatly enhanced by the proposed method, which validates the effectiveness of BSBL as a classification scheme. With the highest ARcr, the proposed method achieves the best effectiveness under SOC.Table 1
Training and test samples under SOC.
ClassTraining set (17°)Test set (15°)Configuration (SN)Number of samplesConfiguration (SN)Number of samplesBMP2956323395631959566196C21196BTR70—233—196T72132232132195812195S7191T62—299—273BDRM2—298—274BTR60—256—195ZSU23/4—299—274D7—299—274ZIL131—299—2742S1—299—274Figure 4
The confusion matrix of the proposed method on 10 classes of targets under SOC.Table 2
Performance of methods under SOC.
Method typeProposedSVMSRCAdaBoostA-ConvNetARcr(%)98.7696.0294.6695.4898.52


### 4.2.2. Recognition under EOCs

Different from the SOC situations, EOCs are common to see in real applications because of the variations of target, background, sensors, etc. As reported in the current literatures, the MSTAR dataset can be employed to set up several different EOCs with regard to target configurations, depression angles, and noises. In the following, the proposed method is tested under the three typical EOCs, respectively.


## 4.2.1. Recognition under SOC

The conditions for the SOC experiment are set up as in Table1, which include the 10 classes of targets in Figure 3. Overall, the training and test samples are assumed to share high similarities. Specifically, the test samples of BMP2 and T72 include two different configurations from their training sets (denoted by the serial number). The classification results of this method in this case are obtained as in Figure 4, which is displayed as a confusion matrix. As shown, the correct recognition rates of different classes are higher than 97% recorded in the diagonal. As an overall evaluation, the average rate of the correct recognition (ARcr) reaches 98.76%. Table 2 compares ARcrs of the proposed method and the reference ones. It reflects that the result of A-ConvNet is slightly lower than the proposed method owing to the good classification of deep learning models. In comparison with SRC, the recognition performance is greatly enhanced by the proposed method, which validates the effectiveness of BSBL as a classification scheme. With the highest ARcr, the proposed method achieves the best effectiveness under SOC.Table 1
Training and test samples under SOC.
ClassTraining set (17°)Test set (15°)Configuration (SN)Number of samplesConfiguration (SN)Number of samplesBMP2956323395631959566196C21196BTR70—233—196T72132232132195812195S7191T62—299—273BDRM2—298—274BTR60—256—195ZSU23/4—299—274D7—299—274ZIL131—299—2742S1—299—274Figure 4
The confusion matrix of the proposed method on 10 classes of targets under SOC.Table 2
Performance of methods under SOC.
Method typeProposedSVMSRCAdaBoostA-ConvNetARcr(%)98.7696.0294.6695.4898.52


## 4.2.2. Recognition under EOCs

Different from the SOC situations, EOCs are common to see in real applications because of the variations of target, background, sensors, etc. As reported in the current literatures, the MSTAR dataset can be employed to set up several different EOCs with regard to target configurations, depression angles, and noises. In the following, the proposed method is tested under the three typical EOCs, respectively.


## 5. Configuration Variance

The military vehicles usually have several different variants, which have structural modifications. The training and test samples under configuration variance are set up as in Table3 with four targets to be classified. Among them, BDRM2 and BTR70 are placed in the training set but with no test samples in order to enhance the classification difficulties. The test configurations of BMP2 and T72 are totally different from the counterparts in their training samples. Figure 5 illustrates four different configurations of T72. As observed, they share similar global appearances but have some local differences. Table 4 gives the assigned labels of all the test samples of BMP2 and T72. Each configuration from BMP2 and T72 can be correctly recognized with an accuracy over 96% and ARcr reaches 97.18%. ARcrs of different methods with regard to configuration variance are compared in Table 5. With the highest ARcr, the superior robustness of the proposed method over the reference methods can be validated. Specifically, in comparison with traditional SRC, the proposed method noticeably improves ARcr with a large margin, which demonstrated the high effectiveness of BSBL.Table 3
Training and test samples under configuration variance.
ClassTraining set (17°)Test set (15°, 17°)Configuration (SN)Number of samplesConfiguration (SN)Number of samplesBMP295632339566428C21429BTR70—233—0T72132232812426A04573A05573A07573A10567BDRM2—298—0Figure 5
Illustrations of configuration variances in T72. (a) Optical. (b) SAR.
(a)(b)Table 4
Results of the proposed method under configuration variance.
ClassSNBMP2BRDM2BTR70T72Recognition rate (%)BMP2956641643597.20C2141382696.27T7281253441497.18A0468855196.16A05122255797.21A07821055397.21A10125055097.00ARcr97.18Table 5
Performance of methods with regard to configuration variance.
Method typeProposedSVMSRCAdaBoostA-ConvNetARcr (%)97.1896.0294.6695.4898.52


## 6. Depression Angle Variance

When SAR images are measured from a depression angles notably different from the corresponding training sample, they have many differences although from the same azimuth. The training and test samples under large depression angle variances are set up as in Table6 with three different targets. The training samples are combined by SAR images of three targets at 17° depression angle but the test set is comprised by two subsets from 30° and 45°, respectively. Figure 6 illustrates SAR images from the three different depression angles, respectively, in which their differences can be intuitively observed.Table 6
Training and test samples under large depression angle variance.
ClassTraining setTest setDepressionNumber of samplesDepressionNumber of samples2S117°29930°28845°303BDRM217°29830°28745°303ZSU23/417°29930°28845°303Figure 6
SAR images at different depression angles: (a) 17°; (b) 30°; and (c) 45°.
(a)(b)(c)Table7 compares ARcrs of the five methods at the two test depression angles, respectively. At 30°, these methods maintain higher ARcrs than 94%. However, at 45° depression angle, ARcr of each method degrades significantly below 73%. In comparison, the highest ARcrs at both depression angles are achieved by the proposed method, showing its better robustness to large depression angle variances. ARcr of A-ConvNet decreases greatly at 45° depression angle as the training set could hardly reflect and describe the situations occurring in the test samples. As a result, the trained networks lose its high validity. Compared with traditional SRC, BSBL over the local dictionaries effectively improve the final performance.Table 7
Performance of methods with regard to large depression angle variance.
Method typeARcr(%)30°45°Proposed97.3272.25SVM95.4263.24SRC95.0166.24AdaBoost94.9562.92A-ConvNet95.6765.82


## 7. Noise Corruption

Noises are common in measured SAR images, which cause obstacles to correct target recognition. In the previous works, two types of noises are used to simulate noisy SAR images for classification, for example, additive Gaussian noises [63] and random noises [46]. Figure 7 shows exemplar SAR images with random noises. Some of the original pixels are replaced with randomly high values according to the noise level. At each noise level, the performance of different methods is tested and the results are plotted in Figure 8. As shown, the proposed method gets the highest ARcr at each noise level, showing its superior robustness to noise corruption. As a compressive sensing algorithm, BSBL has better robustness to noises. Similarly, SRC generally achieved better performance than SVM, AdaBoost, and A-ConvNet under noise corruption. Compared with traditional SRC, BSBL contributes to the better performance of the proposed method.Figure 7
Performance of methods with regard to random noise corruption.Figure 8
SAR images with random noises: (a) original; (b) 5%; (c) 10%; (d) 15%; (e) 20%.
(a)(b)(c)(d)(e)


## 8. Conclusion

BSBL is applied to SAR target recognition in this paper, which is performed on local dictionaries. For each training class, it produces a reconstruction error for the test sample based on the solution form BSBL. These reconstruction errors fully exploit the representation capability of different classes, which can be used to judge the target label. As the azimuthal sensitivity, the linear coefficients generated for the test sample over local dictionary are block sparse ones; thus BSBL is more suitable for solution. From the results on the MSTAR dataset, the proposed method could achieveARcr of 98.76% for 10 classes under SOC and 97.18% under configuration variance. ARcrs at depression angles of 30° and 45° are 97.32% and 72.85%, respectively. The robustness under random noise corruption also defeats the four reference methods. All these comparisons show the superior performance of the proposed method.



---

*Source: 5464010-2020-08-01.xml*