Normalized mutual information based PET-MR registration using K-means clustering and shading correction

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

Abstract

A method for the efficient re-binning and shading based correction of intensity distributions of the images prior to normalized mutual information based registration is presented. Our intensity distribution re-binning method is based on the K-means clustering algorithm as opposed to the generally used equidistant binning method. K-means clustering is a binning method with a variable size for each bin which is adjusted to achieve a natural clustering. Furthermore, a shading correction method is applied to reduce the effect of intensity inhomogeneities in MR images. Registering clinical shading corrected MR images to PET images using our method shows that a significant reduction in computational time without loss of accuracy as compared to the standard equidistant binning based registration is possible. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Knops, Z. F., Antoine Maintz, J. B., Viergever, M. A., & Pluim, J. P. W. (2003). Normalized mutual information based PET-MR registration using K-means clustering and shading correction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2717, 31–39. https://doi.org/10.1007/978-3-540-39701-4_4

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