{'fraction_non_alphanumeric': 0.017252820172528202, 'fraction_numerical': 0.0, 'mean_word_length': 5.643171806167401, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimal Segmentation of High-Resolution Remote Sensing Image by Combining Superpixels With the Minimum Spanning Tree

Image segmentation is the foundation of object-based image analysis, and many researchers have sought optimal segmentation results. The initial image oversegmentation and the optimal segmentation scale are two vital factors in high spatial resolution remote sensing image segmentation. With respect to these two issues, a novel image segmentation method combining superpixels with a minimum spanning tree is proposed in this paper. First, the image is oversegmented using a simple linear iterative clustering algorithm to obtain superpixels. Then, the superpixels are clustered by regionalization with a dynamically constrained agglomerative clustering and partitioning (REDCAP) algorithm using the initial number of segments, and the local variance (LV) and the rate of LV change (ROC-LV) indicator diagrams corresponding to the number of segments are obtained. The suitable number of image segments is determined according to the LV and ROC-LV indicator diagrams corresponding to the number of segments. Finally, the superpixels are reclustered using the REDCAP algorithm based on the suitable number of image segments to obtain the image segmentation result. Through two sets of experiments, the proposed method is compared with two other segmentation algorithms. The experimental results show that the proposed method outperforms the others and obtains good image segmentation results.