Phase correlation functions: FFT vs. FHT

Authors

  • Giuseppe Schirripa Spagnolo Università degli Studi "Roma Tre"
  • Lorenzo Cozzella Università degli Studi "Roma Tre"
  • Fabio Leccese Università degli Studi "Roma Tre" http://orcid.org/0000-0002-8152-2112

DOI:

https://doi.org/10.21014/acta_imeko.v8i1.604

Abstract

The ability to process an image is a crucial skill in many measurement activities. In image processing or pattern recognition, Fast Fourier Transform (FFT) is widely used. In particular, the Phase Only Correlation (POC) method demonstrates high robustness and subpixel accuracy in pattern matching. However, there is a disadvantage in the required memory machine because of the calculation of 2D-FFT. In applications in which the use of memory is a critical element, Fast Hartley Transform (FHT) seems to be a good substitute. In this context, the use of Hartley’s transform can be of interest for apps implemented on portable systems e.g. smartphones. In this article, we present a comparison of the implementations of the phase correlation function using FFT and FHT. Particular attention is given to the analytical steps necessary to implement the POC by means of the Hartley transform.

Author Biographies

Giuseppe Schirripa Spagnolo, Università degli Studi "Roma Tre"

Mathematical and Physics Department

Fabio Leccese, Università degli Studi "Roma Tre"

Science Department - Ph.D. Assistant Professor

Downloads

Published

2019-03-31

Issue

Section

Research Papers