11 July 1985 A Study Of The Discrete Hartley Transform For Image Compression Applications
Author Affiliations +
Proceedings Volume 0534, Architectures and Algorithms for Digital Image Processing II; (1985) https://doi.org/10.1117/12.946570
Event: 1985 Los Angeles Technical Symposium, 1985, Los Angeles, United States
Abstract
The discrete Hartley transform (DHT) and its fast algorithm were introduced recently. One of the advantages of the DHT is that the forward and inverse transforms are of the same form except for a normalization constant. Therefore, the forward and the inverse transform can be implemented by the same subroutine or hardware when the normalization constant is properly taken care of. In this paper, the applications of the DHT to image compression are studied. The distribution of the DHT coefficients is tested using the Kolmogorov-Smirnov goodness-of-fit test. The compression efficiency of DHT coding is found to be about the same as discrete Fourier transform (DFT) coding. The DHT coding system incorporated with a human visual system model is also studied and this system offers about the same subjective image quality as a straight-forward DCT coding system.
© (1985) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kou-Hu Tzou, To R. Hsing, "A Study Of The Discrete Hartley Transform For Image Compression Applications", Proc. SPIE 0534, Architectures and Algorithms for Digital Image Processing II, (11 July 1985); doi: 10.1117/12.946570; https://doi.org/10.1117/12.946570
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top