The Hyper-spectral Image Compression Based on K-Means Clustering and Parallel Prediction Algorithm*
In this paper, we propose a lossless compression algorithm for hyper-spectral images with the help of the K-Means clustering and parallel prediction. We use K-Means clustering algorithm to classify hyper-spectral images, and we obtain a number of two dimensional sub images. We use the adaptive predi...
Main Authors: | Wenbin Wu, Wu Yue, Li Jintao |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2018-01-01
|
Series: | MATEC Web of Conferences |
Online Access: | https://doi.org/10.1051/matecconf/201817303071 |
Similar Items
-
Parallel Compression Based on Prediction Algorithm of Hyper-spectral Imagery
by: Wu Wenbin, et al.
Published: (2018-01-01) -
Parallelization of K-Means Clustering Algorithm for Data Mining
by: Jiang Hao, et al.
Published: (2017-01-01) -
Compression of hyper-spectral images using an accelerated nonnegative tensor decomposition
by: Li Jin, et al.
Published: (2017-12-01) -
An Effective Feature Segmentation Algorithm for a Hyper-Spectral Facial Image
by: Yuefeng Zhao, et al.
Published: (2018-10-01) -
Looking Through Paintings by Combining Hyper-Spectral Imaging and Pulse-Compression Thermography
by: Stefano Laureti, et al.
Published: (2019-10-01)