This paper proposes a novel interactive image segmentation algorithm based on the Grow Cut of two different scale graphs. Firstly, Watershed algorithm based on color information has been used to partition the image into many different regions which will be considered as the cells of Grow Cut, instead of image pixels. Then a segmentation result can be obtained by using Grow Cut on the aforementioned regions. Finally an automatic edge correction can be used on the segmentation result by Grow Cut of pixel-scale graph. Because the number of nodes and edges for the Grow Cut algorithm is reduced by more than fifty times compared to the pixel based method, the running time of our proposed algorithm is much less than the original Grow Cut. The segmentation performance of our proposed is much better than the original Grow Cut. Experimental results on Berkeley image dataset demonstrated the effectiveness of proposed method. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Li, X., Chen, J., & Fan, H. (2012). Interactive image segmentation based on grow cut of two scale graphs. In Communications in Computer and Information Science (Vol. 331 CCI, pp. 90–95). https://doi.org/10.1007/978-3-642-34595-1_13
Mendeley helps you to discover research relevant for your work.