Application of Information Redundancy Measure To Image Segmentation

In this paper, the problem of image segmentation quality is considered. The main idea is to find a quality criterion, which could have an extremum. The problem is viewed as selecting the best segmentation from a set of images generated by segmentation algorithm at different parameter values. We propose to use information redundancy measure as a criterion for optimizing segmentation quality. The method for constructing the redundancy measure provides criterion with extremal properties. To show efficiency of the proposed criterion, computing experiment is carried out. The proposed criterion is combined with SLIC and EDISON segmentation algorithms. Computing experiment shows that the segmented image corresponding to a minimum of redundancy measure produces acceptable information distance when compared with the original image. In most cases, the lowest information distance between this segmented image and ground-truth segmentations is obtained. An example of applying the redundancy measure to segmentation of images of painting material cross-sections is considered.