Fast Hartley transforms for image processing

1 June 1988

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Medical Imaging

Vol. 7 (2) , 149-153
https://doi.org/10.1109/42.3941

Abstract

The fast Hartley transform (FHT) is used to transform two-dimensional image data. Because the Hartley transform is real-valued, it does not require complex operations. Both spectra and autocorrelations of two-dimensional ultrasound images of normal and abnormal livers were computed.

Keywords

This publication has 8 references indexed in Scilit:

Fast Hartley transforms for spectral analysis of ultrasound Doppler signals
IEEE Transactions on Biomedical Engineering, 1988
Quantization errors in the computation of the discrete Hartley transform
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
The Fast Hartley Transform Algorithm
IEEE Transactions on Computers, 1987
Conversion of FFT’s to Fast Hartley Transforms
SIAM Journal on Scientific and Statistical Computing, 1986
Fast two-dimensional Hartley transform
Proceedings of the IEEE, 1986
A comparison of the time involved in computing fast Hartley and fast Fourier transforms
Proceedings of the IEEE, 1985
The fast Hartley transform
Proceedings of the IEEE, 1984
A More Symmetrical Fourier Analysis Applied to Transmission Problems
Proceedings of the IRE, 1942