Abstract

Nonlinear graph-based dimensionality reduction algorithms have been shown to be very effective at yielding low-dimensional representations of hyperspectral image data. However, the steps of graph construction and eigenvector computation often suffer from prohibitive computational and memory requirements. In the paper, we develop a semi-supervised deep auto-encoder network (SSDAN) that is capable of generating mappings that approximate the embeddings computed by the nonlinear DR methods. The SSDAN is trained with only a small subset of the original data and enables an expert user to provide constraints that can bias data points from the same class towards being mapped closely together. Once the SSDAN is trained on a small subset of the data, it can be used to map the rest of the data to the lower dimensional space, without requiring complicated out-of-sample extension procedures that are often necessary in nonlinear DR methods. Experiments on publicly available hyperspectral imagery (Indian Pines and Salinas) demonstrate that SSDANs compute low-dimensional embeddings that yield good results when input to pixel-wise classification algorithms.

Full Text
Paper version not known

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.