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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Collignon, F.M., Delaere, D., Vandermeulen, D., Suetens, P., Marchal, G.: Automated multimodality image registration based on information theory. In: Bizais, Y., Barillot, C., Di Paolo, R. (eds.) Information Processing in Medical Imaging, pp. 263–274. Kluwer Academic Publishers, Dordrecht (1995)
Collignon, F.M.: Multi-modality medical image registration by maximization of mutual information, Ph.D. thesis, Catholic Universtity of Leuven, Leuven, Belgium (1998)
Viola, P., Wells III, W.M.: Alignment by maximization of mutual information. In: Grimson, E., Shafer, S., Blake, A., Sugihara, K. (eds.) International Conference on Computer Vision, pp. 16–23. IEEE Computer Society Press, Los Alamitos (1995)
Viola, P.: Alignment by maximization of mutual information, Ph.D. thesis, Massachusetts Institute of Technology, Boston, MA, USA (1995)
Wells III, W.M., Viola, P., Kikinis, R.: Multi-modal volume registration by maximization of mutual information. In: Medical Robotics and Computer Assisted Surgery, pp. 55–62. John Wiley & Sons, New York (1995)
Likar, B., Viergever, M.A., Pernuš, F.: Retrospective correction of MR intensity inhomogeneity by information minimization. In: Delp, S.L., DiGoia, A.M., Jaramaz, B. (eds.) MICCAI 2000. LNCS, vol. 1935, pp. 375–384. Springer, Heidelberg (2000)
Likar, B., Maintz, J.B.A., Viergever, M.A., Pernus, F.: Retrospective Shading Correction Based On Entropy Minimization. Journal of Microscopy 197, 285–295 (2000)
MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Le Cam, M., Neyman, J. (eds.) proc. of the Fifth Berkeley Symposium on Mathematical Statistics and Probability. Statistics, vol. I. University of California Press, Berkeley (1967)
Knops, Z.F., Maintz, J.B.A., Viergever, M.A., Pluim, J.P.W.: Normalized mutual information based registration using K-means clustering based histogram binning. In: proc. SPIE Medical Imaging 2003 (2003) (in press)
Studholme, C.: Measures of 3D medical image alignment, Ph.D. thesis. University of London, London, UK (1997)
Studholme, C., Hill, D.L.G., Hawkes, D.J.: An overlap invariant entropy measure of 3D medical image alignment. Pattern Recognition 32(1), 71–86 (1999)
Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C. Cambridge University Press, Cambridge (1992)
Bellman, R.: Dynamic Programming Treatment of the Travelling Salesman Problem. JACM 9(1), 61–63 (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knops, Z.F., Maintz, J.B.A., Viergever, M.A., Pluim, J.P.W. (2003). Normalized Mutual Information Based PET-MR Registration Using K-Means Clustering and Shading Correction. In: Gee, J.C., Maintz, J.B.A., Vannier, M.W. (eds) Biomedical Image Registration. WBIR 2003. Lecture Notes in Computer Science, vol 2717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39701-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-39701-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20343-8
Online ISBN: 978-3-540-39701-4
eBook Packages: Springer Book Archive