Share Email Print

Proceedings Paper

Approximate trigonometric expansions with applications to image encoding
Author(s): Qurban A. Memon; Takis Kasparis
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The objective of data encoding is to transform a data array into a statistically uncorrelated set. This step is typically considered a 'decorrelation' step because in the case of unitary transformations, the resulting transform coefficients are relatively uncorrelated. Most unitary transforms have the tendency to compact the signal energy into relatively few coefficients. The compaction of energy thus achieved permits a prioritzation of the spectral coefficients with the most energetic ones receiving a greater allocation of encoding bits. There are various transforms such as Karhunen-Loeve, discrete cosine transforms etc., but the choice depends on the particular application. In this paper, we apply an approximate Fourier expansion (AFE) to sampled one-dimensional signals and images, and investigate some mathematical properties of the expansion. Additionally, we extend the expansion to an approximate cosine expansion (ACE) and show that for purposes of data compression with minimum error reconstruction of images, the performance of ACE is better than AFE. For comparison purposes, the results also are compared with discrete cosine transform (DCT).

Paper Details

Date Published: 7 June 1996
PDF: 10 pages
Proc. SPIE 2751, Hybrid Image and Signal Processing V, (7 June 1996); doi: 10.1117/12.242017
Show Author Affiliations
Qurban A. Memon, Univ. of Central Florida (United States)
Takis Kasparis, Univ. of Central Florida (United States)

Published in SPIE Proceedings Vol. 2751:
Hybrid Image and Signal Processing V
David P. Casasent; Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top