Spectrum resources play a key supporting role in the communication system and are the basic guarantee for the normal operation of the communication system. In mobile communication and the Internet of Things scenarios, efficient coordination of spectrum resources is a necessary process for the communication process to exert its effectiveness. However, although the traditional central model-based spectrum resource allocation method has the advantages of global resource grasp and resource utilization, it may lead to a decrease in allocation efficiency due to frequent synchronization of spectrum resource demand, while the distributed spectrum resource allocation method faces the difficulties of local game and poor allocation effect. In view of this, this paper proposes a set of spectrum resource planning blockchain scheme based on a beneficial consensus mechanism, which gives full play to the planning ability of each device node while ensuring that the investment of computing power and other resources is effectively returned. This paper designs the formation of block cycle and equipment resource allocation process in the scheme, and analyzes the characteristics of the proposed scheme through four aspects: security, activity, complexity and adaptability, and finally relies on simulations to prove the effectiveness, feasibility and advantages of the proposed blockchain spectrum resource allocation scheme.

Deep learning-based synthetic aperture radar (SAR) automatic target recognition (ATR) have shown great potential recently, however, the performance of these methods is subject to the number of annotated samples. In real application scenarios, it tends to acquire limited number of samples due to the acquisition cost, in which case the exising ATR method is susceptible to over-fitting. To achieve SAR target recognition robustly in the case of limited samples, this paper proposes a global-local information interactive learning network. Specifically, we first develop a global-local interactive learning architecture, which is dedicated to extract global-local discriminative feature by interactively integrating the merits of local convolution and sparse self-attention. Then, a hierarchical feature discrimination module is proposed to improve intra-class compactness and inter-class divergence, thereby boosting the recognition performance of the ATR model. Evaluation experiments on the moving and stationary target acquisition and recognition (MSTAR) dataset illustrate that the proposed method is superior to advanced SAR ATR methods under the condition of limited samples.

In the problem of ship detection in complex scenes, in addition to the characteristics of ship targets, there is rich semantic information in the global and local background of the whole scenes, which provides more valuable inference information for ship detection. Therefore, in this paper, we propose a ship detection method in complex scenes considering both global and local information perception for SAR images. Firstly, the proposed method detects the globally stable region and the locally significant region respectively, and then designs a judgment method combining the two to eliminate false alarms, so as to ensure that the detected target has both globally stable characteristics and locally significant characteristics. The detection performance of the proposed method is verified by the spaceborne SAR images covering the coastal areas. The result shows that the proposed method can effectively detect ships in complex scenes, especially eliminating most false alarms in land areas.

Deep learning-based synthetic aperture radar (SAR) automatic target recognition (ATR) algorithms have achieved outstanding performance under the condition of hundreds or thousands of training samples in recent years. Nevertheless, it is often rare to acquire great quantities of target samples in real SAR application scenarios. This article proposes a novel ATR method called transductive prototypical attention reasoning network (TPARN) to solve the problem of SAR target recognition with only a few training samples. To be specific, a region awareness-based feature extraction model is first developed, which can effectively focus on the target region of interest and suppress the background clutter by embedding direction-aware and position-sensitive information to extract more transferable knowledge. To heighten the discrimination of the sample features, a cross-feature spatial attention module is then proposed following the feature embedding model. Finally, a transductive prototype reasoning method is presented to realize the identity reasoning of the target, which can continuously update each class prototype with training samples and test samples together, thereby improving the classification accuracy. In addition, a marginal adaptive hybrid loss is proposed to obtain a discriminative feature embedding space with intra-class compactness and inter-class divergence, aiming to facilitate subsequent target identity reasoning. Extensive experiments on the moving and stationary target acquisition and recognition (MSTAR) benchmark dataset reveal that the proposed method outperforms some state-of-the-arts under different few-shot SAR ATR tasks.

