Title :
Three algorithms for computing the 2-D discrete Hartley transform
Author :
Grigoryan, Artyom M. ; Agaian, Sos S.
Author_Institution :
Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA
Abstract :
In this paper, three algorithms based on the method of vector and paired transforms for dividing the computation of the nonseparable two-dimensional discrete Hartley transform (2-D DHT) into the "minimal" number of the one-dimensional (1-D) DHT\´s are presented. The computational complexity of the proposed method is analyzed, and the comparative estimates revealing the efficiency of the proposed algorithms with respect to the known algorithms are given.
Keywords :
computational complexity; discrete Hartley transforms; image processing; 1D DHT; 2D DHT; 2D discrete Hartley transform; algorithms efficiency; computational complexity; coverings construction; image processing; nonseparable two-dimensional discrete Hartley transform; paired transforms; signal processing; vector algorithm; Algorithm design and analysis; Computational complexity; Computed tomography; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Neural networks; Speech analysis; Two dimensional displays;
Conference_Titel :
Image Processing, 2000. Proceedings. 2000 International Conference on
Conference_Location :
Vancouver, BC, Canada
Print_ISBN :
0-7803-6297-7
DOI :
10.1109/ICIP.2000.899391
