Low memory block tree coding for hyperspectral images

Abstract

Hyperspectral image sensors are resource constrained and have limited on-board memory. Processing of high volume hyperspectral images pose a challenge to the memory and resources of the sensor. Contemporary wavelet based image compression schemes have intensive memory requirement of which 3D-WBTC have superior coding performance due to through the exploitation of the inter sub-band & intra sub-band redundancy. This paper presents a low memory implementation of 3D-WBTC which is a listless scheme by using the fixed size state memory to keep track of block set partitioning and significance testing of wavelet coefficients of transformed hyperspectral images. Memory access time is significantly reduced due to the elimination of lists that leads to reduced complexity. Simulation results of the proposed scheme shows that proposed coder is fast and have very low memory requirement thereby making it a suitable candidate for implementation in resource constrained hyper spectral image sensor.