Paper
4 August 1997 Efficient algorithm for multispectral data coding using approximate trigonometric expansions
Qurban A. Memon, Takis Kasparis
Author Affiliations +
Abstract
Images obtained from satellite and airborne multispectral collection platforms exhibit a high degree of spatial and spectral correlations that must be properly exploited in any multispectral bandwidth compression scheme. Removing the inherent spectral correlation in the data results in a significant compaction of data to be coded. Discrete approximate trigonometric expansions have previously been proposed for exploiting spatial correlation in 1D signals and images for the purpose of coding.In this paper, we apply the approximate trigonometric expansions to multispectral data, and explore their capability of spectral decorrelation across bands. We show that the compression algorithms employing approximate trigonometric expansions to multispectral imagery provide fast implementation and some how better spectral decorrelation efficiency than discrete cosine transform. For comparison purposes, the results are compared with the techniques employing the discrete cosine transform. Computer simulation results are presented.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Qurban A. Memon and Takis Kasparis "Efficient algorithm for multispectral data coding using approximate trigonometric expansions", Proc. SPIE 3071, Algorithms for Multispectral and Hyperspectral Imagery III, (4 August 1997); https://doi.org/10.1117/12.280596
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Multispectral imaging

Image compression

Bandpass filters

Image processing

Signal processing

Computer programming

Computer simulations

Back to Top