Automatic 3D image segmentation using adaptive k-means on brain MRI

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The aim of this paper is to present a fully automatic adaptive k-means segmentation algorithm for MR Images in a 3D space. We model the gray scale values of the 3D image with a White Gaussian Process and superimpose a prior model on the region process in the form of Markov Random Field. These assumptions require the use of estimators for the parameters of the two processes. This has been carried out using decreasing size windows. The Hammersley-Clifford theorem allows us to model the region process in term of a Gibbs Distribution. The Gibbs parameter β is estimated using a correlation-based technique. The segmentation is obtained maximizing the a posterior density function using an Iterated Conditional Modes technique. The proposed algorithm is fully automatic, i.e. all the parameters of the model are estimated within the segmentation process. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Nieddu, L., Manfredi, G., & D’Acunto, S. (2011). Automatic 3D image segmentation using adaptive k-means on brain MRI. In Communications in Computer and Information Science (Vol. 252 CCIS, pp. 171–183). https://doi.org/10.1007/978-3-642-25453-6_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free