Vector quantization using spectral index-based multiple subcodebooks for hyperspectral data compression

doi:10.1109/36.843010

Return

Vector quantization using spectral index-based multiple subcodebooks for hyperspectral data compression

2000-05-01

PRE

A. Hollinger

Daniel J. Williams

D. Manak

DOI：10.1109/36.843010

Original

Original request for help

Save

Abstract

En 中文

This paper describes a spectral index (SI)-based multiple subcodebook algorithm (MSCA) for lossy hyperspectral data compression. The scene of a hyperspectral dataset to be compressed is delimited into n regions by segmenting its SI image. The spectra in each region have similar spectral characteristics. The dataset is then separated into n subsets, corresponding to the n regions. While keeping the total number of codevectors the same (i.e. the same compression ratio), not just a single codebook, but n smaller and more efficient subcodebooks are generated. Each subcodebook is used to compress the spectra in the corresponding region. With the MSCA, both the codebook generation time (CGT) and coding time (CT) carl be improved by a factor of around n at almost no loss of fidelity, Four segmentation methods for delimiting the scene of the data cube were studied. Three hyperspectral vector quantization data compression systems that use the improved techniques were simulated and tested. The simulation results show that the CCT could he reduced by more than three orders of magnitude, while the quality of the codebooks remained good. The overall professing speed of the compression systems could be improved by a factor of around 1000 at an average fidelity penalty of 1.0 dB.

Keywords:

hyperspectral data

lossy data compression

scene segmentation

spectral index

vector quantization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.