An Efficient and Robust Framework for SAR Target Recognition by Hierarchically Fusing Global and Local Features

Recognition of Targets in SAR Images Based on a WVV Feature Using a Subset of Scattering Centers

This paper proposes a robust method for feature-based matching with potential for application to synthetic aperture radar (SAR) automatic target recognition (ATR). The scarcity of measured SAR data available for training classification algorithms leads to the replacement of such data with synthetic data. As attributed scattering centers (ASCs) extracted from the SAR image reflect the electromagnetic phenomenon of the SAR target, this is effective for classifying targets when purely synthetic SAR images are used as the template. In the classification stage, following preparation of the extracted template ASC dataset, some of the template ASCs were subsampled by the amplitude and the neighbor matching algorithm to focus on the related points of the test ASCs. Then, the subset of ASCs were reconstructed to the world view vector feature set, considering the point similarity and structure similarity simultaneously. Finally, the matching scores between the two sets were calculated using weighted bipartite graph matching and then combined with several weights for overall similarity. Experiments on synthetic and measured paired labeled experiment datasets, which are publicly available, were conducted to verify the effectiveness and robustness of the proposed method. The proposed method can be used in practical SAR ATR systems trained using simulated images.

Non-Cooperative SAR Automatic Target Recognition Based on Scattering Centers Models

This article proposes an Automatic Target Recognition (ATR) algorithm to classify non-cooperative targets in Synthetic Aperture Radar (SAR) images. The scarcity or nonexistence of measured SAR data demands that classification algorithms rely only on synthetic data for training purposes. Based on a model represented by the set of scattering centers extracted from purely synthetic data, the proposed algorithm generates hypotheses for the set of scattering centers extracted from the target under test belonging to each class. A Goodness of Fit test is considered to verify each hypothesis, where the Likelihood Ratio Test is modified by a scattering center-weighting function common to both the model and target. Some algorithm variations are assessed for scattering center extraction and hypothesis generation and verification. The proposed solution is the first model-based classification algorithm to address the recently released Synthetic and Measured Paired Labeled Experiment (SAMPLE) dataset on a 100% synthetic training data basis. As a result, an accuracy of 91.30% in a 10-target test within a class experiment under Standard Operating Conditions (SOCs) was obtained. The algorithm was also pioneered in testing the SAMPLE dataset in Extend Operating Conditions (EOCs), assuming noise contamination and different target configurations. The proposed algorithm was shown to be robust for SNRs greater than −5 dB.

Hierarchical Transmission Tower Detection from High-Resolution SAR Image

The small scale of transmission towers and the environmental diversity around their situations make their detection in Synthetic Aperture Radar (SAR) images a challenging task. This paper presents a new hierarchical detection algorithm for transmission towers. First, Signal-to-Clutter Ratios (SCRs) of pixels are calculated. Afterwards, a SCR threshold is set. Since transmission towers possess strong scattering characteristics, pixels with SCRs above the threshold are considered as potential transmission tower pixels. Second, spatial densities of potential transmission tower pixels are calculated. According to the aggregation characteristics of transmission tower pixels, some potential transmission tower pixels with small spatial densities are removed. The remained potential transmission tower pixels are considered as candidate transmission tower pixels. The candidate transmission tower pixels are grouped by the nearest neighbour scheme such that in each group the distance between pixels is under a given threshold. Thus, each of the groups is viewed as a quasi-transmission tower. Convex-hulls of quasi-transmission towers are built, and then Minimum Bounding Rectangle (MBR) for each convex-hull is generated. According to the rectangle aspect ratios of MBRs, the real transmission towers are extracted. C-band HH-polarization GaoFen-3 (GF-3) amplitude images are used for experiments and four of the most popular transmission tower detection algorithms are selected as comparing algorithms to validate the proposed algorithms. The detection performance of transmission towers is evaluated with detection rate and quality factor. Experimental results verify that the proposed algorithm can efficiently and accurately detect transmission towers while maintaining the transmission tower geometry to a certain extent, which indicates that the proposed algorithm is efficient and promising.

Rotation Awareness Based Self-Supervised Learning for SAR Target Recognition With Limited Training Samples

The scattering signatures of a synthetic aperture radar (SAR) target image will be highly sensitive to different azimuth angles/poses, which aggravates the demand for training samples in learning-based SAR image automatic target recognition (ATR) algorithms, and makes SAR ATR a more challenging task. This paper develops a novel rotation awareness-based learning framework termed RotANet for SAR ATR under the condition of limited training samples. First, we propose an encoding scheme to characterize the rotational pattern of pose variations among intra-class targets. These targets will constitute several ordered sequences with different rotational patterns via permutations. By further exploiting the intrinsic relation constraints among these sequences as the supervision, we develop a novel self-supervised task which makes RotANet learn to predict the rotational pattern of a baseline sequence and then autonomously generalize this ability to the others without external supervision. Therefore, this task essentially contains a learning and self-validation process to achieve human-like rotation awareness, and it serves as a task-induced prior to regularize the learned feature domain of RotANet in conjunction with an individual target recognition task to improve the generalization ability of the features. Extensive experiments on moving and stationary target acquisition and recognition benchmark database demonstrate the effectiveness of our proposed framework. Compared with other state-of-the-art SAR ATR algorithms, RotANet will remarkably improve the recognition accuracy especially in the case of very limited training samples without performing any other data augmentation strategy.

Hierarchical Image Segmentation Based on Nonsymmetry and Anti-Packing Pattern Representation Model

Image segmentation is the foundation of high-level image analysis and image understanding. How to effectively segment an image into regions that are "meaningful" to the human visual perception and ensure that the segmented regions are consistent at different resolutions is still a very challenging issue. Inspired by the idea of the Nonsymmetry and Anti-packing pattern representation Model in the Lab color space (NAMLab) and the "global-first" invariant perceptual theory, in this paper, we propose a novel framework for hierarchical image segmentation. Firstly, by defining the dissimilarity between two pixels in the Lab color space, we propose an NAMLab-based color image representation approach that is more in line with the human visual perception characteristics and can make the image pixels fast and effectively merge into the NAMLab blocks. Then, by defining the dissimilarity between two NAMLab-based regions and iteratively executing NAMLab-based merging algorithm of adjacent regions into larger ones to progressively generate a segmentation dendrogram, we propose a fast NAMLab-based algorithm for hierarchical image segmentation. Finally, the complexities of our proposed NAMLab-based algorithm for hierarchical image segmentation are analyzed in details. The experimental results presented in this paper show that our proposed algorithm when compared with the state-of-the-art algorithms not only can preserve more details of the object boundaries, but also it can better identify the foreground objects with similar color distributions. Also, our proposed algorithm can be executed much faster and takes up less memory and therefore it is a better algorithm for hierarchical image segmentation.