Answers are grounded in this paper and cite their sources.
The proposed hyperspectral image compression algorithm employs 2D dyadic wavelet transform to transform spectral frames and encode each plane using the 3D-Low Memory Block Tree Coding algorithm starting from the higher bit plane to the lower bit plane. The 3D dyadic wavelet transform which employees a significant memory in the transformation process, posing a challenge to the resource constraint hyperspectral image sensors. The results show that the proposed algorithm requires a low memory while maintaining the coding gain and complexity at par to the 3D wavelet transform based hyperspectral image compression algorithms.
No takes yet. Share an insight, caveat, or question.
Bajpai et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: