A Practical Fast Fourier Transform (FFT)-Based Implementation For Image Correlation

H. Kidorf; W. Piegorsch

doi:10.1117/12.944856

4 December 1984 A Practical Fast Fourier Transform (FFT)-Based Implementation For Image Correlation

H. Kidorf, W. Piegorsch

Proceedings Volume 0504, Applications of Digital Image Processing VII; (1984) https://doi.org/10.1117/12.944856
Event: 28th Annual Technical Symposium, 1984, San Diego, United States

Abstract

Presented here is a simple, easily implemented method for an FFT-based implementation of image cross-correlation which provides for the proper normalization required to obtain useful, easily interpreted output. The results are applied to character recognition. The algorithm is structured such that the data is processed in a highly parallel fashion in order to facilitate a fast, efficient hardware implementation. A discussion is made of the relative merits of using this method.

Citation Download Citation

H. Kidorf and W. Piegorsch "A Practical Fast Fourier Transform (FFT)-Based Implementation For Image Correlation", Proc. SPIE 0504, Applications of Digital Image Processing VII, (4 December 1984); https://doi.org/10.1117/12.944856

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available