메뉴 건너뛰기




Volumn 28, Issue 10, 2010, Pages 1460-1471

Some links between extremum spanning forests, watersheds and min-cuts

Author keywords

Extremum spanning forests; Min cuts; Segmentation; Watersheds

Indexed keywords

FUNCTION EVALUATION; IMAGE SEGMENTATION; WATERSHEDS;

EID: 77955338316     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.imavis.2009.06.017     Document Type: Conference Paper
Times cited : (53)

References (20)
  • 9
    • 33645151117 scopus 로고    scopus 로고
    • Combinatorial Optimization: Theory and Algorithms
    • Springer Berlin
    • B. Korte, and J. Vygen Combinatorial Optimization: Theory and Algorithms Algorithms and Combinatorics 2000 Springer Berlin
    • (2000) Algorithms and Combinatorics
    • Korte, B.1    Vygen, J.2
  • 14
    • 0027576716 scopus 로고
    • Morphological grayscale reconstruction in image analysis: Applications and efficient algorithms
    • L. Vincent Morphological grayscale reconstruction in image analysis: applications and efficient algorithms IEEE Transactions on Image Processing 2 2 1993 176 201
    • (1993) IEEE Transactions on Image Processing , vol.2 , Issue.2 , pp. 176-201
    • Vincent, L.1
  • 15
    • 0012574730 scopus 로고    scopus 로고
    • A minimum spanning tree algorithm with inverse-Ackermann type complexity
    • B. Chazelle A minimum spanning tree algorithm with inverse-Ackermann type complexity Journal of the Association for Computing Machinery 47 2000 1028 1047
    • (2000) Journal of the Association for Computing Machinery , vol.47 , pp. 1028-1047
    • Chazelle, B.1


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