Proceedings of 1994 IEEE Nuclear Science Symposium - NSS'94
DOI: 10.1109/nssmic.1994.474771
|View full text |Cite
|
Sign up to set email alerts
|

Segmentation of 3D brain MR using an adaptive K-means clustering algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 23 publications
(16 citation statements)
references
References 13 publications
0
16
0
Order By: Relevance
“…41,42 The stripped parenchyma was segmented into GM and WM using adaptive Bayesian algorithms. 28,43,44 …”
Section: Image Processingmentioning
confidence: 99%
“…41,42 The stripped parenchyma was segmented into GM and WM using adaptive Bayesian algorithms. 28,43,44 …”
Section: Image Processingmentioning
confidence: 99%
“…2 The brain volume was extracted by automatically stripping scalp, skull, and meninges using optimal thresholding and morphological operations on the image intensity and chamfer distance (an easily computed approximation of the distance from any given point to the head surface). 33,34 Some nonbrain regions, such as bone marrow and the eyeballs, could not be reliably stripped by this algorithm and were removed manually in an interactive program. The stripped MRI image was segmented into GM, WM, and CSF using an adaptive Bayesian algorithm 35,36 that models the image as a collection of tissue compartments with slowly varying mean intensity plus white gaussian noise.…”
Section: Clinical Measuresmentioning
confidence: 99%
“…K-means clustering is one of the most popular statistical clustering techniques used in segmentation of medical images [43], [44], [45]. The name K-means originates from the means of the k clusters that are created from n objects.…”
Section: G Adaptation Of C-means To Rough Set Theorymentioning
confidence: 99%