Paper
7 June 1996 Approximate trigonometric expansions with applications to image encoding
Qurban A. Memon, Takis Kasparis
Author Affiliations +
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).
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Qurban A. Memon and Takis Kasparis "Approximate trigonometric expansions with applications to image encoding", Proc. SPIE 2751, Hybrid Image and Signal Processing V, (7 June 1996); https://doi.org/10.1117/12.242017
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Computer programming

Fourier transforms

Data modeling

Signal to noise ratio

Energy efficiency

Data compression

Back to Top