Share Email Print
cover

Proceedings Paper

Efficient algorithm for multispectral data coding using approximate trigonometric expansions
Author(s): Qurban A. Memon; Takis Kasparis
Format Member Price Non-Member Price
PDF $14.40 $18.00

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

Paper Details

Date Published: 4 August 1997
PDF: 12 pages
Proc. SPIE 3071, Algorithms for Multispectral and Hyperspectral Imagery III, (4 August 1997); doi: 10.1117/12.280596
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. 3071:
Algorithms for Multispectral and Hyperspectral Imagery III
A. Evan Iverson; Sylvia S. Shen, Editor(s)

© SPIE. Terms of Use
Back to Top