Data-driven automatic target recognition (ATR) methods have become the mainstream in the synthetic aperture radar (SAR) community at this stage. However, in real SAR application scenarios, the scarcity of training samples is a common problem. Especially in military application scenarios, only a small number of samples of each type of target are usually available. In the case of limited available samples, it is bound to bring challenges to the feature extraction model and classifier inference learning. In this paper, we propose a novel method called adaptive convolutional subspace reasoning network (ACSRNet) to address few-shot SAR target recognition tasks. To be specific, we first present a dynamic-aware convolutional feature embedding network based on the siamese architecture, which can not only learn more transferable knowledge for the few-shot tasks, but also dynamically adjust the convolution kernel according to the input data to extract more discriminative features. To effectively achieve target identity reasoning, we then resort to high-order information of samples, i.e., the idea of adaptive subspace learning, to develop a few-shot subspace classification module, which can online reason the identity of the unknown target through the spanning subspace of training samples. Meanwhile, a dual-loss is designed to train a feature embedding space with intra-class compactness and inter-class divergence, aiming to facilitate subsequent classification. Meta-learning integrating random sampling episode way is introduced into the process of model training to realize few-shot SAR ATR tasks by emulating the human cognitive process. Experimental results on the moving and stationary target acquisition recognition (MSTAR) dataset demonstrate that the proposed method is competitive with some state-of-the-arts for few-shot SAR ATR tasks.

This paper proposes a Bi -similarity prototypical network with capsule-based embedding to solve the problem of few-shot SAR target recognition. The proposed method comprises two procedures, i.e., feature embedding module and Bi-similarity reasoning module. Specifically, we build a feature embed-ding network with capsule operation, which can enable a feature embedding network to extract more informative features by effectively encoding relative spatial relationships between features. To reason the identity of target robustly, we develop a reasoning module based on Bi-similarity metric. Moreover, a mixed loss is proposed to train a discriminative representation space with both intra-class aggregation and inter-class separation. Experimental results on moving and stationary target acquisition and recognition (MSTAR) dataset show that the proposed method is effective and superior to some state-of-art methods in few-shot SAR target recognition tasks.

Sufficient training samples are prerequisite for most existing automatic target recognition (ATR) algorithms to obtain satisfactory recognition performance. Nevertheless, sometimes only a few samples are available in real synthetic aperture radar (SAR) application scenarios. Therefore, this paper proposes a Siamese subspace classification network to address the problem of SAR ATR with insufficient training samples. To be specific, the proposed method first establishes a feature embedding network based on Siamese structure, and leverages contrastive learning to train a low-dimensional representation space with both intra-class compactness and inter-class divergence. A subspace learning-based classifier is then designed to reason the identity of the target. Experimental results on moving and stationary target acquisition and recognition (MSTAR) benchmark data set demonstrate the effectiveness and superiority of the proposed method.

Deep learning-based automatic target recognition (ATR) methods can perform well with sufficient training samples, yet their performance will degrade significantly when the number of training samples available is quite small. Therefore, this paper proposes a multi-task representation learning network to achieve few-shot synthetic aperture radar (SAR) target recognition. On the one hand, the proposed network can perceive the input transformation, identity itself and class discrimination simultaneously. On the other hand, the proposed network can also extract the morphological features of the target and realize the feature refinement by channel attention mechanism. The powerful feature learning ability of the proposed network provides a guarantee for feature extraction under the condition of a few samples. Experiments on moving and stationary target acquisition and recognition (MSTAR) data set validate the effectiveness of the proposed network.

The ambiguity function (AF) of the transmit waveform is an important reflection for cognitive radar detection system performance, and spectral coexistence is equally critical in the current frequency-congested electromagnetic environment. In this paper, a joint optimization metric related to AF and energy spectral density (ESD) is considered to improve the probability of target detection, which is accomplished by designing the radar transmit waveform. Additionally, the unimodular constraint limited by the radar transmitter is imposed on the transmit waveform. To handle the resulting nonconvex problem, an iterative optimization procedure with a closed-form solution is developed leveraging the iterative sequential quadratic optimization (ISQO) framework. Numerical simulation results are provided to demonstrate the effectiveness of the proposed approach.

Deep learning has attracted intensive attention in synthetic aperture radar (SAR) automatic target recognition (ATR). Usually, a considerable number of labeled samples are necessary to learn a deep model for obtaining good generalization capability. However, the process of sample labeling is time-consuming and costly. This letter proposes an active self-paced deep learning (ASPDL) approach to SAR ATR. In a nutshell, we first introduce the Bayesian inference into the process of deep model parameter optimization, aiming at learning a robust classification model in the case of a limited number of labeled samples. Next, a cost-effective sample selection strategy is presented to iteratively and actively select the informative samples from a pool of unlabeled samples for labeling. Concretely, high-confidence samples are actively selected through self-paced learning (SPL) way and automatically pseudo-labeled with the current classification model, whereas low-confidence samples are chosen through an active learning strategy and manually labeled. Finally, we update the parameters of the model by minimizing a dual-loss function using a new training set that is constructed by incorporating new labeled samples with original ones. Experiments on the moving and stationary target acquisition and recognition (MSTAR) benchmark data demonstrate that the proposed method can achieve better classification accuracy with relatively few labeled samples compared with some state-of-the-art methods.

