As a typical pattern recognition method, communication signal modulation involves many complicated factors. Fractal theory can be used for signal modulation feature extraction and recognition because of its good ability to express complex information. In this paper, we conduct a systematic research study by using the fractal dimension as the feature of modulation signals. Box fractal dimension, Katz fractal dimension, Higuchi fractal dimension, Petrosian fractal dimension, and Sevcik fractal dimension are extracted from eight different modulation signals for signal pattern recognition. Meanwhile, the anti-noise function, box-diagram, and running time are used to evaluate the noise robustness, separability, and computational complexity of five different fractal features. Finally, Bback-Propagation (BP) neural network, grey relation analysis, random forest, and K-nearest neighbor are proposed to classify the different modulation signals based on these fractal features. The confusion matrices and recognition results are provided in the experimental section. They indicate that random forest had a better recognition performance, which could reach 96% in 10 dB.
17 January 2024 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Synthetic aperture radar (SAR) images are often affected by a type of multiplicative noise known as “speckle” due to their active imaging characteristics.This property complicates the processing and interpretation of SAR images. While deep learning techniques have demonstrated success in despeckling many models are tailored to specific noise levels. This specificity can limit a model's ability to generalize to real SAR images with varying noise levels, potentially leading to over-smoothing or over-focusing on specific details. To address these challenges, we present the Adaptive Noise Estimation and Despeckling Network (ANED-Net). This network consists of a noise-level estimation phase and a noise-level-guided non-blind denoising phase. During the non-blind denoising phase, we develop a Noise Feature-Guided Denoising Network (NFGDN). This network integrates a hierarchical encoder-decoder denoising module based on the Transformer block (T-unet) and a Denoising Enhancement Control (DEC) block. Together, they skillfully capture both local and global dependencies inherent in SAR images, facilitating effective noise removal. Furthermore, we also introduce a Deep-attention mechanism to counteract the attentional collapse observed when the Transformer is extended in depth, enhancing the network's feature extraction capability and strengthening the model's denoising performance. Extensive tests on synthetic and real images show that ANED-Net is robust to different noise scenarios. It effectively mitigates speckle noise even at unspecified levels, and outperforms many established methods.
The objective of task allocation in unmanned systems is to complete tasks at minimal costs. However, the current algorithms employed for coordinating multiple unmanned systems in task allocation tasks frequently converge to local optima, thus impeding the identification of the best solutions. To address these challenges, this study builds upon the sheep flock optimization algorithm (SFOA) by preserving individuals eliminated during the iterative process within a prior knowledge set, which is continuously updated. During the reproduction phase of the algorithm, this prior knowledge is utilized to guide the generation of new individuals, preventing their rapid reconvergence to local optima. This approach aids in reducing the frequency at which the algorithm converges to local optima, continually steering the algorithm towards the global optimum and thereby enhancing the efficiency of task allocation. Finally, various task scenarios are presented to evaluate the performances of various algorithms. The results show that the algorithm proposed in this paper is more likely than other algorithms to escape from local optima and find the global optimum.
Oriented object detection is essential for interpreting high-resolution remote-sensing images, but detectors trained on a single source domain often suffer from severe performance degradation under unseen imaging conditions. Existing domain generalization methods mainly address horizontal detection or treat style variation as an undifferentiated perturbation, while the geometry-sensitive nature of oriented objects, especially elongated instances, is insufficiently considered. To address these limitations, a shape-adaptive learning and style-aware decomposition framework, termed SA-DGOD, is proposed for single-source domain-generalized oriented object detection. A frozen CLIP image encoder is employed only during training to provide multi-level style statistics, from which several interpretable branch-style pseudo-domains are constructed by modulating feature statistics that characterize photometric and contrast variations. These explicit pseudo-domain identities enable structured style diversification without accessing target-domain data. To improve orientation-sensitive representation learning, a shape-adaptive soft consistency loss is introduced for rotated RoI features. Instead of using a fixed-threshold binary weighting scheme, the proposed loss adopts an aspect-ratio-aware threshold and a continuous rotated-IoU-based weight, allowing elongated objects and geometrically reliable proposals to be handled more flexibly. Furthermore, a style-aware common-specific classifier decomposition is introduced into the proposed framework to separate domain-invariant category discrimination from pseudo-domain-specific style bias. Extensive experiments on multiple remote sensing benchmarks demonstrate the effectiveness and generalization capability of SA-DGOD.
Oriented remote sensing object detection (ORSOD) remains challenging because objects usually appear at arbitrary rotations, with large aspect-ratio variations and dense spatial layouts. Although recent detectors have achieved notable progress, most still rely on standard convolutional backbones, whose limited inherent rotation equivariance weakens robustness to rotated targets and reduces localization reliability. To address these issues, this paper proposes RedhDet, an ORSOD framework based on rotation-equivariant feature learning and dual-head decoupling. Specifically, a Ladder-Structured Implicitly Equivariant Network (LSIEN) is developed as the backbone to extract rotation-equivariant features in a soft manner, without relying on strictly constrained kernels or equivariant pre-trained weights. In addition, a decoupled dual-head architecture is introduced, in which a fully connected branch is used for classification and a convolutional branch is used for bounding box regression, thereby better matching the distinct requirements of semantic recognition and precise localization. Experimental results on the DOTA-1.0 and HRSC2016 datasets demonstrate the effectiveness of the proposed method. On the DOTA-1.0 test set, RedhDet improves mAP50 by 2.09% and mAP75 by 14.84% over the baseline. On HRSC2016, gains of 14.12% and 51.85% are achieved for mAP50 and mAP75, respectively. With multi-scale training and testing, the proposed method achieves 80.40% mAP on DOTA-1.0, indicating its effectiveness and competitiveness for ORSOD.