Fast Hartley Transform and overlap sectioning for calculation of linear cross-correlation of images

• Autorzy: Wołowiec Ł. , Jacymirski M.
• Języki publikacji: EN

Abstrakty

EN

The paper deals with application of Fast Hartley Transform to calculation of linear cross-correlation of images. A sectioning algorithm for the two-dimensional case, based on a known convolution-sectioning algorithm, is proposed and described in the paper. Moreover, the correlation algorithms based on the Fourier and Hartley Transforms have been studied, and the comparative examination of the practical performance of these algorithms displays the superiority of the Hartley Transform over the Fourier one for the real-data input.

Słowa kluczowe

EN

fast Hartley transform; linear cross-correlation; image processing

PL

szybkie przekształcenie Hartleya; liniowa korelacja wzajemna; przetwarzanie obrazu

• Wydawca: Wydawnictwo Politechniki Łódzkiej
• Czasopismo: Journal of Applied Computer Science
• Rocznik: 2004
• Tom: Vol. 12, nr 2
• Strony: 65--75
• Opis fizyczny: Bibliogr. 18 poz.

Twórcy

autor

Wołowiec Ł.

• Institute of Computer Science, Technical University of Lodz, 215 Wolczanska St., 93-005 Lodz

autor

Jacymirski M.

• Institute of Computer Science, Technical University of Lodz, 215 Wolczanska St., 93-005 Lodz
• Mathematical Modelling Centre of the J.S.Pidstrygatch Institute of Applied Mechanics and Mathematics, Ukrainian Academy of Sciences 15, Dudajev St., 79-005 Lviv

Bibliografia

• [1] García-Martínez P., Arsenault H. H.: Nonlinear radial-harmonic correlation using binary decomposition for scale-invariant pattern recognition - Optic Communications, issue 223 (2003), pp. 273-282.
• [2] Bonmassar G., Schwartz E. L.: Improved cross-correlation for template matching on the Laplacian pyramid - Pattern Recognition Letters, issue 19 (1998), pp. 765 - 770.
• [3] Cappelini V., Constantinides A.G., Emiliani P.: Digital filters and their applications - Academic Press, London 1978.
• [4] Borodziewicz W., Jaszczak K.: Digital Signal Processing - Selected Problems (Cyfrowe przetwarzanie sygnałów - wybrane zagadnienia). WNT, 1987 (in Polish)
• [5] Maren C., Ewers G.: A Simple Approach to Digital Signal Processing (Zarys cyfrowego przetwarzania sygnałów). WKiŁ, Warsaw 1999 (in Polish).
• [6] Lyons R.G.: Understanding Digital Signal Processing (Wprowadzenie do cyfrowego przetwarzania sygnałów). WKiŁ, Warsaw 1999 (in Polish).
• [7] Dudziak K., Sieńko W.: Digital Signal Processing (Cyfrowe przetwarzanie sygnałów). WSM, Gdynia 1999 (in Polish).
• [8] Tadeusiewicz R., Korohoda P.: Computer Analysis and Image Processing (Komputerowa analiza i przetwarzanie obrazów). Telecommunication Progress Foundation Publishing 1997 (in Polish).
• [9] Banachowski L., Diks K., Rytter W.: Algorithms and Data Structures (Algorytmy i struktury danych). WNT, Warsaw 1996 (in Polish).
• [10] Cooley J.W, Tukey J.W.: An algorithm for the Machine Calculation of Complex Fourier Series, Mathematics of Computation, 19, 90, 1965. pp. 297-301,
• [11] Brigham E. O.: The Fast Fourier Transform and Its Applications - Rentice-Hall, New Jersey 1988.
• [12] Bracewell R.: The Fourier Transform and Its Applications - McGraw-Hill Book Company, New York 1965.
• [13] Jacymirski M.: The Fast Orthogonal Trigonometric Transform Algorithms - Academic Express, Lviv 1997.
• [14] Briggs W. L., Henson Van Emden: The DFT: An Owners’ Manual for the Discrete Fourier Transform, SoftCover 1995.
• [15] Press W. H., Teukolsky S.A., Vetterling W. T., Flannery В. P.: Numerical Recipes in C++: The Art of Scientific Computing - Cambridge University Press, 2002.
• [16] Bracewell R.: The Hartley Transform - Oxford University Press, New York 1986.
• [17] Ullmann R.F.: An Algorithm for the Fast Hartley Transform. Standford Exploration Project Report, No. 38 (May 1984), pp. 325-350.
• [18] Bi G., Lian S.: Fast Algorithms for Generalized Discrete Hartley Transform - Journal of Circuits, Systems, and Computers, vol. 10, No. 1&2, pp. 77-83.