In this paper, a class-oriented local structure preserving dictionary learning (CLPDL) algorithm is developed for synthetic aperture radar (SAR) target recognition. Unlike most sparse representation algorithms whose sparse model is predefined via dictionary with atoms being training samples themselves, class-oriented dictionary leaning can derive multiple class-dictionary from training set. To preserve data local structure, a local weighted constraint, i.e., Tikhonov regularization, is introduced into the dictionary learning procedure, which is very helpful for certain challenging scenarios such as configuration recognition and large depression variations. Moreover, to reduce the influence of target aspect sensitivity of SAR image on target recognition, the query sample is represented as a linear combination of class-dictionary to eliminate disturbances. Experimental results on the moving and stationary target acquisition and recognition (MSTAR) database demonstrate the validity of the proposed method.

Attention model and saliency detection has been widely researched in computer vision. This paper contributes to present a novel saliency-based detection algorithm for synthetic aperture radar (SAR) interpretation. Firstly, the input image is segmented into superpixels by simple linear iterative cluster (SLIC) process. Secondly, three features maps are created based on standard deviation, peak value and comparison with background, respectively, and the final saliency map is the fusion of the three feature maps. Lastly, a global threshold is utilized to segment the saliency map and extract target regions. Experimental results with real SAR images demonstrate that the produced saliency map is effective on both highlighting targets and inhibiting background. The proposed method also shows better detection performance and less time-consuming than the conventional CFAR.

In this paper, a novel method named discriminant neighborhood preserving projections using L1-norm maximization (DNPP-L1) is developed for Synthetic Aperture Radar (SAR) target recognition. The proposed method can preserve the local geometry information from raw high-dimension data and utilize useful class discriminant information to improve the performance of target recognition effectively. The proposed DNPP-L1 is based on L1 norm distance metric, which is very robust for SAR images target with noise. Experimental results on MSTAR database demonstrate the effectiveness of the proposed method.

In this paper, a new subspace learning algorithm, called enhanced kernel uncorrelated discriminant nearest feature line analysis i¼ˆEKUDNFLAi¼‰, is presented. The aim of EKUDNFLA is to seek a feature subspace in which the within-class feature line (FL) distances are minimized and the between-class FL distances are maximized simultaneously. At the same time, an uncorrelated constraint is imposed to get statistically uncorrelated features, which contain minimum redundancy and ensure independence, and thus it is highly desirable in many practical applications. Optimizing an objective function in a kernel feature space, nonlinear features are extracted. In addition, a weighting coefficient is introduced to adjust the proportion between within-class and between-class information to get an optimal effect. Experimental results on radar target recognition with measured data demonstrate the effectiveness of the proposed method.

In this letter, a new manifold learning algorithm, called uncorrelated discriminant locality preserving projections (UDLPP), is proposed. The aim of UDLPP is to preserve the within-class geometric structure, while maximizing the between-class distance. By introducing a simple uncorrelated constraint into the objective function, we show that the extracted features via UDLPP are statistically uncorrelated, which is desirable for many pattern analysis applications. Moreover, UDLPP can be performed in reproducing kernel Hilbert space, which gives rise to kernel UDLPP. Experimental results on both face recognition and radar target recognition demonstrate the effectiveness of the proposed algorithm.

In this letter, we present a new formulation for uncorrelated discriminant analysis (UDA) in some high-dimensional feature space and then propose an efficient UDA algorithm using kernel technique. Unlike some existing UDA algorithms, which solve uncorrelated discriminant vectors one at a time, the proposed algorithm is able to extract all the uncorrelated discriminant vectors simultaneously in the feature space and does not suffer the small sample size problem. Experimental results show that the proposed method is very competitive in comparison with some existing discriminant analysis algorithms, in terms of recognition rate and robustness with respect to kernel parameters.