返回
Low complexity block tree coding for hyperspectral image sensors
DOI:10.1007/s11042-022-13057-x.png)
摘要
En 中文
Complexity of any onboard hyperspectral image sensor is a challenging issue. The existing hyperspectral image compression algorithm plays a great role in reducing the data transmission bandwidth, data processing time, processing power and coding memory. Many wavelet transform-based set partitioned hyperspectral image compression algorithms are proposed in the past which work with lossy and lossless compression. These compression algorithms use lists or state tables to keep track of significant and insignificant sets or coefficients. The 3D wavelet block tree coding (3D-WBTC) has superior coding performance due to the exploitation of the inter sub-band & intra sub-band redundancy. The 3D-Low-Complexity Block Tree Coding (3D-LCBTC) is a novel implementation of 3D-WBTC which uses two state tables and very small size link lists. The 3D-LCBTC uses depth-first search approach which reduces the complexity of the compression process significantly. Thus, the proposed compression algorithm is a suitable candidate for resources-constrained onboard hyperspectral image sensors.
Keyword:
Lossy hyperspectral image compression
Wavelet transform
Computational complexity
Zero block cube tree
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
Einflu� der Geometrie auf Halleffekt und magnetischen Widerstandseffekt bei rechteckf�rmigen Halbleiterproben几何形状对矩形半导体样品霍尔效应和磁阻效应的影响
Domain- and symmetry-transition origins of reduced nanosecond piezoelectricity in ferroelectric/dielectric superlattices铁电/介电超晶格中纳米秒级压电性降低的畴和对称性转变起源
(Invited) Electric-Field and Thermally-Activated Failure Mechanisms of AlGaN/GaN High Electron Mobility Transistors(邀请报告) 电场和热激活的AlGaN/GaN高电子迁移率晶体管失效机制


