Adaptive two-stage Karhunen-Loeve-transform scheme for spectral decorrelation in hyperspectral bandwidth compression

Abstract

A computationally efficient adaptive two-stage Karhunen-Loeve transform (KLT) scheme for spectral decorrelation in hyperspectral lossy bandwidth compression is presented. The component decorrelation of the JPEG 2000 (extension 2) is replaced with an adaptive two-stage KLT scheme. The data are partitioned into small subsets. The spectral correlation within each partition is removed via a first-stage KLT. The interpartition spectral correlation is removed using a second-stage KLT applied to the resulting top few sets of equilevel principal component (PC) images. Since only a fraction of each equilevel first-stage PC images are used in the second stage, the KLT transformation matrices will have smaller sizes, leading to further improvement in computational complexity and coding efficiency. The computation of the proposed approach is parametrically quantified. It is shown that reconstructed image quality, as measured via statistical and/or machine-based exploitation measures, is improved by using a smaller partition size in the first-stage KLT. A criterion based on the components of the eigenvectors of the cross-covariance matrix is established to select first-stage PC images, which are used in the second-stage KLT. The proposed scheme also reduces the overhead bits required to transmit the covariance information to the receiver in conjunction with the coding bitstream.