Image registration based on pseudo-polar FFT and analytical fourier-mellin transform

  • Authors:
  • Xiaoxin Guo;Zhiwen Xu;Yinan Lu;Zhanhui Liu;Yunjie Pang

  • Affiliations:
  • College of Computer Science and Technology, Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China;College of Computer Science and Technology, Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China;College of Computer Science and Technology, Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China;College of Computer Science and Technology, Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China;College of Computer Science and Technology, Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China

  • Venue:
  • ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a novel registration algorithm based on Pseudo-Polar Fast Fourier Transform (FFT) and Analytical Fourier-Mellin Transform (AFMT) for the alignment of images differing in translation, rotation angle, and uniform scale factor. The proposed algorithm employs the AFMT of the Fourier magnitude to determine all the geometric transformation parameters with its property of the invariance to translation and rotation. Besides, the proposed algorithm adopt a fast high accuracy conversion from Cartesian to polar coordinates based on the pseudo-polar FFT and the conversion from the pseudo-polar to the polar grid, which involves only 1D interpolations, and obtain a more significant improvement in accuracy than the conventional method using cross-correlation. Experiments show that the algorithm is accurate and robust regardless of white noise.