2 November 2022 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
This paper addresses the problem of superpixel-bases segmentation of synthetic aperture radar (SAR) images. Most superpixel segmentation methods have difficulties in segmenting adjacent regions with similar gray values, due to only considering spatial and gray information. To solve this problem and improve segmentation accuracy, this paper proposes a SAR image segmentation method based on Fisher vector superpixel generation and label revision. Firstly, the Fisher vector is obtained by processing the Gaussian mixture function. By introducing the Fisher vector, a distance formula is constructed for superpixel segmentation. Therefore, the adjacent regions with similar gray values can be segmented effectively in the generated superpixel map. Secondly, the superpixels are clustered using the K-means algorithm to obtain the initial label map. Then, with extracted edge information as constraints, the pixel labels obtained by K-means are repaired pixel by pixel to get the middle label map, according to the number and gray value difference of labels. This overcomes influence of noise generated by K-means. Finally, the middle label map is relabeled using the region growth algorithm to divide pixel blocks. Isolated pixel blocks surrounded by similar labels are corrected, based on the gray mean difference. The final label result has a better segmentation accuracy. Experiments on synthetic SAR images and real images demonstrate that the proposed algorithm achieves higher segmentation accuracy than six state-of-the-art clustering algorithms for SAR image segmentation.
15 November 2024 in IEEE Transactions on Geoscience and Remote Sensing
Superpixel segmentation algorithms are predominently based on Simple Linear Iterative Clustering (SLIC), and treat homogeneous and complex regions equally. This can lead to sub-optimal segmentation results, especially in complex images with multiple objects. We address this problem by proposing a SAR image segmentation algorithm based on complicated region-sensitive adaptive superpixel generation and hybrid edge correction (RSASGEC). Firstly, a dynamic initialization algorithm for superpixel seeds based on region complexity is designed. Specifically, a new superpixel representation structure for superpixel seeds is constructed by combining superpixel complexity and the number of contained pixels. The algorithm gives priority to regions with high complexity, dynamically selecting the region with the highest complexity for further partitioning. This results in a dense distribution of superpixel seeds in complex regions, and sparse distributions in homogeneous regions with low complexity. Secondly, an iterative superpixel segmentation process based on an adaptive energy function is proposed. The Lagrange multiplier mathematical strategy is employed to optimize the adaptive energy function within an adjustable search window, resulting in more compact superpixel segmentation. Finally, a label correction method, based on edge mixture model constraints, is proposed for post-processing. By integrating edge information from the Gaussian edge detector and the Canny algorithm as constraints, this method leverages majority voting and region growth methods to mitigate edge noise and outliers, refining the superpixel labels. The RSASGEC algorithm is verified in experiments, using one simulated image and six real SAR images. The results indicate that RSASGEC outperforms six representative algorithms, achieving more satisfactory segmentation performance.