메뉴 건너뛰기




Volumn , Issue , 2009, Pages 3569-3572

Automatic delineation of the inner thoracic region in non-contrast CT data

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPHIC METHODS;

EID: 77950970809     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IEMBS.2009.5332585     Document Type: Conference Paper
Times cited : (9)

References (7)
  • 5
    • 33845572152 scopus 로고    scopus 로고
    • Computing exact discrete minimal surfaces:extending and solving the shortest path problem in 3d with application to segmentation
    • June
    • L. Grady, "Computing exact discrete minimal surfaces:extending and solving the shortest path problem in 3d with application to segmentation," in Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol.1, June 2006, pp. 69-78.
    • (2006) Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition , vol.1 , pp. 69-78
    • Grady, L.1
  • 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 Pattern Analysis and Machine Intelligence, vol.26, no.9, pp. 1124-1137, 2004.
    • (2004) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.26 , Issue.9 , pp. 1124-1137
    • Boykov, Y.1    Kolmogorov, V.2
  • 7
    • 0016972463 scopus 로고
    • Maximal closure of a graph and applications to combinatorial problems
    • J.-C. Picard, "Maximal closure of a graph and applications to combinatorial problems," Management Science, vol.22, no.11, pp. 1268-1272, 1976.
    • (1976) Management Science , vol.22 , Issue.11 , pp. 1268-1272
    • Picard, J.-C.1


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