A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures

  • Alexandre X. Falcão
  • Paulo A. V. Miranda
  • Anderson Rocha
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4179)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: theory and its applications to image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence 15, 1101–1113 (1993)CrossRefGoogle Scholar
  2. 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. 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. 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
  5. 5.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence 22, 888–905 (2000)CrossRefGoogle Scholar
  6. 6.
    Wang, S., Sinkind, J.M.: Image segmentation with ratio cut. IEEE Trans. on Pattern Analysis and Machine Intelligence 25, 675–690 (2003)CrossRefGoogle Scholar
  7. 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
  8. 8.
    Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. on Pattern Analysis and Machine Intelligence 26, 1124–1137 (2004)CrossRefGoogle Scholar
  9. 9.
    Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts. IEEE Trans. on Pattern Analysis and Machine Intelligence 26, 147–159 (2004)CrossRefGoogle Scholar
  10. 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
  11. 11.
    Carballido-Gamio, J., Belongie, S.J., Majumdar, S.: Normalized cuts in 3D for spinal MRI segmentation. IEEE Trans. on Medical Imaging 23, 36–44 (2004)CrossRefGoogle Scholar
  12. 12.
    Ford, L., Fulkerson, D.: Flows in networks. Princeton University Press, Princeton (1962)MATHGoogle Scholar
  13. 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. 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
  15. 15.
    Falcão, A., Stolfi, J., Lotufo, R.: The image foresting transform: Theory, algorithms, and applications. IEEE Trans. on Pattern Analysis and Machine Intelligence 26, 19–29 (2004)CrossRefGoogle Scholar
  16. 16.
    Falcão, A., Udupa, J., Miyazawa, F.: An ultra-fast user-steered image segmentation paradigm: Live-wire-on-the-fly. IEEE Trans. on Medical Imaging 19, 55–62 (2000)CrossRefGoogle Scholar
  17. 17.
    Leitao, H., Stolfi, J.: A multiscale method for the reassembly of two-dimensional fragmented objects. IEEE Trans. on Pattern Analysis and Machine Intelligence 24, 1239–1251 (2002)CrossRefGoogle Scholar
  18. 18.
    Falcão, A., Bergo, F.: Interactive volume segmentation with differential image foresting transforms. IEEE Trans. on Medical Imaging 23, 1100–1108 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Alexandre X. Falcão
    • 1
  • Paulo A. V. Miranda
    • 1
  • Anderson Rocha
    • 1
  1. 1.Institute of ComputingState University of Campinas (UNICAMP)CampinasBrazil

Personalised recommendations