3D-One List Set Partitioning in Hierarchical Trees Coding Algorithm for Onboard WMSNs

Wavelet transform-based set-partitioned hyperspectral image compression algorithms have comparatively better coding efficiency, moderate coding complexity, embeddedness property, and scalability property. These compression algorithms use linked lists, arrays, or state tables to track the significance/insignificance of the partitioned sets/coefficients. The 3D-Set Partitioning in Hierarchical Trees (3D-SPIHT) employs three linked lists for the tracking of the significant/insignificant coefficients or zerotree nodes. These linked lists create problems associated with the coding complexity and exponential growth of coding memory. There are many listless compression algorithms for hyperspectral images that have been proposed in the past, but they suffer from low coding efficiency. The proposed compression algorithm 3D-One List- SPIHT (3D-OL-SPIHT) uses the same partition rule as 3D-SPIHT, but it has a single list for tracking of coefficients or zerotree nodes instead of three lists in 3D-SPIHT. From the experimental results, it is clear that the proposed compression algorithm reduces the coding complexity, coding memory demand, and increases the coding efficiency compared to 3D-SPIHT.