Abstract
Hyperspectral imaging features an important issue in remote sens ing and applications. Requirement to collect high volumes of hyper spectral data in remote sensing algorithms poses a compression prob lem. To this end, many techniques or algorithms have been develop ed and continues to be improved in scientific literature. In this paper, we propose a recently developed lossy compression method whi ch is called tridiagonal folded matrix enhanced multivariance prod ucts representation (TFEMPR). This is a specific multidimensional array decomposition method using a new mathematical concept called 'folded matrix' and provides binary decomposi tion for multidimensional arrays. Beside the method a comparati ve analysis of compression algorithms is presented in this paper by means of compression performances. Compression performance of TFEMPR is compared with the state-art-methods such as compressive -projection principal component analysis, matching pursu it and block compressed sensing algorithms, etc., via average peak signal-to-noise ratio. Experiments with AVIRIS data set indicate a superior reconstructed image quality for the propo sed technique in comparison to state-of-the-art hyperspectral data compression methods.
Original language | English |
---|---|
Article number | 8410370 |
Pages (from-to) | 3272-3278 |
Number of pages | 7 |
Journal | IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing |
Volume | 11 |
Issue number | 9 |
DOIs | |
Publication status | Published - Sept 2018 |
Bibliographical note
Publisher Copyright:© 2008-2012 IEEE.
Keywords
- Approximation methods
- data compression
- decomposition and factorization methods
- hyperspectral imaging