For the existing jamming discrimination methods on the multistatic radar system, the single feature of target echo space correlation is utilised as the metric, which leads to the lack of comprehensive feature extraction and universal discrimination algorithm. In this study, a discrimination method in a multistatic radar system based on the convolutional neural network is proposed. This proposal combines the advantages of multiple‐radar systems cooperative detection technology with the convolutional neural network, and effectively applies to the field of anti‐deception jamming, which takes full advantage of unknown information of echo data to obtain multi‐dimensional, comprehensive, complete and deep feature differences besides correlation, so as to achieve a better jamming discrimination effect. The simulation results show that the proposed method can extract the multidimensional and separable essential features of echoes, and all these features have a strong degree of differentiation between targets and jamming, which effectively reduce the influence of noise and pulse number. At the same time, the influence of radar distribution on jamming discrimination under non‐ideal conditions is relieved, when the correlation coefficient of the true target reaches 0.4, the discrimination probability remains above 85%, which broadens the boundary conditions of the application process.
For the discrimination of false targets, the discrimination probability can be improved by increasing the number of radar stations. However, that may result in a serious waste of equipment resources when too many radars are involved. An asymptotic subset selection strategy based on target positioning characteristics is proposed to address the above issues. Several effective strategies are considered to select some transmitters and receivers to form a radar subset, such as the rapid shrinkage method, global shrinkage method, and predetermined size method, which can guarantee the preset discrimination performance of limited equipment resources and reduce the waste of resources. All of the selected stations have good spatial distribution or strong discrimination capacity in multistatic radar system. Compared with the exhaustive search, the proposed subset selection strategy affords a significant reduction in terms of time complexity. The simulation results show that the radar subset can maintain approximate discrimination performance with the original multistatic radar systems. At the same time, the proposed method optimizes the number of radar stations and reduces data processing time and required communication links, thus effectively saving operating costs.
With the process of increasing urbanization, there is great significance in obtaining urban change information by applying land cover change detection techniques. However, these existing methods still struggle to achieve convincing performances and are insufficient for practical applications. In this paper, we constructed a new data set, named Wenzhou data set, aiming to detect the land cover changes of Wenzhou City and thus update the urban expanding geographic data. Based on this data set, we provide a new self-attention and convolution fusion network (SCFNet) for the land cover change detection of the Wenzhou data set. The SCFNet is composed of three modules, including backbone (local–global pyramid feature extractor in SLGPNet), self-attention and convolution fusion module (SCFM), and residual refinement module (RRM). The SCFM combines the self-attention mechanism with convolutional layers to acquire a better feature representation. Furthermore, RRM exploits dilated convolutions with different dilation rates to refine more accurate and complete predictions over changed areas. In addition, to explore the performance of existing computational intelligence techniques in application scenarios, we selected six classical and advanced deep learning-based methods for systematic testing and comparison. The extensive experiments on the Wenzhou and Guangzhou data sets demonstrated that our SCFNet obviously outperforms other existing methods. On the Wenzhou data set, the precision, recall and F1-score of our SCFNet are all better than 85%.
The existing circular target model has a huge limitation which just represents the target angle or frequency interval with respect to the station, but ignores the influence of observed direction. To solve this problem, in this study the correlation coefficient for rectangular scattering model which has two parameters of width and length in spatial and frequency diversity multiple‐input multiple‐output radars is studied. Under the rectangular scattering model, the authors can describe accurately the change of effective target size varying with the observed direction, which represent a better approximation of the scattering characteristics that the target shape brings. The uniform analytic expressions of correlation coefficient are derived, and the results are verified by numerical simulations.
24 March 2024 in Proceedings of the AAAI Conference on Artificial Intelligence
Graph Structure Learning (GSL) has demonstrated considerable potential in the analysis of graph-unknown non-Euclidean data across a wide range of domains. However, constructing an end-to-end graph structure learning model poses a challenge due to the impediment of gradient flow caused by the nearest neighbor sampling strategy. In this paper, we construct a differential graph structure learning model by replacing the non-differentiable nearest neighbor sampling with a differentiable sampling using the reparameterization trick. Under this framework, we argue that the act of sampling nearest neighbors may not invariably be essential, particularly in instances where node features exhibit a significant degree of similarity. To alleviate this issue, the bell-shaped Gaussian Similarity (GauSim) modeling is proposed to sample non-nearest neighbors. To adaptively model the similarity, we further propose Neural Gaussian Similarity (NeuralGauSim) with learnable parameters featuring flexible sampling behaviors. In addition, we develop a scalable method by transferring the large-scale graph to the transition graph to significantly reduce the complexity. Experimental results demonstrate the effectiveness of the proposed methods.