A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures
Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We present a solution that runs in time proportional to the number of pixels. Our method computes an ordered region growing from a set of seeds inside the object, where the propagation order of each pixel is proportional to the cost of an optimum path in the image graph from the seed set to that pixel. Each pixel defines a region which includes it and all pixels with lower propagation order. The boundary of each region is a possible cut boundary, whose cut measure is also computed and assigned to the corresponding pixel on-the-fly. The object is obtained by selecting the pixel with minimum-cut measure and all pixels within its respective cut boundary. Approaches for graph-cut segmentation usually assume that the desired cut is a global minimum. We show that this can be only verified within a reduced search space under certain hard constraints. We present and evaluate our method with three cut measures: normalized cut, mean cut and an energy function.
KeywordsEnergy Function Image Segmentation Optimum Path Hard Constraint Background Pixel
Unable to display preview. Download preview PDF.
- 2.Cox, I.J., Rao, S.B., Zhong, Y.: Ratio regions: a technique for image segmentation. In: Intl. Conf. on Computer Vision and Pattern Recognition (CVPR), pp. 557–564 (1996)Google Scholar
- 3.Wang, S., Siskind, J.M.: Image segmentation with minimum mean cut. In: Intl. Conf. on Computer Vision (ICCV), vol. 1, pp. 517–525 (2001)Google Scholar
- 4.Sarkar, S., Boyer, K.L.: Quantitative measures of change based on feature organization: eigenvalues and eigenvectors. In: Intl. Conf. on Computer Vision and Pattern Recognition (CVPR), pp. 478–483 (1996)Google Scholar
- 7.Yuri, Y., Boykov, M.P.J.: Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In: Intl. Conf. on Computer Vision (ICCV), vol. 1, pp. 105–112 (2001)Google Scholar
- 10.Fowlkes, C., Belongie, S., Malik, J.: Efficient spatiotemporal grouping using the nyström method. In: Intl. Conf. on Computer Vision and Pattern Recognition (CVPR), pp. 231–238 (2001)Google Scholar
- 13.Greig, D., Porteous, B., Seheult, A.: Exact maximum a posteriori estimation for binary images. J. Royal Statistical Society, series B 51, 271–279 (1989)Google Scholar
- 14.Kohli, P., Torr, P.H.: Efficiently solving dynamic markov random fields using graph cuts. In: Intl. Conf. on Computer Vision (ICCV), vol. II, pp. 922–929 (2005)Google Scholar