Dimension reduction and pre-emphasis for compression of hyperspectral images

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As the dimensionality of remotely sensed data increases, the need for efficient compression algorithms for hyperspectral images also increases. However, when hyperspectral images are compressed with conventional image compression algorithms, which have been developed to minimize mean squared errors, discriminant information necessary to distinguish among classes may be lost during compression process. In this paper, we propose to enhance such discriminant information prior to compression. In particular, we first find a new basis where class separability is better represented by applying a feature extraction method. However, due to high correlations between adjacent bands of hyperspectral data, we have singularity problems in applying feature extraction methods. In order to address the problem, we first reduce the dimension of data and then find a new basis by applying a feature extraction algorithm. Finally, dominant discriminant features are enhanced and the enhanced data are compressed using a conventional compression algorithm such as 3D SPIHT. Experiments show that the proposed compression method provides improved classification accuracies compared to the existing compression algorithms. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Lee, C., Choi, E., Choe, J., & Jeong, T. (2004). Dimension reduction and pre-emphasis for compression of hyperspectral images. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3212, 446–453. https://doi.org/10.1007/978-3-540-30126-4_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free