.png){kind=icon}
.png){kind=icon}
Return
The linear prediction vector quantization for hyperspectral image compression
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-018-6724-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a hyperspectral image compression method is proposed. It is based on spectral clustering, linear prediction and the vector quantization (VQ). Since the hyperspectral image has stronger spectral correlation than spatial correlation, the spectral clustering and model of linear prediction are introduced to reduce the spectral correlation. In the proposed method, spectral clustering algorithm of K-means is employed, and the centroids of clustered results are used as reference bands, then the reference bands are employed in the model of linear prediction to compute the prediction error, finally the prediction error is encoded by VQ. The experiments results using AVIRIS images are compared to IVQ and AR+SubPCA+JPEG2000 algorithm, the results show that our proposed algorithm outperforms other algorithms.
Keywords:
Hyperspectral images compression
K-means
Linear prediction
Vector quantization (VQ)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W