A lossy to lossless three-dimensional (3D) compression of hyperspectral images is presented. On the spectral dimension,
a low complexity reversible integer Karhunen-Loève transform (KLT) is used to fully exploit the spectral redundancy,
while two-dimensional spatial combinative lifting algorithm (SCLA)-based integer wavelet transform is applied on the
spatial dimension. At the low complexity KLT, the calculation processing of covariance matrix is carried out on a subset
of vectors that is pseudorandomly selected from the complete set of spectral vectors. The transform matrix is factorized
into triangular elementary reversible matrices (TERM) for reversible integer mapping and the lifting scheme is applied to
implement integer KLT. The 3D asymmetric significance tree structure is then constructed from the 3D asymmetric
orientation tree in 3D transformed domain. Each coefficient is then encoded by the significance test of the 3D
asymmetric significance tree node at each bitplane instead of ordered lists to track the significance status of the tree or
block sets and coefficients. This algorithm has low complexity and can be applied to lossy to lossless progressive
transmission.
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.