Abstract

Hyperspectral data classification has shown potential in many applications. However, a large number of spectral bands cause overfitting. Methods for reducing spectral bands, e.g., linear discriminant analysis, require matrix inversion. We propose a semidefinite programming for linear discriminants regularized difference (SLRD) criterion approach that does not require matrix inversion. The paper establishes a classification error bound and provides experimental results with ten methods over six hyperspectral datasets demonstrating the efficacy of the proposed SLRD technique.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call