Share Email Print

Proceedings Paper

A Study Of The Discrete Hartley Transform For Image Compression Applications
Author(s): Kou-Hu Tzou; To R. Hsing
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 11 July 1985
PDF: 8 pages
Proc. SPIE 0534, Architectures and Algorithms for Digital Image Processing II, (11 July 1985); doi: 10.1117/12.946570
Show Author Affiliations
Kou-Hu Tzou, GTE Laboratories Incorporated (United States)
To R. Hsing, Telco Systems Optics Corporation (United States)

Published in SPIE Proceedings Vol. 0534:
Architectures and Algorithms for Digital Image Processing II
Francis J. Corbett, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?