A Competitive Study of Graph Reduction Methods for Min S-T Cut Image Segmentation

Abstract

Abstract When applied to the segmentation of 3D medical images, graph-cut segmentation algorithms require an extreme amount of memory and time resources in order to represent the image graph and to perform the necessary processing on the graph. These requirements actually exclude the graph-cut based approaches from their practical application. Hence, there is a need to develop the dedicated graph size reduction methods. In this paper, several techniques for the graph size reduction are proposed. These apply the idea of superpixels. In particular, two methods for superpixel creation are introduced. The results of applying the proposed methods to the segmentation of CT datasets using min-cut/max-flow algorithm are presented, compared and discussed.