Fast Spatial Spectral Schroedinger Eigenmaps algorithm for hyperspectral feature extraction

摘要

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.