Medical Image Registration Using the Fourier Transform


A Fourier Transform (FT) based pattern-matching algorithm was adapted for use in medical image registration. This algorithm obtained the FT of two images, determined the normalized cross-power spectrum of the transformed images, and then applied an inverse FT. The result was a delta function with a maximum value at the location corresponding to the distance between the two images; a similar method was used to recover rotations. This algorithm was first tested using a simple two-dimensional image, with induced shifts of ±20 pixels and ±10 degrees. All translations were recovered with no error and all rotations were recovered within 0.18 degrees. Subsequently, this algorithm was tested on eight clinical kV images drawn from four different body sites. Twenty-five random shifts and rotations were applied to each image. The average mean error of the registration solution was -0.002 ± 0.077 mm in the x direction, 0.002 ± 0.075 mm in the y direction, and -0.012 ± 0.099 degrees. These initial results suggest that a FT algorithm has a high degree of accuracy when registering clinical kV images.

Share and Cite:

J. Luce, J. Gray, M. Hoggarth, J. Lin, E. Loo, M. Campana and J. Roeske, "Medical Image Registration Using the Fourier Transform," International Journal of Medical Physics, Clinical Engineering and Radiation Oncology, Vol. 3 No. 1, 2014, pp. 49-55. doi: 10.4236/ijmpcero.2014.31008.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] J. B. A. Maintz and M. A. Viergever, “An Overview of Medical Image Registration Methods,” UU-CS, Vol. 22, 1998, pp. 1-22.
[2] M. V. Wyawahare, P. M. Patil and H. K. Abhyankar, “Image Registration Techniques: An Overview,” Vol. 2, No. 3, 2009, pp. 11-27.
[3] J. P. W. Pluim, J. B. A. Maintz and M. A. Viergever, “Mutual Information Based Registration of Medical Images: A Survey,” IEEE Transactions on Medical Imaging, Vol. 22, No. 8, 2003, pp. 986-1004.
[4] F. Maes, D. Vandermeulen and P. Suetens, “Medical Image Registration Using Mutual Information,” Proceedings of the IEEE, Vol. 91, No. 10, 2003, pp. 1699-1722.
[5] J. P. Lewis, “Fast Normalized Cross-Correlation,” In: Vision Interface, 1995, pp. 120-123.
[6] B. S. Reddy and B. N. Chatterji, “An FFT-Based Technique for Translation, Rotation, and Scale-Invariant Image Registration,” IEEE Transactions on Image Processing, Vol. 5, No. 8, 1996, pp. 1266-1271.
[7] H. Xie, N. Hicks, G. R. Keller, H. Huang and V. Kreinovich, “An IDL/ENVI Implementation of the FFT-Based Algorithm for Automatic Image Registration,” Computers & Geosciences, Vol. 29, No. 8, 2003, pp. 1045-1055.
[8] E. De Castro and C. Morandi, “Registration of Translated and Rotated Images Using Finite Fourier Transforms,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-9, No. 5, 1987, pp. 700-703.
[9] R. Joshi and R. Cook, “An Analysis of Rigid Image Alignment Computer Vision Algorithms,” International Journal of Computer and Electrical Engineering, Vol. 1, No. 1, 2012, pp. 48-54.
[10] J. Z. Wang, L. E. Reinstein, J. Hanley and A. G. Meek, “Investigation of a Phase-Only Correlation Technique for Anatomical Alignment of Portal Images in Radiation Therapy,” Physics in Medicine and Biology, Vol. 41, No. 6, 1996, pp. 1045-1058.
[11] A. Papoulis, “Systems and Transforms with Application in Optics,” McGraw-Hill, New York, 1968.
[12] G. D. Bergland, “A Guided Tour of the Fast Fourier Transform,” IEEE Spectrum, Vol. 6, No. 7, 1969, pp. 41-52.
[13] G. Tzimiropoulos and T. Stathaki, “Robust FFT-Based Scale-Invariant Image Registration,” 4th SEAS DTC Technical Conference, Edinburgh, 7-8 July 2009, A10.
[14] F. J. Harris, “On the Use of Windows for Harmonic Analysis with the Discrete Fourier Transform,” Proceedings of the IEEE, Vol. 66, No. 1, 1979, pp. 51-83.
[15] M. Sedlacek and M. Titera, “Interpolations in Frequency and Time Domains Used in FFT Spectrum Analysis,” Measurement, Vol. 23, No. 3, 1998, pp. 185-193.
[16] J. Schmidt and K. Creath, “Window Function Influence on Phase Error in Phase-Shifting Algorithms,” Applied Optics, Vol. 35, No. 28, 1996, pp. 5642-5649.
[17] J. Cooley and J. Tukey, “An Algorithm for the Machine Calculation of Complex Fourier Series,” Mathematics of Computation, Vol. 19, No. 90, 1965, pp. 297-301.
[18] E. Vera and S. Torres, “Subpixel Accuracy Analysis of Phase Correlation Registration Methods Applied to Aliased Imagery,” 16th European Signal Processing Conference, Lausanne, 25-29 August 2008, 5p.
[19] R. Yavne, “An Economical Method for Calculating the Discrete Fourier Transform,” AFIPS Fall Joint Computer Conference, Vol. 33, 1968, pp. 115-128.
[20] T. Beth, “On the Computational Complexity of the General Discrete Fourier Transform,” Theoretical Computer Science, Vol. 51, No. 3, 1987, pp. 331-339.
[21] R. Shams, P. Sadeghi, R. A. Kennedy and R. I. Hartley, “A Survey of Medical Image Registration on Multicore and the GPU,” IEEE on Signal Processing Magazine, Vol. 27, No. 2, 2010, pp. 50-60.
[22] G. Xuejun, H. Pan, Y. Liang, R. Castillo, D. Yang, D. Choi, et al., “Implementation and Evaluation of Various Demons Deformable Image Registration Algorithms on a GPU,” Physics in Medicine and Biology, Vol. 55, No. 1, 2010, pp. 207-219.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.