Randomized ICA and LDA Dimensionality Reduction Methods for Hyperspectral Image Classification
Chippy Jayaprakash, Bharath Bhushan Damodaran, Sowmya V, K P Soman

TL;DR
This paper introduces randomized ICA and LDA methods using Random Fourier features for hyperspectral image classification, improving scalability and capturing non-linear data structures more efficiently than traditional kernel methods.
Contribution
The paper proposes novel randomized ICA and LDA techniques with Random Fourier features to enhance scalability and non-linear data modeling in hyperspectral image analysis.
Findings
Outperform traditional kernel ICA and LDA in accuracy.
Reduce computational time significantly.
Handle non-linearities more effectively.
Abstract
Dimensionality reduction is an important step in processing the hyperspectral images (HSI) to overcome the curse of dimensionality problem. Linear dimensionality reduction methods such as Independent component analysis (ICA) and Linear discriminant analysis (LDA) are commonly employed to reduce the dimensionality of HSI. These methods fail to capture non-linear dependency in the HSI data, as data lies in the nonlinear manifold. To handle this, nonlinear transformation techniques based on kernel methods were introduced for dimensionality reduction of HSI. However, the kernel methods involve cubic computational complexity while computing the kernel matrix, and thus its potential cannot be explored when the number of pixels (samples) are large. In literature a fewer number of pixels are randomly selected to partial to overcome this issue, however this sub-optimal strategy might neglect…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsLinear Discriminant Analysis · Independent Component Analysis
