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.
A computationally efficient adaptive 2-stage Karhunen-Loeve Transform (KLT) scheme for spectral decorrelation in
hyperspectal lossy bandwidth compression is presented. The component decorrelation of the JPEG 2000 (extension
2) is replaced with the proposed adaptive 2-stage KLT spectral decorrelation scheme. Direct application of a single
KLT across the entire set of hyperspectal imagery may not be computationally practical. The proposed scheme
alleviates this problem by partitioning the spectral data set into small subsets. The spectral correlation within each
partition is removed via the 1st-stage KLT operation. To remove the remaining inter-partition correlation, a 2nd-stage
KLT is applied to the top few sets of eaui-level principal component (PC) images from the 1st-stage. The
computation savings resulting from 2-stage KLT is parametrically quantified. The proposed adaptive 2-stage KLT
uses only a fraction of the equi-level 1st-stage PC images in the 2nd-stage KLT process. This adaptive scheme results
in reducing the size of the 2nd-stage KLT transformation matrices and further improvement in computational
complexity and coding efficiency. 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 1st-stage KLT. A criterion
based on the components of the eigenvectors of the cross-covariance matrix is established to identify such 1st-stage
PC images. The proposed adaptive spectral decorrelation scheme also reduces the overhead bits required to transmit
the covariance matrices, or eigenvectors, along the coding bit stream to the receiver through the downlink channel.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.