By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. X. H. Yan ; Pennsylvania Univ., Philadelphia, PA, USA ; J. S. Karp

An algorithm is described for segmenting 3D MR brain image into K different tissue types, which include gray, white matter and CSF, and maybe other abnormal tissues. MR images considered can be either scale- or multi-valued. Each scale-valued image is modeled as a collection of regions with slowly varying intensity plus a white Gaussian noise. Each tissue type is modeled by a Markov random field with the second order neighborhood in a 3D lattice. The proposed algorithm is an adaptive K-means clustering algorithm for 3-dimensional and multi-valued images. Each iteration consists of two steps: estimate mean intensity at each location for each type, and estimate tissue types by maximizing the a posteriori probability. The algorithm slowly adapts to the local intensity variation of each region, so it is robust to the “shading” effect. It has the potential to routinely process clinical MR images with minimal user involvement. Its performance is tested using patient data

Published in:

Nuclear Science Symposium and Medical Imaging Conference, 1994., 1994 IEEE Conference Record  (Volume:4 )

Date of Conference:

30 Oct-5 Nov 1994