Semantic segmentation of high-resolution remote sensing images (HRSI) is significant, yet challenging. Recently, several research works have utilized the self-attention operation to capture global dependencies. HRSI have complex scenes and rich details, and the implementation of self-attention on a whole image will introduce redundant information and interfere with semantic segmentation. The detail recovery of HRSI is another challenging aspect of semantic segmentation. Several networks use up-sampling, skip-connections, parallel structure, and enhanced edge features to obtain more precise results. However, the above methods ignore the misalignment of features with different resolutions, which affects the accuracy of the segmentation results. To resolve these problems, this paper proposes a semantic segmentation network based on sparse self-attention and feature alignment (SAANet). Specifically, the sparse position self-attention module (SPAM) divides, rearranges, and resorts the feature maps in the position dimension and performs position attention operations (PAM) in rearranged and restored sub-regions, respectively. Meanwhile, the proposed sparse channel self-attention module (SCAM) groups, rearranges, and resorts the feature maps in the channel dimension and performs channel attention operations (CAM) in the rearranged and restored sub-channels, respectively. SPAM and SCAM effectively model long-range context information and interdependencies between channels, while reducing the introduction of redundant information. Finally, the feature alignment module (FAM) utilizes convolutions to obtain a learnable offset map and aligns feature maps with different resolutions, helping to recover details and refine feature representations. Extensive experiments conducted on the ISPRS Vaihingen, Potsdam, and LoveDA datasets demonstrate that the proposed method precedes general semantic segmentation- and self-attention-based networks.

A significant challenge in detecting objects in complex remote sensing (RS) datasets is from small objects. Existing detection methods achieve much lower accuracy on small objects than medium and large ones. These methods suffer from limited feature information, susceptibility to complex background interferences, and insufficient contextual information. To address these issues, a small object detection method with the enhanced receptive field, ERF-RTMDet, is proposed to achieve a more robust detection capability on small objects in RS images. Specifically, three modules are employed to enhance the receptive field of small objects’ features. First, the Dilated Spatial Pyramid Pooling Fast Module is proposed to gather more contextual information on small objects and suppress the interference of background information. Second, the Content-Aware Reassembly of Features Module is employed for more efficient feature fusion instead of the nearest-neighbor upsampling operator. Finally, the Hybrid Dilated Attention Module is proposed to expand the receptive field of object features after the feature fusion network. Extensive experiments are conducted on the MAR20 and NWPU VHR-10 datasets. The experimental results show that our ERF-RTMDet attains higher detection precision on small objects while maintaining or slightly enhancing the detection precision on mid-scale and large-scale objects.

Superpixel generation of polarimetric synthetic aperture radar (PolSAR) images is widely used for intelligent interpretation due to its feasibility and efficiency. However, the initial superpixel size setting is commonly neglected, and empirical values are utilized. When prior information is missing, a smaller value will increase the computational burden, while a higher value may result in inferior boundary adherence. Additionally, existing similarity metrics are time-consuming and cannot achieve better segmentation results. To address these issues, a novel strategy is proposed in this article for the first time to construct the function relationship between the initial superpixel size (number of pixels contained in the initial superpixel) and the structural complexity of PolSAR images; additionally, the determinant ratio test (DRT) distance, which is exactly a second form of Wilks’ lambda distribution, is adopted for local clustering to achieve a lower computational burden and competitive accuracy for superpixel generation. Moreover, a hexagonal distribution is exploited to initialize the PolSAR image based on the estimated initial superpixel size, which can further reduce the complexity of locating pixels for relabeling. Extensive experiments conducted on five real-world data sets demonstrate the reliability and generalization of adaptive size estimation, and the proposed superpixel generation method exhibits higher computational efficiency and better-preserved details in heterogeneous regions compared to six other state-of-the-art approaches.

Clustering-based methods of polarimetric synthetic aperture radar (PolSAR) image superpixel generation are popular due to their feasibility and parameter controllability. However, these methods pay more attention to improving boundary adherence and are usually time-consuming to generate satisfactory superpixels. To address this issue, a novel cross-iteration strategy is proposed to integrate various advantages of different distances with higher computational efficiency for the first time. Therefore, the revised Wishart distance (RWD), which has better boundary adherence but is time-consuming, is first integrated with the geodesic distance (GD), which has higher efficiency and more regular shape, to form a comprehensive similarity measure via the cross-iteration strategy. This similarity measure is then utilized alternately in the local clustering process according to the difference between two consecutive ratios of the current number of unstable pixels to the total number of unstable pixels, to achieve a lower computational burden and competitive accuracy for superpixel generation. Furthermore, hexagonal initialization is adopted to further reduce the complexity of searching pixels for relabelling in the local regions. Extensive experiments conducted on the AIRSAR, RADARSAT-2 and simulated data sets demonstrate that the proposed method exhibits higher computational efficiency and a more regular shape, resulting in a smooth representation of land cover in homogeneous regions and better-preserved details in heterogeneous regions.

Semantic segmentation is an essential task in polarimetric synthetic aperture radar (PolSAR) image interpretation. To address the issue of insufficient measurement ability of single-view similarity, an unsupervised semantic segmentation method for PolSAR images based on multiview similarity is proposed to estimate the number-of-classes (NoC) and perform classification. NoC estimation is commonly neglected in semantic segmentation methods, to ensure rationality, a NoC estimation method before clustering is proposed based on multiview polarimetric rotation domain features and the visual assessment of tendency (VAT) method for PolSAR images without supervision. Then, the norm distance, geodesic distance, maximum likelihood distance and generalized likelihood ratio test distance based on the statistical characteristics of PolSAR images are comprehensively analyzed. Various advantages of different distances are integrated to combine the multiview vector information and scattering information to construct six multi-kernel similarity matrices. Subsequently, the consensus similarity network fusion method is utilized to further strengthen the discriminative ability of the similarity matrices. In addition, efficient superpixel segmentation is also adopted to reduce the speckle noise. Finally, based on the estimated NoC and the fused similarity matrix, spectral clustering is utilized to obtain semantic segmentation results. Extensive experiments conducted on two AIRSAR data sets and one Gaofen-3 data set demonstrate that the proposed method can effectively combine the spatial neighborhood similarity information and achieve higher semantic segmentation accuracy.