In this paper we propose a lossless compression algorithm for hyperspectral images based on distributed source coding; this algorithm represents a significant improvement over our prior work on the same topic, and has been developed during a project funded by ESA-ESTEC. In particular, the algorithm achieves good compression performance with very low complexity; moreover, it also features a very good degree of error resilience. These features are obtained taking inspiration from distributed source coding, and particularly employing coset codes and CRC-based decoding. As the CRC can be used to decode blocks using a reference different from that used to compress the image, this yields error resilience. In particular, if a block is lost, decoding using the closest collocated block in the second previous band is successful about 70% of the times.
Low-complexity and error-resilient hyperspectral image compression based on distributed source coding / A., Abrardo; M., Barni; A., Bertoli; A., Garzelli; Magli, Enrico; F., Nencini; B., Penna; R., Vitulli. - (2008), pp. 1-8. (Intervento presentato al convegno SPIE EUROPE Remote Sensing nel SEPT. 2008) [10.1117/12.799990].
Low-complexity and error-resilient hyperspectral image compression based on distributed source coding
MAGLI, ENRICO;
2008
Abstract
In this paper we propose a lossless compression algorithm for hyperspectral images based on distributed source coding; this algorithm represents a significant improvement over our prior work on the same topic, and has been developed during a project funded by ESA-ESTEC. In particular, the algorithm achieves good compression performance with very low complexity; moreover, it also features a very good degree of error resilience. These features are obtained taking inspiration from distributed source coding, and particularly employing coset codes and CRC-based decoding. As the CRC can be used to decode blocks using a reference different from that used to compress the image, this yields error resilience. In particular, if a block is lost, decoding using the closest collocated block in the second previous band is successful about 70% of the times.| File | Dimensione | Formato | |
|---|---|---|---|
|
europto_08.pdf
accesso aperto
Descrizione: postprint author version
Tipologia:
2. Post-print / Author's Accepted Manuscript
Licenza:
Pubblico - Tutti i diritti riservati
Dimensione
447.6 kB
Formato
Adobe PDF
|
447.6 kB | Adobe PDF | Visualizza/Apri |
|
Magli-Low-complexity.pdf
accesso aperto
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Pubblico - Tutti i diritti riservati
Dimensione
180.97 kB
Formato
Adobe PDF
|
180.97 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1895982
