메뉴 건너뛰기




Volumn 5875 LNCS, Issue PART 1, 2009, Pages 1055-1066

Multi-label MRF optimization via a least squares s-t cut

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION APPLICATIONS; EDGE WEIGHTS; GRAPH CUT; LEAST SQUARE; LEAST SQUARES SOLUTIONS; MARKOV RANDOM FIELDS; MULTI-LABEL; QUALITATIVE IMAGES; SEGMENTATION RESULTS;

EID: 72449184779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10331-5_98     Document Type: Conference Paper
Times cited : (1)

References (16)
  • 1
    • 0035509961 scopus 로고    scopus 로고
    • Fast approximate energy minimization via graph cuts
    • Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE PAMI 23, 1222-1239 (2001)
    • (2001) IEEE PAMI , vol.23 , pp. 1222-1239
    • Boykov, Y.1    Veksler, O.2    Zabih, R.3
  • 2
    • 33846207510 scopus 로고    scopus 로고
    • Random walks for image segmentation
    • Grady, L.: Random walks for image segmentation. IEEE PAMI 28, 1768-1783 (2006)
    • (2006) IEEE PAMI , vol.28 , pp. 1768-1783
    • Grady, L.1
  • 4
    • 0142039762 scopus 로고    scopus 로고
    • Exact optimization for markov random fields with convex priors
    • Ishikawa, H.: Exact optimization for markov random fields with convex priors. IEEE PAMI 25, 1333-1336 (2003)
    • (2003) IEEE PAMI , vol.25 , pp. 1333-1336
    • Ishikawa, H.1
  • 5
    • 72449205520 scopus 로고    scopus 로고
    • Schlesinger, D., Flach, B.: Transforming an arbitrary min-sum problem into a binary one. Tech. Report TUD-FI06-01, Dresden University (2006)
    • Schlesinger, D., Flach, B.: Transforming an arbitrary min-sum problem into a binary one. Tech. Report TUD-FI06-01, Dresden University (2006)
  • 6
    • 38149047343 scopus 로고    scopus 로고
    • Graph cut based optimization for MRFs with truncated convex priors
    • Veksler, O.: Graph cut based optimization for MRFs with truncated convex priors. In: IEEE CVPR, pp. 1-8 (2007)
    • (2007) IEEE CVPR , pp. 1-8
    • Veksler, O.1
  • 7
    • 53149116476 scopus 로고    scopus 로고
    • Logcut - efficient graph cut optimization for markov random fields
    • Lempitsky, V., Rother, C., Blake, A.: Logcut - efficient graph cut optimization for markov random fields. In: IEEE ICCV, pp. 1-8 (2007)
    • (2007) IEEE ICCV , pp. 1-8
    • Lempitsky, V.1    Rother, C.2    Blake, A.3
  • 8
    • 52949110978 scopus 로고    scopus 로고
    • Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primaldual strategies
    • Komodakis, N., Tziritas, G., Paragios, N.: Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primaldual strategies. Comput. Vis. Image Underst. 112, 14-29 (2008)
    • (2008) Comput. Vis. Image Underst , vol.112 , pp. 14-29
    • Komodakis, N.1    Tziritas, G.2    Paragios, N.3
  • 9
    • 33750129298 scopus 로고    scopus 로고
    • Convergent tree-reweighted message passing for energy minimization
    • Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE PAMI 28, 1568-1583 (2006)
    • (2006) IEEE PAMI , vol.28 , pp. 1568-1583
    • Kolmogorov, V.1
  • 11
  • 14
    • 0000250265 scopus 로고
    • Measures of the amount of ecologic association between species
    • Dice, L.R.: Measures of the amount of ecologic association between species. Ecology 26, 279-302 (1945)
    • (1945) Ecology , vol.26 , pp. 279-302
    • Dice, L.R.1


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