A Training Band Selection Algorithm for Sparse Representation based Hyperspectral Data Compression

2012 ◽  
Author(s):  
Qian Wu ◽  
Rong Zhang ◽  
Dong Yin ◽  
Chengfu Huo
Keyword(s):  
Data Compression ◽  
Sparse Representation ◽  
Hyperspectral Data ◽  
Band Selection ◽  
Selection Algorithm

scholarly journals Efficient Lossless Compression of Multitemporal Hyperspectral Image Data

2018 ◽  
Vol 4 (12) ◽  
pp. 142 ◽  
Author(s):  
Hongda Shen ◽  
Zhuocheng Jiang ◽  
W. Pan
Keyword(s):  
Data Compression ◽  
Hyperspectral Image ◽  
Image Data ◽  
Lossless Compression ◽  
Large Data ◽  
Hyperspectral Data ◽  
Compression Performance ◽  
Temporal Correlations ◽  
Sensing Applications ◽  
Data Volume

Hyperspectral imaging (HSI) technology has been used for various remote sensing applications due to its excellent capability of monitoring regions-of-interest over a period of time. However, the large data volume of four-dimensional multitemporal hyperspectral imagery demands massive data compression techniques. While conventional 3D hyperspectral data compression methods exploit only spatial and spectral correlations, we propose a simple yet effective predictive lossless compression algorithm that can achieve significant gains on compression efficiency, by also taking into account temporal correlations inherent in the multitemporal data. We present an information theoretic analysis to estimate potential compression performance gain with varying configurations of context vectors. Extensive simulation results demonstrate the effectiveness of the proposed algorithm. We also provide in-depth discussions on how to construct the context vectors in the prediction model for both multitemporal HSI and conventional 3D HSI data.

scholarly journals Hyperspectral data compression based upon the principal component analysis

2021 ◽  
Vol 45 (2) ◽  
pp. 235-244
Author(s):  
A.S. Minkin ◽  
O.V. Nikolaeva ◽  
A.A. Russkov
Keyword(s):  
Principal Component Analysis ◽  
Data Compression ◽  
Principal Component ◽  
Component Analysis ◽  
Hyperspectral Data ◽  
Gas Absorption ◽  
Absorption Bands ◽  
Spectral Bands ◽  
The Mean ◽  
Retrieval Errors

The paper is aimed at developing an algorithm of hyperspectral data compression that combines small losses with high compression rate. The algorithm relies on a principal component analysis and a method of exhaustion. The principal components are singular vectors of an initial signal matrix, which are found by the method of exhaustion. A retrieved signal matrix is formed in parallel. The process continues until a required retrieval error is attained. The algorithm is described in detail and input and output parameters are specified. Testing is performed using AVIRIS data (Airborne Visible-Infrared Imaging Spectrometer). Three images of differently looking sky (clear sky, partly clouded sky, and overcast skies) are analyzed. For each image, testing is performed for all spectral bands and for a set of bands from which high water-vapour absorption bands are excluded. Retrieval errors versus compression rates are presented. The error formulas include the root mean square deviation, the noise-to-signal ratio, the mean structural similarity index, and the mean relative deviation. It is shown that the retrieval errors decrease by more than an order of magnitude if spectral bands with high gas absorption are disregarded. It is shown that the reason is that weak signals in the absorption bands are measured with great errors, leading to a weak dependence between the spectra in different spatial pixels. A mean cosine distance between the spectra in different spatial pixels is suggested to be used to assess the image compressibility.

Evaluation Method for Band Selection Algorithms of Hyperspectral Image

2013 ◽  
Vol 684 ◽  
pp. 495-498
Author(s):  
Bai He Wang ◽  
Shi Qi Huang ◽  
Yi Hong Li
Keyword(s):  
Data Fusion ◽  
Dimension Reduction ◽  
Evaluation Method ◽  
Hyperspectral Image ◽  
Band Selection ◽  
Selection Algorithm ◽  
Amount Of Information ◽  
Algorithm Evaluation ◽  
Common Band ◽  
Selection Algorithms

Band selection algorithm is most important in data dimension reduction of hyperspectral image. There are many algorithms of band selection, but there are only few methods to do algorithm evaluation. A method is put forward in this paper to evaluate the band selection algorithm of hyperspectral image. The amount of information, brightness, image contrast and definition are defined as 4 indexes to measure deferent data fusion based on various band selection results. Based on the measurement, the evaluation of band selection algorithm is realized. In the paper, the evaluation method is used in the compare of 4 common band selection algorithms, the result of measurement is analyzed and the feasibility is verified.

Sign in / Sign up

Export Citation Format

Share Document