Abstract:
New algorithms for merging superpixel regions into segments are proposed. The main idea of merging superpixels is as follows. Firstly, a strategy is used in which a segment is grown from neighboring regions while the conditions for merging are met, and, secondly, when merging regions, the applied information quality measure should not increase. Three algorithms based on the specified strategy are proposed, which differ in the conditions for making a decision on merging superpixels. A computational experiment is carried out on test images. The experiment showed that the proposed algorithms accelerate the segmentation process compared to the procedure used earlier with acceptable losses of information quality measures of the resulting partitions.
Key words:image segmentation, information redundancy, information variation, growing segments, combining segments, superpixel.