关键词: 图像分割, 简单线性迭代聚类（SLIC）, Delaunay三角剖分, 最小割最大流

Abstract: The existing interactive image segmentation algorithms are not efficient enough to process high resolution images. In order to solve this problem, this paper proposes an efficient algorithm for interactive image segmentation based on simple linear iterative clustering (SLIC) and Delaunay graph cut. Firstly, a kind of simplified but efficient SLIC superpixel method is used to group pixels into perceptually meaningful atomic regions, so the representative pixels can be extracted from these regions. Secondly, Delaunay triangulation is adopted for graph construction on the representative pixels in the bounding box. Finally, min-cut/max-flow algorithm is applied to divide the nodes in the graph into two parts, which represent the foreground and background in the image. The experimental results and comparisons with other interactive image segmentation algorithms demonstrate the high efficiency and accuracy of the proposed algorithm.

Key words: image segmentation, simple linear iterative clustering (SLIC), Delaunay triangulation, min-cut/max-flow