mlsanityData to 14 Oct 2026

Randomized Principal Component Analysis for Hyperspectral Image Classification

arXiv 2403.09117 ↗First posted 14 Mar 2024eess.IV cs.CV cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The high-dimensional feature space of the hyperspectral imagery poses major challenges to the processing and analysis of the hyperspectral data sets. In such a case, dimensionality reduction is necessary to decrease the computational complexity. The random projections open up new ways of dimensionality reduction, especially for large data sets. In this paper, the principal component analysis (PCA) and randomized principal component analysis (R-PCA) for the classification of hyperspectral images using support vector machines (SVM) and light gradient boosting machines (LightGBM) have been investigated. In this experimental research, the number of features was reduced to 20 and 30 for classification of two hyperspectral datasets (Indian Pines and Pavia University). The experimental results demonstrated that PCA outperformed R-PCA for SVM for both datasets, but received close accuracy values for LightGBM. The highest classification accuracies were obtained as 0.9925 and 0.9639 by LightGBM with original features for the Pavia University and Indian Pines, respectively.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 27 references that are in the map. First posted on arXiv 14 Mar 2024.

Builds on

3 of 27 references.

References · 3

  1. 2020Feature Extraction for Hyperspectral Imagery: The Evolution from Shallow to Deep (Overview and Toolbox)cited by 36
  2. 2013Advances in Hyperspectral Image Classification: Earth monitoring with statistical learning methodscited by 26
  3. 2019Projecting "better than randomly": How to reduce the dimensionality of very large datasets in a way that outperforms random projectionscited by 2

Built on by

Not cited yet.