Abstract

Based on the Laplacian Eigenmaps (LE) algorithm and a potential matrix, the Spatial Spectral Schroedinger Eigenmaps (SSSE) technique has proved a great yield during the hyperspectral dimensionality reduction process. Experimentally, SSSE is in deficiency of high computing time which may hinder its contribution in the remote sensing field. In this paper, a fast variant of the SSSE approach, called Fast SSSE, was proposed. The new suggested method substitutes the quadratic constraint employed during the optimization problem, by a linear constraint. This overhaul preserves the data properties in analogous way to the SSSE technique, but with a fast implementation. Two real hyperspectral data sets were adopted during the experimental process. Experiment analysis exhibited good classification accuracy with a reduced computational effort, compared with the original SSSE approach.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.