메뉴 건너뛰기




Volumn 2809, Issue , 2004, Pages 542-551

An efficient algorithm for Multiple Sclerosis lesion segmentation from brain MRI

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CEREBROSPINAL FLUID; CLASSIFICATION (OF INFORMATION); COMPUTATION THEORY; NEAREST NEIGHBOR SEARCH; SYSTEM THEORY;

EID: 0242308123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article
Times cited : (12)

References (17)
  • 1
    • 0034151398 scopus 로고    scopus 로고
    • Adaptive, template moderated, spatially varying statistical classification
    • Warfield, S., Kaus, M., Jolesz, F., Kikinis, R.: Adaptive, template moderated, spatially varying statistical classification. Medical Image Analisys 4 (2000) 43-55
    • (2000) Medical Image Analisys , vol.4 , pp. 43-55
    • Warfield, S.1    Kaus, M.2    Jolesz, F.3    Kikinis, R.4
  • 4
    • 0016567534 scopus 로고
    • An algorithm for finding nearest neighbors
    • Friedman, J., Baskett, F., Shustek, L.: An algorithm for finding nearest neighbors. IEEE Trans, on Computers C-24(10) (1975) 1000-1006
    • (1975) IEEE Trans, on Computers , vol.C-24 , Issue.10 , pp. 1000-1006
    • Friedman, J.1    Baskett, F.2    Shustek, L.3
  • 5
    • 38249002676 scopus 로고
    • An improved method for finding nearest neighbors
    • Jian, Q., Zhang, W.: An improved method for finding nearest neighbors. Pattern Recognition Letters 14 (1993) 531-535
    • (1993) Pattern Recognition Letters , vol.14 , pp. 531-535
    • Jian, Q.1    Zhang, W.2
  • 6
    • 0016533974 scopus 로고
    • A branch and bound algorithm for computing k-nearest neighbors
    • Fukunaga, K., Narendra, P.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Transactions On Computers C-24 (1975) 750-753
    • (1975) IEEE Transactions on Computers , vol.C-24 , pp. 750-753
    • Fukunaga, K.1    Narendra, P.2
  • 7
    • 0030170534 scopus 로고    scopus 로고
    • Fast k-nn classification for multichannel image data
    • Warfield, S.: Fast k-nn classification for multichannel image data. Pattern Recognition Letters 17(7) (1996) 713-721
    • (1996) Pattern Recognition Letters , vol.17 , Issue.7 , pp. 713-721
    • Warfield, S.1
  • 8
    • 84937061451 scopus 로고    scopus 로고
    • Fast k-nn classification with an optimal k-distance transformation algorithm
    • Cuisenaire, O., Macq, B.: Fast k-nn classification with an optimal k-distance transformation algorithm. Proc. 10th European Signal Processing Conf. (2000) 1365-1368
    • (2000) Proc. 10th European Signal Processing Conf. , pp. 1365-1368
    • Cuisenaire, O.1    Macq, B.2
  • 12
    • 0001781555 scopus 로고    scopus 로고
    • Voronoi diagrams
    • Sack, J., Urrutia, G., eds.: Elsevier Science Publishing
    • Aurenhammer, F., Klein, R.: Voronoi diagrams. In Sack, J., Urrutia, G., eds.: Handbook of Computational Geometry. Elsevier Science Publishing (2000) 201-290
    • (2000) Handbook of Computational Geometry , pp. 201-290
    • Aurenhammer, F.1    Klein, R.2
  • 16
    • 38248998887 scopus 로고
    • The Euclidean distance transform in arbitrary dimensions
    • Ragnemalm, I.: The Euclidean distance transform in arbitrary dimensions. Pattern Recognition Letters 14 (1993) 883-888
    • (1993) Pattern Recognition Letters , vol.14 , pp. 883-888
    • Ragnemalm, I.1
  • 17
    • 21544432712 scopus 로고    scopus 로고
    • Brainweb: Online interface to a 3D MRI simulated brain database
    • 425., Copenhagen
    • Cocosco, C., Kollokian, V., Kwan, R.S., Evans, A.: Brainweb: online interface to a 3D MRI simulated brain database. In: Neuroimage. Volume 5 of 425., Copenhagen (1997)
    • (1997) Neuroimage , vol.5
    • Cocosco, C.1    Kollokian, V.2    Kwan, R.S.3    Evans, A.4


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