Fast Task-Specific Region Merging for SAR Image Segmentation

In existing superpixel-wise segmentation algorithms, superpixel generation most often is an isolated preprocessing step. The segmentation performance is determined to a certain extent by the accuracy of superpixels. However, it is still a challenge to develop a stable superpixel generation method. In this article, we attempt to incorporate the superpixel generation and merging steps into an end-to-end trainable deep network. First, we employ a recently proposed differentiable superpixel generation method to over-segment the single-polarization synthetic aperture radar (SAR) image. It outputs the statistical likelihood that each pixel belongs to different superpixels. In superpixel merging part, as one of our main contributions, we propose a superpixelwise statistical dissimilarity measure method for converting the soft superpixels set into a self-connected weighted graph. More importantly, inspired by the concept of the number of walks in graph theory, we define the k-order connectivity of each vertex. This definition can intelligently indicate the potential soft cluster centers and class assignments in graph. This merging method is differentiable, computationally simple, and free of empirical parameters. The superpixel generation and merging phases can be implemented under a unified deep network. The benefit is that our method can iteratively adjust the shapes of the superpixels according to the boundaries and segmentation results during training, until the satisfactory segmentation results are captured. Experimental results on real SAR images demonstrate that the segmentation precision of our proposed method is superior to other state-of-the-art methods in terms of precision and computational efficiency.