메뉴 건너뛰기




Volumn , Issue , 2010, Pages 3045-3048

Reducing graphs in graph cut segmentation

Author keywords

Graph cut; Reduction; Segmentation

Indexed keywords

COMPLETE GRAPHS; EXACT SOLUTION; FLOW COMPUTATION; GRAPH CUT; LARGE-SCALE PROBLEM; MAX FLOW ALGORITHM; NARROW BANDS; NEW STRATEGY; OBJECT EDGE; SEGMENTATION; SMALL SCALE;

EID: 78651111924     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2010.5654046     Document Type: Conference Paper
Times cited : (12)

References (11)
  • 2
    • 79551680931 scopus 로고    scopus 로고
    • Accurate banded graph cut segmentation of thin structures using laplacian pyramids
    • A.K. Sinop and L. Grady, "Accurate banded graph cut segmentation of thin structures using laplacian pyramids," in MICCAI, 2006, vol. 9, pp. 896-903.
    • (2006) MICCAI , vol.9 , pp. 896-903
    • Sinop, A.K.1    Grady, L.2
  • 3
    • 33745155997 scopus 로고    scopus 로고
    • A multilevel banded graph cuts method for fast image segmentation
    • H. Lombaert, Y.Y. Sun, L. Grady, and C.Y. Xu, "A multilevel banded graph cuts method for fast image segmentation," in ICCV, 2005, vol. 1, pp. 259-265.
    • (2005) ICCV , vol.1 , pp. 259-265
    • Lombaert, H.1    Sun, Y.Y.2    Grady, L.3    Xu, C.Y.4
  • 4
    • 69949179951 scopus 로고    scopus 로고
    • Region-based image segmentation via graph cuts
    • C. Cigla and A.A. Alatan, "Region-based image segmentation via graph cuts," in ICIP, 2008, pp. 2272-2275.
    • (2008) ICIP , pp. 2272-2275
    • Cigla, C.1    Alatan, A.A.2
  • 6
    • 4344598245 scopus 로고    scopus 로고
    • An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
    • Y. Boykov and V. Kolmogorov, "An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision," IEEE Transactions on PAMI, vol. 26, no. 9, pp. 1124-1137, 2004.
    • (2004) IEEE Transactions on PAMI , vol.26 , Issue.9 , pp. 1124-1137
    • Boykov, Y.1    Kolmogorov, V.2
  • 7
    • 51949108455 scopus 로고    scopus 로고
    • A scalable graph-cut algorithm for n-d grids
    • A. Delong and Y. Boykov, "A scalable graph-cut algorithm for n-d grids," in CVPR, 2008, pp. 1-8.
    • (2008) CVPR , pp. 1-8
    • Delong, A.1    Boykov, Y.2
  • 8
    • 0034844730 scopus 로고    scopus 로고
    • Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images
    • Y. Boykov and M-P. Jolly, "Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images," in ICCV, 2001, vol. 1, pp. 105-112.
    • (2001) ICCV , vol.1 , pp. 105-112
    • Boykov, Y.1    Jolly, M.-P.2
  • 9
    • 0742286180 scopus 로고    scopus 로고
    • What energy functions can be minimized via graph cuts ?
    • V. Kolmogorov and R. Zabih, "What energy functions can be minimized via graph cuts ?," IEEE Transactions on PAMI, vol. 26, no. 2, pp. 147-159, 2004.
    • (2004) IEEE Transactions on PAMI , vol.26 , Issue.2 , pp. 147-159
    • Kolmogorov, V.1    Zabih, R.2
  • 11
    • 0000250265 scopus 로고
    • Measure of the amount of ecological association between species
    • L. Dice, "Measure of the amount of ecological association between species," Ecology, vol. 26, no. 3, pp. 297-302, 1945.
    • (1945) Ecology , vol.26 , Issue.3 , pp. 297-302
    • Dice, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.