返回
Low complexity image coding technique for hyperspectral image sensors
DOI:10.1007/s11042-023-14738-x.png)
摘要
En 中文
Memory management and coding complexity are the major challenging issues of any hyperspectral image sensor. The hyperspectral image compression algorithm plays a greater role to improve the hyperspectral image sensor performance and save sensor memory. Many compression algorithms for hyperspectral images were proposed in past. The wavelet transform-based set partitioned hyperspectral image compression algorithms generate embedded output bit stream and also perform both lossy & lossless compression which makes them an ideal choice for any type of image sensor. The set portioned image compression algorithms use linked list or state table or markers to track the significance or insignificance of the block cube or coefficients. The linked lists grow with the bit rate which creates memory management issue while state tables or marker size is fixed which is not favorable with the low bit rate. In this study, a novel implementation of the set partitioned compression algorithm is proposed which employs parallel processing to reduce the coding complexity and exploits the linear indexing of the wavelet transform to track the set or coefficients to save the coding memory. The simulation results show the proposed compression algorithm 3D-BCP-ZM-SPECK reduces the coding complexity multiple folds with no need of coding memory.
Keyword:
Lossy hyperspectral image compression
Wavelet transform
Computational complexity
Zero block cube tree
Parallel processing
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
Recent results in development in Russia of megawatt power gyrotrons for fusion俄罗斯在用于聚变的大功率兆瓦级回旋管研发方面的最新进展
(Invited) Electric-Field and Thermally-Activated Failure Mechanisms of AlGaN/GaN High Electron Mobility Transistors(邀请报告) 电场和热激活的AlGaN/GaN高电子迁移率晶体管失效机制
Treatment challenges and outcomes for pediatric intracranial ependymoma at a single institution in Iran伊朗某机构关于儿童颅内室管膜瘤的治疗挑战与结果


