A linear-time approach for image segmentation using graph-cut measures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4179 LNCS, Issue , 2006, Pages 138-149

  Falcão, Alexandre X ^a   Miranda, Paulo A V ^a   Rocha, Anderson ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER GRAPHICS; FUNCTIONS;

ENERGY FUNCTION; GRAPH-CUT SEGMENTATION; IMAGE GRAPHS;

IMAGE SEGMENTATION;

EID: 33750226432     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864349_13     Document Type: Conference Paper

References (18)

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 (1993) 1101-1113
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). (1996) 557-564
3. Wang, S., Siskind, J.M.: Image segmentation with minimum mean cut. In: Intl. Conf. on Computer Vision (ICCV). Volume 1. (2001) 517-525
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). (1996) 478-483
5. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence 22 (2000) 888-905
6. Wang, S., Sinkind, J.M.: Image segmentation with ratio cut. IEEE Trans. on Pattern Analysis and Machine Intelligence 25 (2003) 675-690
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). Volume 1. (2001) 105-112
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 (2004) 1124-1137
9. Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts. IEEE Trans. on Pattern Analysis and Machine Intelligence 26 (2004) 147-159
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). (2001) 231-238
11. Carballido-Gamio, J., Belongie, S.J., Majumdar, S.: Normalized cuts in 3D for spinal MRI segmentation. IEEE Trans. on Medical Imaging 23 (2004) 36-44
12. Ford, L., Fulkerson, D.: Flows in networks. Princeton University Press (1962)
13. Greig, D., Porteous, B., Seheult, A.: Exact maximum a posteriori estimation for binary images. J. Royal Statistical Society, series B 51 (1989) 271-279
14. Kohli, P., Torr, P.H.: Efficiently solving dynamic markov random fields using graph cuts. In: Intl. Conf. on Computer Vision (ICCV). Volume II. (2005) 922-929
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 (2004) 19-29
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 (2000) 55-62
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 (2002) 1239-1251
18. Falcão, A., Bergo, F.: Interactive volume segmentation with differential image foresting transforms. IEEE Trans. on Medical Imaging 23 (2004) 1100-1108